Lossless Information Hiding Scheme Based on Pixels Complexity Analysis
Tzu-Chuen Lu, Cheng-Chun Huang · 2007
This paper proposes an effective lossless information hiding scheme, in which a host image is quantized firstly to generate spare spaces for hiding secret messages. The proposed scheme applies the complexity analysis of neighboring pixels to predict the number of secret message bits concealed in a pixel. In addition, it reserves the differences between the host image and the quantized image for completely restoring the host image. According to the experimental results, the information capacity of the proposed scheme is 0.9 bpp for the standard Lena while that of Maniccam and Bourbakispsilas scheme is 0.3 bpp.