Please use this identifier to cite or link to this item:
|Title:||The infinite hidden Markov random field model||Authors:||Tsechpenakis, Gabriel
Chatzis, Sotirios P.
Pattern recognition systems
|Issue Date:||2010||Publisher:||IEEE Xplore||Source:||IEEE transactions on neural networks, 2010, Volume 21, Issue 6, Pages 1004-1014||Abstract:||Hidden Markov random field (HMRF) models are widely used for image segmentation, as they appear naturally in problems where a spatially constrained clustering scheme is asked for. A major limitation of HMRF models concerns the automatic selection of the proper number of their states, i.e., the number of region clusters derived by the image segmentation procedure. Existing methods, including likelihood- or entropy-based criteria, and reversible Markov chain Monte Carlo methods, usually tend to yield noisy model size estimates while imposing heavy computational requirements. Recently, Dirichlet process (DP, infinite) mixture models have emerged in the cornerstone of nonparametric Bayesian statistics as promising candidates for clustering applications where the number of clusters is unknown a priori; infinite mixture models based on the original DP or spatially constrained variants of it have been applied in unsupervised image segmentation applications showing promising results. Under this motivation, to resolve the aforementioned issues of HMRF models, in this paper, we introduce a nonparametric Bayesian formulation for the HMRF model, the infinite HMRF model, formulated on the basis of a joint Dirichlet process mixture (DPM) and Markov random field (MRF) construction. We derive an efficient variational Bayesian inference algorithm for the proposed model, and we experimentally demonstrate its advantages over competing methodologies||URI:||http://ktisis.cut.ac.cy/handle/10488/7267||ISSN:||1045-9227||DOI:||10.1109/TNN.2010.2046910||Rights:||© 2010 IEEE|
|Appears in Collections:||Άρθρα/Articles|
Show full item record
checked on Feb 16, 2017
WEB OF SCIENCETM
checked on Feb 15, 2017
checked on Mar 27, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.