Reversible data hiding based on an adaptive pixel-embedding strategy and two-layer embedding

Abstract

Recently, Peng et al. proposed a reversible data-hiding (RDH) method based on pixel value ordering (PVO) and prediction-error expansion. In their method, the maximum and minimum of a pixel block are predicted and modified to embed data, and reversibility is guaranteed by keeping the PVO of each block invariant after embedding. In this paper, a novel RDH method is proposed by incorporating an adaptive pixel-modification strategy into Peng et al.’s work. In our method, the smoother a block, the more data it can carry. Unlike Peng et al.’s method, which embeds data uniformly, ours can embed data (e.g., 2, 4, or 6 bits) adaptively into a block according to the local complexity. Specifically, the local complexity is classified into four levels according to the strength of the correlation between each block and its neighborhood. Then the number of pixels to be modified is determined by the complexity level such that more bits are embedded into a block located in a smoother region. Moreover, two embedding layers are utilized together to further decrease the embedding distortion. Extensive experiments verify that the proposed method outperforms Penget al.’s, Ou et al.’s, Li et al.’s, Sachnev et al.’s, and Hong et al.’s works.