Name
Abstract | ||
|---|---|---|
In this work, we consider the text data-hiding problem as a particular instance of the well-known Gel'fand-Pinsker problem [1]. The text, where some message $m \in \mathcal{M}$ is to be hidden, is represented by x and called cover text. Each component xi, i = 1, 2, ..., N, of x represents one character from this text. Here, we define a character as an element from a given language alphabet (e.g. the latin alphabet {A, B, ..., Z}). To be more precise, we conceive each character xi as a data structure consisting of multiple component fields (features): name, shape, position, orientation, size, color, etc. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11552055_34 | Communications and Multimedia Security |
Keywords | Field | DocType |
multiple component field,printed text document,particular instance,theoretical framework,well-known gel,latin alphabet,fand-pinsker problem,component xi,language alphabet,data structure,character xi,data hiding | Data structure,Discrete mathematics,Latin alphabet,Computer science,Information hiding,Information protection policy,Electronic document,Color image,Alphabet | Conference |
Volume | ISSN | ISBN |
3677 | 0302-9743 | 3-540-28791-4 |
Citations | PageRank | References |
4 | 0.46 | 1 |
Authors | ||
8 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Villan | 1 | 87 | 6.79 |
| S. Voloshynovskiy | 2 | 384 | 28.34 |
| F. Deguillaume | 3 | 71 | 5.59 |
| Y. Rytsar | 4 | 20 | 1.37 |
| O. Koval | 5 | 34 | 2.48 |
| E. Topak | 6 | 20 | 2.05 |
| E. Rivera | 7 | 4 | 0.46 |
| T. Pun | 8 | 32 | 2.10 |