Binary image transformation using two-dimensional chaotic maps

Fethi Belkhouche, Uvais Qidwai, Ibrahim Gokcen, Dale Joachim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

We present an algorithm for binary image transformation using chaotic maps. Because of its random-like behavior, chaos is a good candidate for encryption. We show that a two-dimensional discrete time dynamical system with one positive Lyapunov exponent allows the transformation of the image in an unpredictable manner. The suggested algorithm acts on the pixel position, where the diffusion property resulting from the sensitivity to the initial states is used to accomplish the transformation in a random-like way. The suggested algorithm uses three types of keys: Initial state, external parameters and the number of iterations. Using the so-called Henon map as an example, we show that the algorithm produces almost uncorrelated images even when the keys are slightly changed, making it an attractive and fast method for image encryption.

Original languageEnglish (US)
Title of host publicationProceedings of the 17th International Conference on Pattern Recognition, ICPR 2004
EditorsJ. Kittler, M. Petrou, M. Nixon
Pages823-826
Number of pages4
DOIs
StatePublished - 2004
EventProceedings of the 17th International Conference on Pattern Recognition, ICPR 2004 - Cambridge, United Kingdom
Duration: Aug 23 2004Aug 26 2004

Publication series

NameProceedings - International Conference on Pattern Recognition
Volume4
ISSN (Print)1051-4651

Conference

ConferenceProceedings of the 17th International Conference on Pattern Recognition, ICPR 2004
CountryUnited Kingdom
CityCambridge
Period8/23/048/26/04

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Binary image transformation using two-dimensional chaotic maps'. Together they form a unique fingerprint.

Cite this