Optimum Gray Level Image Thresholding using a Quantum Inspired Genetic Algorithm

Optimum Gray Level Image Thresholding using a Quantum Inspired Genetic Algorithm

Sandip Dey, Siddhartha Bhattacharyya, Ujjwal Maulik
DOI: 10.4018/978-1-4666-9474-3.ch012
(Individual Chapters)
No Current Special Offers


In this article, a genetic algorithm inspired by quantum computing is presented. The novel algorithm referred to as quantum inspired genetic algorithm (QIGA) is applied to determine optimal threshold of two gray level images. Different random chaotic map models exhibit the inherent interference operation in collaboration with qubit and superposition of states. The random interference is followed by three different quantum operators viz., quantum crossover, quantum mutation and quantum shifting produce population diversity. Finally, the intermediate states pass through the quantum measurement for optimization of image thresholding. In the proposed algorithm three evaluation metrics such as Brinks's, Kapur's and Pun's algorithms have been applied to two gray level images viz., Lena and Barbara. These algorithms have been applied in conventional GA and Han et al.'s QEA. A comparative study has been made between the proposed QIGA, Han et al.'s algorithm and conventional GA that indicates encouraging avenues of the proposed QIGA.
Chapter Preview


The concept of quantum computing (QC) has been originated from the discipline of quantum physics. In the upcoming twenty-second century, QC may be visualized as one of the most challenging research areas for the scholars of computer science and engineering (Mcmohan, 2008; Gonzalez, 2002). The inherent dynamism of QC has been derived from the Schrödinger equation (SE) (Talbi, 2006). QC has some physical phenomena in its own like superposition, interference, coherence & decoherence, entanglement etc., which facilitate the parallelism capability. The features of QC can be embedded into the classical algorithms via a proper coupling to construct quantum inspired algorithms. The new quantum version of classical algorithms may possess exponentially speed up as compared with the pure classical algorithms (Dey, 2011). So the reflection of the research activities have been turned into designing quantum versions of the conventional algorithms such that these would fit on the quantum computer when invented (Dey, 2011). According to Richard Feynman, the efficacy of classical computers is very low when the quantum mechanical activities are concerned. His observation postulates that the effect of quantum mechanics would compensate the said problem fully (Talbi, 2004). The parallelism potential makes QC to be superior to its counterpart in the context of time complexity (Talbi, 2006; Reiffel, 2000). The application of QC conceited its existence when applied into some complex optimization problems that need larger solution space (Han, 2002). Grover’s database search algorithm (Grover, 1998) and Shor’s quantum factoring algorithm (Shor, 1997) are two popular quantum inspired algorithm that have been already discovered.

There are some renowned soft computing approaches used in this direction so far. Heuristic search and various optimization techniques or image analysis using intensity distribution are appropriate examples in this regards (Ren, 2009; Filho, 2008; Nakiba, 2010; Bazi, 2007). Thresholding plays a very important role in image segmentation, which acquiesce a binary image. The basic purpose of image thresholding is to separate object with its background (Pal, 1993). Threshold converts a given gray scale or color image into its corresponding binary image based on a predefined threshold intensity value. The pixel intensity values greater than the threshold value are grouped into one category, called foreground (F). The remaining pixels are fallen into other category, called background (B) or vice-versa (Sahoo, 1997; Jawahar, 1997). The pixels belonging to set (F) are set to 1 (white), while the remaining pixels in the other set are set to 0 (black) (Pal, 1988; Dey, 2011).

Key Terms in this Chapter

Genetic Algorithm: The concept of basic genetics is applied to form a meta-heuristic optimization search technique.

Gray Scale Image: The pixel intensities of an image consist of 256 different pixel values ranging from 0 to 255.

Quantum Evolutionary Algorithms: The algorithms that are built on quantum principles.

Optimization: A term used to find maximum or minimum value of any defined objective function.

Population: It consists of set of participating vectors.

Image Thresholding: It bifurcate an objects and its corresponding background in a gray level image.

Quantum Computing: Quantum computing is originated from the basic principles of quantum physics. It has more efficacies while comparing to its classical counterpart when time is concerned.

Complete Chapter List

Search this Book: