2009
DOI: 10.1109/tcsvt.2009.2020257
|View full text |Cite
|
Sign up to set email alerts
|

Reversible Watermarking Algorithm Using Sorting and Prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
625
0
12

Year Published

2012
2012
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 757 publications
(639 citation statements)
references
References 21 publications
2
625
0
12
Order By: Relevance
“…By comparing the proposed scheme with some recently high-performance reversible data hiding methods, such as two DE based methods in prediction errors (Sachnev et al [3] and Li et al [4]), and the HS based method proposed by Tai et al [8], for low payload application, the superiority of our scheme is verified.…”
Section: Resultsmentioning
confidence: 86%
See 4 more Smart Citations
“…By comparing the proposed scheme with some recently high-performance reversible data hiding methods, such as two DE based methods in prediction errors (Sachnev et al [3] and Li et al [4]), and the HS based method proposed by Tai et al [8], for low payload application, the superiority of our scheme is verified.…”
Section: Resultsmentioning
confidence: 86%
“…3, our scheme achieves the best performance curves at the rate between 0.005 bpp and 0.2 bpp. Compared with DE based schemes [3] and [4], although small prediction errors were determined to hide secret data by using sorting technique for small capacity embedding, the distortion caused by data embedding via PE = 2PE + w in DE method is generally not less than that caused by PE = PE + w in HS based scheme, which shows the advantage of our HS based algorithm. Moreover, since the sorting technique in [3] was performed according to variances computed by neighboring pixels, the actual prediction errors with small value may be not accurately estimated and chosen in some high-texture images.…”
Section: Resultsmentioning
confidence: 94%
See 3 more Smart Citations