
Quantum Inspired Meta-heuristics for Image Analysis
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
This book will entice readers to design efficient meta-heuristics for image analysis in the quantum domain. It introduces them to the essence of quantum computing paradigm, its features, and properties, and elaborates on the fundamentals of different meta-heuristics and their application to image analysis. As a result, it will pave the way for designing and developing quantum computing inspired meta-heuristics to be applied to image analysis.
Quantum Inspired Meta-heuristics for Image Analysis begins with a brief summary on image segmentation, quantum computing, and optimization. It also highlights a few relevant applications of the quantum based computing algorithms, meta-heuristics approach, and several thresholding algorithms in vogue. Next, it discusses a review of image analysis before moving on to an overview of six popular meta-heuristics and their algorithms and pseudo-codes. Subsequent chapters look at quantum inspired meta-heuristics for bi-level and gray scale multi-level image thresholding; quantum behaved meta-heuristics for true color multi-level image thresholding; and quantum inspired multi-objective algorithms for gray scale multi-level image thresholding. Each chapter concludes with a summary and sample questions.
* Provides in-depth analysis of quantum mechanical principles
* Offers comprehensive review of image analysis
* Analyzes different state-of-the-art image thresholding approaches
* Detailed current, popular standard meta-heuristics in use today
* Guides readers step by step in the build-up of quantum inspired meta-heuristics
* Includes a plethora of real life case studies and applications
* Features statistical test analysis of the performances of the quantum inspired meta-heuristics vis-à-vis their conventional counterparts
Quantum Inspired Meta-heuristics for Image Analysis is an excellent source of information for anyone working with or learning quantum inspired meta-heuristics for image analysis.
More details
Other editions
Additional editions


