Paper
3 April 2008 A spatial data hiding scheme based on generalized Fibonacci sequence
Author Affiliations +
Abstract
This paper presents a novel spatial data hiding scheme based on the Least Significant Bit insertion. The bitplane decomposition is obtained by using the (p, r) Fibonacci sequences. This decomposition depends on two parameters, p and r. Those values increase the security of the whole system; without their knowledge it is not possible to perform the same decomposition used in the embedding process and to extract the embedded information. Experimental results show the effectiveness of the proposed method.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
E. Mammi, F. Battisti, M. Carli, A. Neri, and K. Egiazarian "A spatial data hiding scheme based on generalized Fibonacci sequence", Proc. SPIE 6982, Mobile Multimedia/Image Processing, Security, and Applications 2008, 69820C (3 April 2008); https://doi.org/10.1117/12.780605
Lens.org Logo
CITATIONS
Cited by 8 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital watermarking

Binary data

Data hiding

Image quality

Bismuth

Computer security

Visibility

RELATED CONTENT

Robust watermarking of busy images
Proceedings of SPIE (August 01 2001)
Data hiding based on Fibonacci-Haar transform
Proceedings of SPIE (May 02 2007)
Digital video steganalysis exploiting collusion sensitivity
Proceedings of SPIE (September 15 2004)

Back to Top