Estimating the granularity coefficient of a Potts-Markov random field within an MCMC algorithm

Abstract : This paper addresses the problem of estimating the Potts parameter β jointly with the unknown parameters of a Bayesian model within a Markov chain Monte Carlo (MCMC) algorithm. Standard MCMC methods cannot be applied to this problem because performing inference on β requires computing the intractable normalizing constant of the Potts model. In the proposed MCMC method, the estimation of β is conducted using a likelihood-free Metropolis–Hastings algorithm. Experimental results obtained for synthetic data show that estimating β jointly with the other unknown parameters leads to estimation results that are as good as those obtained with the actual value of β. On the other hand, choosing an incorrect value of β can degrade estimation performance significantly. To illustrate the interest of this method, the proposed algorithm is successfully applied to real bidimensional SAR and tridimensional ultrasound images.
Complete list of metadatas

Cited literature [63 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, March 12, 2015 - 11:28:22 AM
Last modification on : Thursday, October 17, 2019 - 8:53:02 AM
Long-term archiving on : Saturday, June 13, 2015 - 11:01:38 AM


Files produced by the author(s)



Marcelo Alejandro Pereyra, Nicolas Dobigeon, Hadj Batatia, Jean-Yves Tourneret. Estimating the granularity coefficient of a Potts-Markov random field within an MCMC algorithm. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2013, vol. 22 (n° 6), pp. 2385-2397. ⟨10.1109/TIP.2013.2249076⟩. ⟨hal-01130731⟩



Record views


Files downloads