Gaussian Unit-simplex Markov random fields as a fast proxy for MRF sampling

Markov random fields are classical models for Bayesian image modeling, but their sampling relies on traditionally Gibbs techniques, implying a non-negligible computational cost. On the other hand, Gaussian Markov random fields (GMRF), which are used to model continuous and spatially-homogeneous variables, can benefit from highly efficient sampling techniques. In this paper, we propose a new discrete Markov field, based on a unit-simplex geometry, and coined Gaussian unit- simplex Markov field (GUM). This model is specifically designed to benefit from the GMRF approach for sampling. We show that its sampling complexity is related to the GMRF sampling complexity. Numerical results show this leverages drastic improvement in the sampling time, while sharing similar empirical properties with a classical Markov random field.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/ssp64130.2025.11073498
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Gaussian Unit-simplex Markov random fields as a fast proxy for MRF sampling

Jean‐Baptiste Courbot, Hugo Gangloff
Markov Chains and Monte Carlo Methods
article

Gaussian Unit-simplex Markov random fields as a fast proxy for MRF sampling

Jean‐Baptiste Courbot, Hugo Gangloff
article en

Abstract

Markov random fields are classical models for Bayesian image modeling, but their sampling relies on traditionally Gibbs techniques, implying a non-negligible computational cost. On the other hand, Gaussian Markov random fields (GMRF), which are used to model continuous and spatially-homogeneous variables, can benefit from highly efficient sampling techniques. In this paper, we propose a new discrete Markov field, based on a unit-simplex geometry, and coined Gaussian unit- simplex Markov field (GUM). This model is specifically designed to benefit from the GMRF approach for sampling. We show that its sampling complexity is related to the GMRF sampling complexity. Numerical results show this leverages drastic improvement in the sampling time, while sharing similar empirical properties with a classical Markov random field.

AgroParisTech (FR), Université Paris-Saclay (FR), Université de Haute-Alsace (FR), Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement (FR)
Openalex Percentile: Top 80%
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Gaussian Unit-simplex Markov random fields as a fast proxy for MRF sampling — Jean‐Baptiste Courbot, Hugo Gangloff · (2025) | TGRS Research Map | TGRS