A Multi-Objective Graph-based Genetic Algorithm for image segmentation

Image Segmentation is one of the most challenging problems in Computer Vision. This process consists in dividing an image in different parts which share a common property, for example, identify a concrete object within a photo. Different approaches have been developed over the last years. This work is focused on Unsupervised Data Mining methodologies, specially on Graph Clustering methods, and their application to previous problems. These techniques blindly divide the image into different parts according to a criterion. This work applies a Multi-Objective Genetic Algorithm in order to perform good clustering results comparing to classical and modern clustering algorithms. The algorithm is analysed and compared against different clustering methods, using a precision and recall evaluation, and the Berkeley Image Database to carry out the experimental evaluation.

[1]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[2]  David F. Barrero,et al.  A Multi-Objective Genetic Graph-Based Clustering algorithm with memory optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.

[3]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[4]  Eros Comunello,et al.  Learning a nonlinear distance metric for supervised region-merging image segmentation , 2011, Comput. Vis. Image Underst..

[5]  Eros Comunello,et al.  Learning a color distance metric for region-based image segmentation , 2009, Pattern Recognit. Lett..

[6]  智一 吉田,et al.  Efficient Graph-Based Image Segmentationを用いた圃場図自動作成手法の検討 , 2014 .

[7]  Anil K. Jain.  Data Clustering: User's Dilemma , 2007, MLDM.

[8]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[9]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[10]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[11]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[12]  Robin J. Wilson.  EVERY PLANAR MAP IS FOUR COLORABLE , 1991 .

[13]  Hui Zhang,et al.  Image segmentation evaluation: A survey of unsupervised methods , 2008, Comput. Vis. Image Underst..

[14]  Dit-Yan Yeung,et al.  Robust path-based spectral clustering , 2008, Pattern Recognit..

[15]  Shao-Yi Chien,et al.  Fast image segmentation based on K-Means clustering with histograms in HSV color space , 2008, 2008 IEEE 10th Workshop on Multimedia Signal Processing.

[16]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[17]  Aristides Gionis,et al.  Clustering aggregation , 2005, 21st International Conference on Data Engineering (ICDE'05).

[18]  Alex Alves Freitas,et al.  A Survey of Evolutionary Algorithms for Clustering , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[19]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[20]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[21]  David Coley,et al.  Introduction to Genetic Algorithms for Scientists and Engineers , 1999 .

[22]  Cor J. Veenman,et al.  A Maximum Variance Cluster Algorithm , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .