A novel clustering algorithm based Gaussian mixture model for image segmentation

Gaussian mixture model-based clustering algorithm is one of the advanced techniques applied to enhance the image segmentation performance. However, segmentation process is still encountering with some critical difficulties: the model is quite sensitive to initialization, and easily gets trapped in local maxima. To address these problems in image segmentation, we proposed a novel clustering algorithm by using the arbitrary covariance matrices for maximum likelihood estimation of GMMs. Such model can be able to prevent the effective use of population-base algorithms during clustering, and the arbitrary covariance matrices allow independently updating of individual parameters while retaining the validity of the matrix. The experimental results show that our method provides a simple segmentation process and the better quality of segmented images comparing to other methods. Furthermore, our method would provide an advanced technique for multi-dimensional image analysis and computer vision systems in varied sciences and technologies.

[1]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Bernard Gosselin,et al.  Segmentation-Based Binarization for Color Degraded Images , 2004, ICCVG.

[3]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[4]  Nikolas P. Galatsanos,et al.  A spatially constrained mixture model for image segmentation , 2005, IEEE Transactions on Neural Networks.

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

[6]  Orhan Arikan,et al.  Maximum likelihood estimation of Gaussian mixture models using stochastic search , 2012, Pattern Recognit..

[7]  Q. M. Jonathan Wu,et al.  An Extension of the Standard Mixture Model for Image Segmentation , 2010, IEEE Transactions on Neural Networks.

[8]  Jeff A. Bilmes,et al.  A gentle tutorial of the em algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models , 1998 .

[9]  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.

[10]  R. Redner,et al.  Mixture densities, maximum likelihood, and the EM algorithm , 1984 .

[11]  Sanjoy Dasgupta,et al.  Learning mixtures of Gaussians , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  Sankar K. Pal,et al.  A review on image segmentation techniques , 1993, Pattern Recognit..

[13]  Martial Hebert,et al.  Measures of Similarity , 2005, 2005 Seventh IEEE Workshops on Applications of Computer Vision (WACV/MOTION'05) - Volume 1.

[14]  Selim Aksoy,et al.  Maximum Likelihood Estimation of Gaussian Mixture Models Using Particle Swarm Optimization , 2010, 2010 20th International Conference on Pattern Recognition.

[15]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[16]  Geoffrey J. McLachlan,et al.  Finite Mixture Models , 2019, Annual Review of Statistics and Its Application.