Fast unsupervised Bayesian image segmentation with adaptive spatial regularisation
Marcelo Pereyra, Steve McLaughlin

TL;DR
This paper introduces a fast, unsupervised Bayesian image segmentation method that automatically adapts spatial regularisation parameters during inference, combining total-variation denoising and clustering for efficient high-dimensional processing.
Contribution
It develops a novel Bayesian estimation approach that removes the regularisation parameter via marginalisation and uses SVA analysis for efficient, adaptive segmentation.
Findings
Achieves extremely fast convergence in image segmentation.
Produces accurate results comparable to state-of-the-art methods.
Automatically adjusts regularisation strength based on observed data.
Abstract
This paper presents a new Bayesian estimation technique for hidden Potts-Markov random fields with unknown regularisation parameters, with application to fast unsupervised K-class image segmentation. The technique is derived by first removing the regularisation parameter from the Bayesian model by marginalisation, followed by a small-variance-asymptotic (SVA) analysis in which the spatial regularisation and the integer-constrained terms of the Potts model are decoupled. The evaluation of this SVA Bayesian estimator is then relaxed into a problem that can be computed efficiently by iteratively solving a convex total-variation denoising problem and a least-squares clustering (K-means) problem, both of which can be solved straightforwardly, even in high-dimensions, and with parallel computing techniques. This leads to a fast fully unsupervised Bayesian image segmentation methodology in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
