Matrix computations (3rd ed.)
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Mixtures of Gaussians
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
WACV-MOTION '05 Proceedings of the Seventh IEEE Workshops on Application of Computer Vision (WACV/MOTION'05) - Volume 1 - Volume 01
An extension of the standard mixture model for image segmentation
IEEE Transactions on Neural Networks
Maximum Likelihood Estimation of Gaussian Mixture Models Using Particle Swarm Optimization
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Maximum likelihood estimation of Gaussian mixture models using stochastic search
Pattern Recognition
A spatially constrained mixture model for image segmentation
IEEE Transactions on Neural Networks
Survey of clustering algorithms
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
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.