A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function

This study presents a simple method for high-hiding capacity. The basic concept uses a modulus operation. The proposed method has the following advantages: (1) the proposed method outperforms the simple LSB substitution method given the same range (0–m−1) of data digits in the embedded data; (2) the proposed method achieves good image vision quality without the need for post-processing; (3) the proposed method is almost as simple as the LSB method in both coding and decoding; (4) the smaller error advantage over the simple LSB substitution method can also be mathematically verified; (5) the error is smaller than ⌈(m−1)/2⌉ for almost every pixel; (6) the proposed method has high-hiding capacity (for example, the proposed method can hide a 256×256 or 256×512 image in a 512×512 host image).

[1]  Ja-Chen Lin,et al.  Image hiding by optimal LSB substitution and genetic algorithm , 2001, Pattern Recognit..

[2]  守谷 健弘,et al.  Digital signal encoding method, decoding method, encoding apparatus, decoding apparatus and a digital signal encoding program, a decoding program , 2003 .

[3]  Walter Bender,et al.  Techniques for data hiding , 1995, Electronic Imaging.

[4]  Wen-Nung Lie,et al.  Data hiding in images with adaptive numbers of least significant bits based on the human visual system , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[5]  Jiri Fridrich,et al.  Images with self-correcting capabilities , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[6]  Walter Bender,et al.  Applications for data hiding , 2000, IBM Syst. J..

[7]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.