Reference : A spatially constrained generative model and an EM algorithm for image segmentation
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/11034
A spatially constrained generative model and an EM algorithm for image segmentation
English
Diplaros, Aristeidis [> >]
Vlassis, Nikos mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
Gevers, Theo [> >]
2007
IEEE Transactions on Neural Networks
IEEE
18
3
798-808
Yes (verified by ORBilu)
1045-9227
Piscataway
NJ
[en] bound optimization ; expectation-maximization (EM) algorithm ; hidden Markov random fields (MRFs) ; image segmentation ; spatial clustering
[en] In this paper, we present a novel spatially constrained generative model and an expectation-maximization (EM) algorithm for model-based image segmentation. The generative model assumes that the unobserved class labels of neighboring pixels in the image are generated by prior distributions with similar parameters, where similarity is defined by entropic quantities relating to the neighboring priors. In order to estimate model pa rameters from observations, we derive a spatially constrained EM algorithm that iteratively maximizes a lower bound on the data log-likelihood, where the penalty term is data-dependent. Our algorithm is very easy to implement and is similar to the standard EM algorithm for Gaussian mixtures with the main difference that the labels posteriors are "smoothed" over pixels between each E-and M-step by a standard image filter. Experiments on synthetic and real images show that our algorithm achieves competitive segmentation results compared to other Markov-based methods, and is in general faster.
http://hdl.handle.net/10993/11034

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.