Name
Title | ||
|---|---|---|
ACHIEVABLE RATE ANALYSIS OF GEOMETRICALLY ROBUST DATA-HIDING CODES IN ASYMPTOTIC SET-UPS |
Abstract | ||
|---|---|---|
Geometrical transformations bring synchronization prob- lems into the robust digital data-hiding. Previous works on this subject were concentrated on the robustness to particu- lar geometrical transformations. In this paper, the achievable rates of reliable robust data-hiding in channels with geomet- rical transformations are investigated from an information- theoretic point of view for theoretical set-ups, where lengths of data sequences asymptotically approach infinity. |
Year | Venue | Field |
|---|---|---|
2005 | EUSIPCO | Synchronization,Digital watermarking,Upper and lower bounds,Computer science,Algorithm,Robustness (computer science),Theoretical computer science,Robust statistics,Decoding methods,Encoding (memory),Reliability theory |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
1 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emre Topak | 1 | 16 | 3.22 |
| Sviatoslav Voloshynovskiy | 2 | 773 | 80.94 |
| O. Koval | 3 | 128 | 15.81 |
| Thierry Pun | 4 | 3553 | 290.95 |