Bayesian non-parametric image segmentation with Markov random field prior

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a Bayesian framework for non-parametric density estimation with spatial smoothness constraints is presented for image segmentation. Unlike common parametric methods such as mixtures of Gaussians, the proposed method does not make strict assumptions about the shape of the density functions and thus, can handle complex structures. The multiclass kernel density estimation is considered as an unsupervised learning problem. A Dirichlet compound multinomial (DCM) prior is used to model the class label prior probabilities and a Markov random field (MRF) is exploited to impose the spatial smoothness and control the confidence on the Dirichlet hyper-parameters, as well. The proposed model results in a closed form solution using an expectation-maximization (EM) algorithm for maximum a posteriori (MAP) estimation. This provides a huge advantage over other models which utilize more complex and time consuming methods such as Markov chain Monte Carlo (MCMC) or variational approximation methods. Several experiments on natural images are performed to present the performance of the proposed model compared to other parametric approaches. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Amid, E. (2013). Bayesian non-parametric image segmentation with Markov random field prior. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7944 LNCS, pp. 76–84). https://doi.org/10.1007/978-3-642-38886-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free