Image segmentation by minimum cross entropy using evolutionary methods
- 229 Downloads
The segmentation of digital images is one of the most important steps in an image processing or computer vision system. It helps to classify the pixels in different regions according to their intensity level. Several segmentation techniques have been proposed, and some of them use complex operators. The techniques based on thresholding are the easiest to implement; the problem is to select correctly the best threshold that divides the pixels. An interesting method to choose the best thresholds is the minimum cross entropy (MCET), which provides excellent results for bi-level thresholding. Nevertheless, the extension of the segmentation problem into multiple thresholds increases significantly the computational effort required to find optimal threshold values. Each new threshold adds complexity to the formulation of the problem. Classic methods for image thresholding perform extensive searches, while new approaches take advantage of heuristics to reduce the search. Evolutionary algorithms use heuristics to optimize criteria over a finite number of iterations. The correct selection of an evolutionary algorithm to minimize the MCET directly impacts the performance of the method. Current approaches take a large number of iterations to converge and a high rate of MCET function evaluations. The electromagnetism-like optimization (EMO) algorithm is an evolutionary technique which emulates the attraction–repulsion mechanism among charges for evolving the individuals of a population. Such technique requires only a small number of evaluations to find the optimum. This paper proposes the use of EMO to search for optimal threshold values by minimizing the cross entropy function while reducing the amount of iterations and function evaluations. The approach is tested on a set of benchmark images to demonstrate that is able to improve the convergence and velocity; additionally, it is compared with similar state-of-the-art optimization approaches.
KeywordsImage processing Segmentation Evolutionary algorithms Cross entropy Electromagnetism optimization
Compliance with ethical standards
None of the authors of this paper has a financial or personal relationship with other people or organizations that could inappropriately influence or bias the content of the paper.
Conflict of interest
It is to specifically state that “No Competing interests are at stake and there is No Conflict of Interest” with other people or organizations that could inappropriately influence or bias the content of the paper.
Human and animal rights
This article does not contain any studies with human participants or animals performed by any of the authors.
- García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC 2005 special session on real parameter optimization. J Heuristics 15:617–644. doi: 10.1007/s10732-008-9080-4 CrossRefzbMATHGoogle Scholar
- Gonzalez RC, Woods RE (1992) Digital image processing. Pearson, Prentice-Hall, New JerseyGoogle Scholar
- Hung HL, Huang YF (2011) Peak to average power ratio reduction of multicarrier transmission systems using electromagnetism-like method. Int J Innov Comput Inf Control 7:2037–2050Google Scholar
- Kaur T, Saini BS, Gupta S (2016) Optimized multi threshold brain tumor image segmentation using two dimensional minimum cross entropy based on co-occurrence matrix. Springer, Berlin, pp 461–486Google Scholar
- Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Neural Networks, 1995 proceedings, IEEE international conference, vol. 4, pp 1942–1948. doi: 10.1109/ICNN.1995.488968
- Oliva D, Hinojosa S, Cuevas E et al (2017) Cross entropy based thresholding for magnetic resonance brain images using Crow Search Algorithm. Expert Syst Appl. doi: 10.1016/j.eswa.2017.02.042
- Sarkar S, Patra GR, Das S (2011) A differential evolution based approach for multilevel image segmentation using minimum cross entropy thresholding. In: Swarm, evolutionary, and memetic computing, pp 51–58Google Scholar
- Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim. doi: 10.1023/A:1008202821328
- Yang X-S (2014) Cuckoo search and firefly algorithm: overview and analysis. In: Yang X-S (ed) Cuckoo search and firefly algorithm. Springer, Berlin, Heidelberg, pp 1–26Google Scholar