Local binary pattern‐based reversible data hiding

Abstract

Abstract A novel local binary pattern‐based reversible data hiding (LBP‐RDH) technique has been suggested to maintain a fair symmetry between the perceptual transparency and hiding capacity. During embedding, the image is divided into various 3×3 blocks. Then, using the LBP‐based image descriptor, the LBP codes for each block are computed. Next, the obtained LBP codes are XORed with the embedding bits and are concealed in the respective blocks using the proposed pixel readjustment process. Further, each cover image (CI) pixel produces two different stego‐image pixels. Likewise, during extraction, the CI pixels are restored without the loss of a single bit of information. The outcome of the proposed technique with respect to perceptual transparency measures, such as peak signal‐to‐noise ratio and structural similarity index, is found to be superior to that of some of the recent and state‐of‐the‐art techniques. In addition, the proposed technique has shown excellent resilience to various stego‐attacks, such as pixel difference histogram as well as regular and singular analysis. Besides, the out‐off boundary pixel problem, which endures in most of the contemporary data hiding techniques, has been successfully addressed.

Keywords

• hiding capacity (HC)
• local binary pattern (LBP)
• peak signal‐to‐noise ratio (PSNR)
• reversible data hiding