Keywords: reversible data hiding, histogram shifting, median difference, difference expansion, difference histogram
Received April 15, 2009; revised April 27, 2009; accepted May 21, 2009.
Communicated by H. Y. Mark Liao.
| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] | [ 22] | [ 23] | [ 24] |
¡@
HSIEN-WEI YANG1,2, I-EN LIAO* AND CHAUR-CHIN CHEN+
1Department of Information Management
Overseas Chinese University
Taichung, 407 Taiwan
2Department of Applied Mathematics
*Department of Computer Science and Engineering
National Chung Hsing University
Taichung, 402 Taiwan
+Department of Computer Science
National Tsing Hua University
Hsinchu, 300 Taiwan
This work proposes a reversible data hiding algorithm that is based on the median
difference histogram. The method divides the cover image into non-overlapping identical
blocks. In each block, the median pixel is selected to calculate absolute differences
between the median pixel value and the values of the other pixels. Then, these differences
are used to generate a histogram and the histogram shifting method is adopted to embed
data. The method can reduce the values of differences and increase the maximum frequency
of the histogram. Therefore, the hiding capacity can be increased. Experimental
results are presented to prove the validity of the proposed algorithm.
Received April 15, 2009; revised April 27, 2009; accepted May 21, 2009.
Communicated by H. Y. Mark Liao.