Persons
SANDIP DEY, PHD, is an Associate Professor and Chair in the department of Computer Science & Engineering at the Global Institute of Management and Technology, Krishnanagar, Nadia, West Bengal, India.
SIDDHARTHA BHATTACHARYYA, PHD, is the Principal of RCC Institute of Information Technology, Kolkata, India.
UJJWAL MAULIK, PHD, is the Chair of and Professor in the Department of Computer Science and Engineering, Jadavpur University, Kolkata, India.
Content
Preface xiii
Acronyms xv
1 Introduction 1
1.1 Image Analysis 3
1.1.1 Image Segmentation 4
1.1.2 Image Thresholding 5
1.2 Prerequisites of Quantum Computing 7
1.2.1 Dirac's Notation 8
1.2.2 Qubit 8
1.2.3 Quantum Superposition 8
1.2.4 Quantum Gates 9
1.2.4.1 Quantum NOT Gate (Matrix Representation) 9
1.2.4.2 Quantum Z Gate (Matrix Representation) 9
1.2.4.3 Hadamard Gate 10
1.2.4.4 Phase Shift Gate 10
1.2.4.5 Controlled NOT Gate (CNOT) 10
1.2.4.6 SWAP Gate 11
1.2.4.7 Toffoli Gate 11
1.2.4.8 Fredkin Gate 12
1.2.4.9 Quantum Rotation Gate 13
1.2.5 Quantum Register 14
1.2.6 Quantum Entanglement 14
1.2.7 Quantum Solutions of NP-complete Problems 15
1.3 Role of Optimization 16
1.3.1 Single-objective Optimization 16
1.3.2 Multi-objective Optimization 18
1.3.3 Application of Optimization to Image Analysis 18
1.4 Related Literature Survey 19
1.4.1 Quantum-based Approaches 19
1.4.2 Meta-heuristic-based Approaches 21
1.4.3 Multi-objective-based Approaches 22
1.5 Organization of the Book 23
1.5.1 Quantum Inspired Meta-heuristics for Bi-level Image Thresholding 24
1.5.2 Quantum Inspired Meta-heuristics for Gray-scale Multi-level Image Thresholding 24
1.5.3 Quantum Behaved Meta-heuristics for True Color Multi-level Thresholding 24
1.5.4 Quantum Inspired Multi-objective Algorithms for Multi-level Image Thresholding 24
1.6 Conclusion 25
1.7 Summary 25
Exercise Questions 26
2 Review of Image Analysis 29
2.1 Introduction 29
2.2 Definition 29
2.3 Mathematical Formalism 30
2.4 Current Technologies 30
2.4.1 Digital Image Analysis Methodologies 31
2.4.1.1 Image Segmentation 31
2.4.1.2 Feature Extraction/Selection 32
2.4.1.3 Classification 34
2.5 Overview of Different Thresholding Techniques 35
2.5.1 Ramesh's Algorithm 35
2.5.2 Shanbag's Algorithm 36
2.5.3 Correlation Coefficient 37
2.5.4 Pun's Algorithm 38
2.5.5 Wu's Algorithm 38
2.5.6 Renyi's Algorithm 39
2.5.7 Yen's Algorithm 39
2.5.8 Johannsen's Algorithm 40
2.5.9 Silva's Algorithm 40
2.5.10 Fuzzy Algorithm 41
2.5.11 Brink's Algorithm 41
2.5.12 Otsu's Algorithm 43
2.5.13 Kittler's Algorithm 43
2.5.14 Li's Algorithm 44
2.5.15 Kapur's Algorithm 44
2.5.16 Huang's Algorithm 45
2.6 Applications of Image Analysis 46
2.7 Conclusion 47
2.8 Summary 48
Exercise Questions 48
3 Overview of Meta-heuristics 51
3.1 Introduction 51
3.1.1 Impact on Controlling Parameters 52
3.2 Genetic Algorithms 52
3.2.1 Fundamental Principles and Features 53
3.2.2 Pseudo-code of Genetic Algorithms 53
3.2.3 Encoding Strategy and the Creation of Population 54
3.2.4 Evaluation Techniques 54
3.2.5 Genetic Operators 54
3.2.6 Selection Mechanism 54
3.2.7 Crossover 55
3.2.8 Mutation 56
3.3 Particle Swarm Optimization 56
3.3.1 Pseudo-code of Particle Swarm Optimization 57
3.3.2 PSO: Velocity and Position Update 57
3.4 Ant Colony Optimization 58
3.4.1 Stigmergy in Ants: Biological Inspiration 58
3.4.2 Pseudo-code of Ant Colony Optimization 59
3.4.3 Pheromone Trails 59
3.4.4 Updating Pheromone Trails 59
3.5 Differential Evolution 60
3.5.1 Pseudo-code of Differential Evolution 60
3.5.2 Basic Principles of DE 61
3.5.3 Mutation 61
3.5.4 Crossover 61
3.5.5 Selection 62
3.6 Simulated Annealing 62
3.6.1 Pseudo-code of Simulated Annealing 62
3.6.2 Basics of Simulated Annealing 63
3.7 Tabu Search 64
3.7.1 Pseudo-code of Tabu Search 64
3.7.2 Memory Management in Tabu Search 65
3.7.3 Parameters Used in Tabu Search 65
3.8 Conclusion 65
3.9 Summary 65
Exercise Questions 66
4 Quantum Inspired Meta-heuristics for Bi-level Image Thresholding 69
4.1 Introduction 69
4.2 Quantum Inspired Genetic Algorithm 70
4.2.1 Initialize the Population of Qubit Encoded Chromosomes 71
4.2.2 Perform Quantum Interference 72
4.2.2.1 Generate Random Chaotic Map for Each Qubit State 72
4.2.2.2 Initiate Probabilistic Switching Between Chaotic Maps 73
4.2.3 Find the Threshold Value in Population and Evaluate Fitness 74
4.2.4 Apply Selection Mechanism to Generate a New Population 74
4.2.5 Foundation of Quantum Crossover 74
4.2.6 Foundation of Quantum Mutation 74
4.2.7 Foundation of Quantum Shift 75
4.2.8 Complexity Analysis 75
4.3 Quantum Inspired Particle Swarm Optimization 76
4.3.1 Complexity Analysis 77
4.4 Implementation Results 77
4.4.1 Experimental Results (Phase I) 79
4.4.1.1 Implementation Results for QEA 91
4.4.2 Experimental Results (Phase II) 96
4.4.2.1 Experimental Results of Proposed QIGA and Conventional GA 96
4.4.2.2 Results Obtained with QEA 96
4.4.3 Experimental Results (Phase III) 114
4.4.3.1 Results Obtained with Proposed QIGA and Conventional GA 114
4.4.3.2 Results obtained from QEA 117
4.5 Comparative Analysis among the Participating Algorithms 120
4.6 Conclusion 120
4.7 Summary 121
Exercise Questions 121
Coding Examples 123
5 Quantum Inspired Meta-Heuristics for Gray-Scale Multi-Level Image Thresholding 125
5.1 Introduction 125
5.2 Quantum Inspired Genetic Algorithm 126
5.2.1 Population Generation 126
5.2.2 Quantum Orthogonality 127
5.2.3 Determination of Threshold Values in Population and Measurement of Fitness 128
5.2.4 Selection 129
5.2.5 Quantum Crossover 129
5.2.6 Quantum Mutation 129
5.2.7 Complexity Analysis 129
5.3 Quantum Inspired Particle Swarm Optimization 130
5.3.1 Complexity Analysis 131
5.4 Quantum Inspired Differential Evolution 131
5.4.1 Complexity Analysis 132
5.5 Quantum Inspired Ant Colony Optimization 133
5.5.1 Complexity Analysis 133
5.6 Quantum Inspired Simulated Annealing 134
5.6.1 Complexity Analysis 136
5.7 Quantum Inspired Tabu Search 136
5.7.1 Complexity Analysis 136
5.8 Implementation Results 137
5.8.1 Consensus Results of the Quantum Algorithms 142
5.9 Comparison of QIPSO with Other Existing Algorithms 145
5.10 Conclusion 165
5.11 Summary 166
Exercise Questions 167
Coding Examples 190
6 Quantum Behaved Meta-Heuristics for True Color Multi-Level Image Thresholding 195
6.1 Introduction 195
6.2 Background 196
6.3 Quantum Inspired Ant Colony Optimization 196
6.3.1 Complexity Analysis 197
6.4 Quantum Inspired Differential Evolution 197
6.4.1 Complexity Analysis 200
6.5 Quantum Inspired Particle Swarm Optimization 200
6.5.1 Complexity Analysis 200
6.6 Quantum Inspired Genetic Algorithm 201
6.6.1 Complexity Analysis 203
6.7 Quantum Inspired Simulated Annealing 203
6.7.1 Complexity Analysis 204
6.8 Quantum Inspired Tabu Search 204
6.8.1 Complexity Analysis 206
6.9 Implementation Results 207
6.9.1 Experimental Results (Phase I) 209
6.9.1.1 The Stability of the Comparable Algorithms 210
6.9.2 The Performance Evaluation of the Comparable Algorithms of Phase I 225
6.9.3 Experimental Results (Phase II) 235
6.9.4 The Performance Evaluation of the Participating Algorithms of Phase II 235
6.10 Conclusion 294
6.11 Summary 294
Exercise Questions 295
Coding Examples 296
7 Quantum Inspired Multi-objective Algorithms for Multi-level Image Thresholding 301
7.1 Introduction 301
7.2 Multi-objective Optimization 302
7.3 Experimental Methodology for Gray-Scale Multi-Level Image Thresholding 303
7.3.1 Quantum Inspired Non-dominated Sorting-Based Multi-objective Genetic Algorithm 303
7.3.2 Complexity Analysis 305
7.3.3 Quantum Inspired Simulated Annealing for Multi-objective Algorithms 305
7.3.3.1 Complexity Analysis 307
7.3.4 Quantum Inspired Multi-objective Particle Swarm Optimization 308
7.3.4.1 Complexity Analysis 309
7.3.5 Quantum Inspired Multi-objective Ant Colony Optimization 309
7.3.5.1 Complexity Analysis 310
7.4 Implementation Results 311
7.4.1 Experimental Results 311
7.4.1.1 The Results of Multi-Level Thresholding for QINSGA-II, NSGA-II, and SMS-EMOA 312
7.4.1.2 The Stability of the Comparable Methods 312
7.4.1.3 Performance Evaluation 315
7.5 Conclusion 327
7.6 Summary 327
Exercise Questions 328
Coding Examples 329
8 Conclusion 333
Bibliography 337
Index 355
1
Introduction
A quantum computer, as the name suggests, fundamentally works on several quantum physical characteristics. It is also considered as the field of study, primarily focused on evolving computer technology using the features of quantum theory, which expounds the nature of energy and substance and its behavior on the quantum level, i.e., at the atomic and subatomic level. Developing a quantum computer would mark an advance in computing competency far superior to any current computers. Thus, the use of quantum computers could be an immense improvement on current computers because they have enormous processing capability, even exponentially, compared to classical computers. The supremacy of processing is gained through the capacity of handling multiple states at once, and performing tasks exploiting all the promising permutations in chorus. The term quantum computing is fundamentally a synergistic combination of thoughts from quantum physics, classical information theory, and computer science.
Soft computing (SC), introduced by Lotfi A. Zadeh [282], manages the soft meaning of thoughts. SC, comprising a variety of thoughts and practices, is fundamentally used to solve the difficulties stumbled upon in real-life problems. This can be used to exploit the uncertainty problem almost with zero difficulty. This can also handle real-world state of affairs and afford lower solution costs [29]. The advantageous features of SC can best be described as leniency of approximation, vagueness, robustness, and partial truth [103,215]. This is a comparatively novel computing paradigm which involves a synergistic amalgamation of essentially several additional computing paradigms, which may include fuzzy logic, evolutionary computation, neural networks, machine learning, support vector machines, and also probabilistic reasoning. SC can combine the aforementioned computing paradigms to offer a framework for designing many information processing applications that can function in the real world. This synergism was called computational intelligence by Bezdek [24]. These SC components are different from each other in more than one way. These can be used to operate either autonomously or conjointly, depending on the application domain.
Evolutionary computation (EC) is a search and optimization procedure which uses biological evolution inspired by Darwinian principles [14,83,136]. It is stochastic and delivers robust search and optimization methods. It starts with a pool of trial solutions in its search space, which is called the population. Numerous in-built operators are generally applied to each individual of the population, which may cause population diversity and also leads to better solutions. A metric, called the fitness function (objective function), is employed to determine the suitability of an individual in the population at any particular generation. As soon as the fitness of the existing individuals in the population is computed, the operators are successively applied to produce a new population for the successive generations. Distinct examples of EC may include the Differential Evolution [242], Genetic Algorithms [127,210], Particle Swarm Optimization [144], and Ant Colony Optimization [196], to name but a few. Simulated annealing [147] is another popular example of meta-heuristic and optimization techniques in this regard. This technique exploits the features of statistical mechanics concerning the behavior of atoms at very low temperature to find minimal cost solutions of any given optimization problem. EC techniques are also useful when dealing with several conflicting objectives, called the multi-objective evolutionary techniques. These search procedures provide a set of solutions, called optimal solutions. Some typical examples of these techniques may include the multi-objective differential evolutionary algorithm (MODE) [275], the multi-objective genetic algorithm (MOGA) [172,183], and multi-objective simulated annealing (MOSA) [237], to name but a few.
Fuzzy logic tenders more elegant alternatives to conventional (Boolean) logic. Fuzzy logic is able to handle the notion of partial truth competently [139,141,215,282,283]. A neural network is a computing framework comprising huge numbers of simple, exceedingly unified processing elements called artificial neurons, which add up to an elemental computing primitive [82,102,150]. Machine learning is a kind of intelligent program which works on example data. It learns from previous experiences and is used to enhance the performances by optimizing a given criterion [5,156,178]. Support vector machines (SVM) are known to be the collection of supervised learning techniques. SVMs are very useful in regression and classification analysis [38,50]. SVMs are fit to handle a number of real-life applications, including text and image classification, or biosequences analysis, to name but a few [38,50]. Nowadays SVMs are often used as the standard and effective tool for data mining and machine learning activities. Probabilistic reasoning can be defined as the computational method which uses certain logic and probability theory to handle uncertain circumstances [201,202].
Many researchers utilize the basic features of quantum computing in various evolutionary algorithmic frameworks in the soft computing discipline. The underlying principles of quantum computing are injected into different meta-heuristic structures to develop different quantum inspired techniques. In the context of image analysis, the features are extracted both from pictographic and non-numeric data and are used in these algorithms in different ways [27]. This chapter provides an insight into the various facets of the quantum computing, image segmentation, image thresholding, and optimization. This chapter is arranged into a number of relevant sections. Section 1.1 presents an overview of the underlying concepts of image analysis. A brief overview of image segmentation and image thresholding is discussed in this section. Section 1.2 throws light on the basics of quantum computing in detail. Section 1.3 discusses the necessity of optimization in the real world. This section presents different types of optimization procedures with their application in the real world. Apart from the above issues, this chapter also presents a short description of the literature survey on related topics. Different types of approaches in this regard are in detail presented in Section 1.4. The organization of the book is presented in Section 1.5. The chapter concludes in Section 1.6. It also shows the direction of research that can be used as future reference. A brief summary of the chapter is given in Section 1.7. In Section 1.8, a set of questions related to the theme of the chapter is presented.
1.1 Image Analysis
Image analysis has a vital role in extracting relevant and meaningful information from images. There are few automatic or semi-automatic techniques, called computer/machine vision, pattern recognition, image description, image understanding to name but a few, used for this purpose. Image segmentation can be thought of as the most fundamental and significant step in several image analysis techniques. A good example of image analysis may involve the organized activities of the human eye with the brain. Computer-based image analysis can be thought of as the best alternative which may reduce human effort in order to make this process faster, more efficient, and automatic. Image analysis has numerous applications in a variety of fields such as medicine, biology, robotics, remote sensing, and manufacturing. It also makes a significant contribution in different industrial activities such as process control, quality control, etc. For example, in the food industry, image analysis plays a significant role to ensure the uniform shape, size and texture of the final food products.
In medical image analysis, clinical images of different views are captured to diagnose and detect diseases in relation to body organs, and study standard physiological procedures for future references. These investigations can be accomplished through images attained from various imaging technologies, such as magnetic resonance imaging (MRI), radiology, ultrasound, etc. For example, image analysis methodology is of the utmost importance in cancer detection and diagnosis [44], thus it helps the physician to ensure accurate treatment for their patient. In the context of cancer treatment, several features like shape, size, and homogeneity of a tumor are taken into consideration when classifying and diagnosing cancer images. Different image analysis algorithms can be introduced that can help radiologists to classify tumor images.
Figure 1.1 Steps in image analysis.
The steps involved in image analysis are presented in Figure 1.1 [112]. Each step is discussed in the following in brief.
- Image acquisition: This is the first step of every vision system. Image acquisition means acquiring a digital image. After obtaining the image successfully, several processing approaches can be used on the image in order to fulfill the different vision tasks required nowadays. However, if the image cannot be acquired competently, the anticipated tasks may perhaps not be completed successfully by any...
System requirements
File format: ePUB
Copy protection: Adobe-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Install the free reader Adobe Digital Editions prior to download (see eBook Help).
- Tablet/smartphone (Android; iOS): Install the free app Adobe Digital Editions or the app PocketBook before downloading (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (not Kindle).
The file format ePub works well for novels and non-fiction books – i.e., „flowing” text without complex layout. On an e-reader or smartphone, line and page breaks automatically adjust to fit the small displays.
This eBook uses Adobe-DRM, a „hard” copy protection. If the necessary requirements are not met, unfortunately you will not be able to open the eBook. You will therefore need to prepare your reading hardware before downloading.
Please note: We strongly recommend that you authorise using your personal Adobe ID after installation of any reading software.
For more information, see our ebook Help page.