Paper Info
Title
Bayesian nonparametric priors for hidden Markov random fields.
Abstract
One of the central issues in statistics and machine learning is how to select an adequate model that can automatically adapt its complexity to the observed data. In the present paper, we focus on the issue of determining the structure of clustered data, both in terms of finding the appropriate number of clusters and of modeling the right dependence structure between the observations. Bayesian nonparametric (BNP) models, which do not impose an upper limit on the number of clusters, are appropriate to avoid the required guess on the number of clusters but have been mainly developed for independent data. In contrast, Markov random fields (MRF) have been extensively used to model dependencies in a tractable manner but usually reduce to finite cluster numbers when clustering tasks are addressed. Our main contribution is to propose a general scheme to design tractable BNP–MRF priors that combine both features: no commitment to an arbitrary number of clusters and a dependence modeling. A key ingredient in this construction is the availability of a stick-breaking representation which has the threefold advantage to allowing us to extend standard discrete MRFs to infinite state space, to design a tractable estimation algorithm using variational approximation and to derive theoretical properties on the predictive distribution and the number of clusters of the proposed model. This approach is illustrated on a challenging natural image segmentation task for which it shows good performance with respect to the literature.
Year
DOI
Venue
2020
10.1007/s11222-020-09935-9
Statistics and Computing
Keywords
DocType
Volume
Hidden Markov random fields, Bayesian nonparametrics, Variational approximation, Clustering, Image segmentation, Predictive distribution
Journal
30
Issue
ISSN
Citations 
4
0960-3174
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Hongliang Lü100.34
Julyan Arbel233.12
Florence Forbes338119.21