TY - JOUR

T1 - Invariability of Mean Value Based Reversible Watermarking

AU - Weng, Shaowei

AU - Chu, Shu-Chuan

AU - Cai, Nian

AU - Zhan, Rongxin

PY - 2013

Y1 - 2013

N2 - By employing invariant relation between the mean value of the first (n - 1) pixels and the last one pixel (also called the remaining pixel) for every image block containing n pixels, a new reversible watermark scheme capable of mostly carrying 2n-3 bits into one n-sized image block in a single embedding process is presented in this paper. First, the mean value of the first (n - 1) pixel is calculated. Next, the difference value between the last one pixel and this obtained mean value is applied to distinguish which classification (i.e., smooth or complex sub-block) any sub-block belongs to. Consequently, it is determined to embed (n - 2) bits or 2(n - 2) bits into each sub-block according to its final classification results. And meanwhile, the mean value is reapplied to predict this last one pixel. 1-bit watermark is embedded into this last one pixel in accordance with the magnitude of prediction-error value. By multi-employing invariability of the mean value of (n-1) pixels, the embedding rate can approach to (2 - 3/n) bpp (bit per pixel) for a single embedding process. Meanwhile, the embedding distortion is greatly controlled by embedding more bits into smooth image blocks and fewer bits into the other blocks with complex texture. Experimental results reveal the proposed scheme is effective.

AB - By employing invariant relation between the mean value of the first (n - 1) pixels and the last one pixel (also called the remaining pixel) for every image block containing n pixels, a new reversible watermark scheme capable of mostly carrying 2n-3 bits into one n-sized image block in a single embedding process is presented in this paper. First, the mean value of the first (n - 1) pixel is calculated. Next, the difference value between the last one pixel and this obtained mean value is applied to distinguish which classification (i.e., smooth or complex sub-block) any sub-block belongs to. Consequently, it is determined to embed (n - 2) bits or 2(n - 2) bits into each sub-block according to its final classification results. And meanwhile, the mean value is reapplied to predict this last one pixel. 1-bit watermark is embedded into this last one pixel in accordance with the magnitude of prediction-error value. By multi-employing invariability of the mean value of (n-1) pixels, the embedding rate can approach to (2 - 3/n) bpp (bit per pixel) for a single embedding process. Meanwhile, the embedding distortion is greatly controlled by embedding more bits into smooth image blocks and fewer bits into the other blocks with complex texture. Experimental results reveal the proposed scheme is effective.

KW - Invariability of mean value

KW - Reversible watermarking

UR - http://www.jihmsp.org/~jihmsp/2013/vol4/JIH-MSP-2013-02-002.pdf

UR - http://www.scopus.com/inward/record.url?scp=84874857468&partnerID=8YFLogxK

M3 - Article

VL - 4

SP - 90

EP - 98

JO - Journal of Information Hiding and Multimedia Signal Processing

JF - Journal of Information Hiding and Multimedia Signal Processing

SN - 2073-4212

IS - 2

ER -