Reversible Data Hiding Based on Partitioning the Prediction Values
- 41 Downloads
In this paper, we present a new reversible data hiding (RDH) method. Instead of directly dividing the neighboring pixels into blocks, we sort the pixels according to their prediction values first, and then the sorted sequence is partitioned into non-overlapping blocks. That is, different from that in pixel value ordering (PVO) series only the neighboring pixels can be divided into the same block, in our new scheme the pixels far apart from each other in space may be divided into the same block in case they have the similar pixel values. Thus much redundancy in image can be exploited and a sharper prediction error histogram is easy to be obtained for data embedding. To achieve better performance, a new adaptive embedding strategy is also proposed. The experimental results show that our new method is superior to the traditional PVO based methods.
KeywordsReversible data hiding Pixel value ordering Prediction value
This work is partially supported by the National Natural Science Foundation of China (61772572), the NSFC-NRF Scientific Cooperation Program (61811540409), and the Natural Science Foundation of Guangdong Province of China (2017A030313366).
- 1.Fridrich, J., Goljan, M., Du, R.: Invertible authentication. In: Proceedings SPIE Security Watermarking Multimedia Contents, San Jose, CA, January 2001, pp. 197–208 (2001)Google Scholar
- 12.Pen, F., Li, X., Yang, B.: Improved PVO-based reversible data hiding. Digit. Sig. Proc. 25(2), 255–265 (2014)Google Scholar