2009
DOI: 10.1007/978-3-642-10467-1_77
|View full text |Cite
|
Sign up to set email alerts
|

Toward Quality Improvement in Location Map Free Reversible Watermarking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…In [15], we proposed an alternative transform to increase the quality of the marked image by employing the checkerboard structure. In [16], we expand the algorithm by utilizing a new error control strategy to decrease the size of auxiliary data. Since, this kind of reversible embedding algorithm does not employ a location map and the size of auxiliary data is negligible, it can be used to make the method more robust against some geometrical attacks.…”
Section: Robustness Concept In Reversible Watermarkingmentioning
confidence: 99%
See 1 more Smart Citation
“…In [15], we proposed an alternative transform to increase the quality of the marked image by employing the checkerboard structure. In [16], we expand the algorithm by utilizing a new error control strategy to decrease the size of auxiliary data. Since, this kind of reversible embedding algorithm does not employ a location map and the size of auxiliary data is negligible, it can be used to make the method more robust against some geometrical attacks.…”
Section: Robustness Concept In Reversible Watermarkingmentioning
confidence: 99%
“…Lossless data embedding can be classified into the following categories: the first one utilizes additive spread spectrum [1,2]; the second category compresses the selected image features for creating vacancy [3,4], and employs this spare space for embedding; the third group, namely expansion-based methods [5][6][7][8][9][10][11][12][13][14][15][16], embeds the watermark data in some features by expanding them; these features are created by some decorrelation operator, and finally, some methods are based on histogram modification [17,18] in which peak/zero points of the histogram either in spatial domain or transform domain are utilized for embedding.…”
Section: Introductionmentioning
confidence: 99%