Journal
IEEE TRANSACTIONS ON NEURAL NETWORKS
Volume 16, Issue 2, Pages 494-498Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNN.2004.841773
Keywords
covex quadratic programming (QP); expectation-maximization (EM); Gaussian mixture model (GMM); image segmentation; Markov random field (MRF)
Ask authors/readers for more resources
Gaussian mixture models (GMMs) constitute a well-known type of probabilistic neural networks. One of their many successful applications is in image segmentation, where spatially constrained mixture models have been trained using the expectation-maximization (EM) framework. In this letter, we elaborate on this method and propose a new methodology for the M-step of the EM algorithm that is based on a novel constrained optimization formulation. Numerical experiments using simulated images illustrate the superior performance of our method in terms of the attained maximum value of the objective function and segmentation accuracy compared to previous implementations of this approach.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available