2017
DOI: 10.1016/j.jvcir.2017.10.001
|View full text |Cite
|
Sign up to set email alerts
|

Reversible data hiding using multi-pass pixel value ordering and prediction-error expansion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
33
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 56 publications
(33 citation statements)
references
References 35 publications
0
33
0
Order By: Relevance
“…These results demonstrates that the proposed scheme is fragile against various manipulations. approaches, found in literature, can perform equally but most of them lack our simplicity [20,25,28]. Visual image quality is tested after hiding various payload magnitudes (0.05bpp, 0.1bpp, 0.15bpp, 0.2bpp, 0.25bpp).…”
Section: Comparison With Existing Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…These results demonstrates that the proposed scheme is fragile against various manipulations. approaches, found in literature, can perform equally but most of them lack our simplicity [20,25,28]. Visual image quality is tested after hiding various payload magnitudes (0.05bpp, 0.1bpp, 0.15bpp, 0.2bpp, 0.25bpp).…”
Section: Comparison With Existing Approachesmentioning
confidence: 99%
“…Therefore, fully reversible watermarking techniques, which can completely recover both the original unmodified image and the embedded watermark, are developed. Reversible watermarking approaches can be categorized into four groups: compression based [7,10], histogram modification based [16,21,33], quantization based [22,23] and Difference Expansion (DE) based [20,28]. Reversible watermarking based on the DE technique are recommended by many recent studies, and typically exceed alternate reversible methods in terms of higher payload capacity and lower complexity [20,28,41].…”
Section: Introductionmentioning
confidence: 99%
“…and C(i,j) =C(i,j). Otherwise, L 2 (i,j)=0 and s is embedded according to (12). Moreover, secret bits are not embedded into those pixels marked by L 1 and L 2 .…”
Section: Data Embedding With Additive Homomorphismmentioning
confidence: 99%
“…DE based algorithms usually shift the difference of neighboring pixels for creating a vacant least significant bit (LSB) and append one secret bit to the vacated LSB [5,6]. The HS based algorithms firstly shift the bins of histogram of gray values [7] or the predicted errors [8][9][10][11][12] for generating vacated space and then embed secret data into the vacated space. This kind of algorithms can provide a good trade-off between embedding capacity and visual quality.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation