A Generalized Fibonacci LSB Data Hiding Technique

In this contribution, we present a novel embedding scheme based on the generalized Fibonacci decomposition. This representation allows an innovative bit plane decomposition, suitable for embedding purposes. A comparison between the classical Least Significant Bit (LSB) method and the proposed scheme has been performed by considering the perceptual degradation of the mark with respect to the hiding capacity.

[1]  A. F. Horadam,et al.  A Generalized Fibonacci Sequence , 1961 .

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

[3]  Ingemar J. Cox,et al.  Secure spread spectrum watermarking for multimedia , 1997, IEEE Trans. Image Process..

[4]  Edward J. Delp,et al.  A watermark for digital images , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[5]  Wen Gao,et al.  A variable depth LSB data hiding technique in images , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[6]  Mauro Barni,et al.  A DCT-domain system for robust image watermarking , 1998, Signal Process..

[7]  Stefan Winkler,et al.  A vision-based masking model for spread-spectrum image watermarking , 2002, IEEE Trans. Image Process..

[8]  Jean Pedersen,et al.  Fibonacci and Lucas Numbers , 1997 .

[9]  Ioannis Pitas,et al.  Robust image watermarking in the spatial domain , 1998, Signal Process..

[10]  Jaakko Astola,et al.  A fibonacci LSB data hiding tecnique , 2006, 2006 14th European Signal Processing Conference.

[11]  A. Miyazaki,et al.  An image watermarking method based on the wavelet transform , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).