Reversible Watermarking by Difference Expansion
Citations
[...]
2,849 citations
2,739 citations
Cites background from "Reversible Watermarking by Differen..."
...…© 2003 IEEE original values in the embedding area) is larger than that of the embedding area, techniques in [1], [7]–[9] rely on lossless data compression on the original values in the embedding area, and the space saved from compression will be used for embedding the payload....
[...]
1,149 citations
Cites background or methods from "Reversible Watermarking by Differen..."
...It should be mentioned here that the difference expansion transform used by Tian [11] is a special case of the above transform and can be obtained by setting and ....
[...]
...His algorithm first quantizes each pixel by a quantizer of step size, compresses the quantization noise and appends a payload to it, then adds an -ary representation of the result to the quantized image....
[...]
258 citations
Cites methods from "Reversible Watermarking by Differen..."
...Methods are based on lossless compression appending, difference expansion [23], [24], histogram shifting [5], [15], [22] or a combination of these schemes [16], [21]....
[...]
180 citations
Cites background from "Reversible Watermarking by Differen..."
...Problem of couple integrity (Image/ Signature) DCT coefficients [112,114,116,120] Moments [145] DWT coefficients [124-125,131-139] Histograms [99] Edges [102103,110] Statistics [140-144]...
[...]
...Interested readers could consult references [34, 40, 64, 133] on this subject....
[...]
References
1,126 citations
"Reversible Watermarking by Differen..." refers background in this paper
...As the amount of information needed to be embedded (payload and original values in the embedding area) is larger than that of the embedding area, most reversible watermarking techniques [1, 2, 3, 6] rely on lossless data compression on the original values in the embedding area, and the space saved from compression will be used for embedding the payload....
[...]
...Reversible watermarking [1, 2, 3, 4, 6, 7, 8], is a special digital watermark with an intriguing feature that when watermarked content has been authenticated, one can remove the watermark to retrieve the original, unwatermarked content....
[...]
982 citations
702 citations
"Reversible Watermarking by Differen..." refers background in this paper
...As the amount of information needed to be embedded (payload and original values in the embedding area) is larger than that of the embedding area, most reversible watermarking techniques [1, 2, 3, 6] rely on lossless data compression on the original values in the embedding area, and the space saved from compression will be used for embedding the payload....
[...]
...Reversible watermarking [1, 2, 3, 4, 6, 7, 8], is a special digital watermark with an intriguing feature that when watermarked content has been authenticated, one can remove the watermark to retrieve the original, unwatermarked content....
[...]
472 citations
273 citations
"Reversible Watermarking by Differen..." refers methods in this paper
...The location map (a one-bit bitmap) will be lossless compressed by a JBIG2 compression [5] or run-length coding....
[...]