Paper
14 November 2007 New method of digital image scrambling based on binary tree generated by chaotic sequences
Han Zhang, Jicai Huang, Zhaohui Li
Author Affiliations +
Proceedings Volume 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications; 67905D (2007) https://doi.org/10.1117/12.751334
Event: International Symposium on Multispectral Image Processing and Pattern Recognition, 2007, Wuhan, China
Abstract
The paper presented a method of digital image scrambling based on binary tree generated by chaotic sequences. First, conservative chaos system is iterated to produce chaotic sequences after given initial value and parameters. Then, binary tree is generated by chaotic sequences according to certain rule. At last, the order received by inorder traversing the binary tree is used to transform order of pixels. In this method of digital image scrambling the secret key is initial value and parameters. This method is flexible to use because the secret key is separated from algorithms. It remedies inadequateness of flexibility in other algorithms merely adopting fixed binary tree. Some evaluation indexes show that the method has good effect of image scrambling.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Han Zhang, Jicai Huang, and Zhaohui Li "New method of digital image scrambling based on binary tree generated by chaotic sequences", Proc. SPIE 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications, 67905D (14 November 2007); https://doi.org/10.1117/12.751334
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications and 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital imaging

Image encryption

Chaos

Analytical research

Binary data

Complex systems

Computer security

Back to Top