A useful bound for region merging algorithms in a Bayesian model

  • Authors:

  • Trevor C. Tao;David J. Crisp

  • Affiliations:

  • Department of Applied Mathematics, University of Adelaide and Intelligence, Surveillance & Reconnaissance Division, Defence Science & Technology Organisation, Edinburg and Centre for Sensor Signal ...;Department of Applied Mathematics, University of Adelaide and Intelligence, Surveillance & Reconnaissance Division, Defence Science & Technology Organisation, Edinburg and Centre for Sensor Signal ...

  • Venue:
  • ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A well known and effective approach to image segmentation is based on the Mumford-Shah model, where finding an optimal segmentation of an image is posed as the minimization of an energy functional. The simplest of these models is mathematically tractable and desirable properties of the resulting segmentations have been rigorously established. An important step in the proofs involves establishing an "inverse isoperimetric" type of bound. In particular, it can be shown that for segmentations where it is impossible to decrease the functional energy by merging any pair of regions, the length of the boundary between two regions must be bounded above by their areas and variation of the image itself. Recent work of one of the authors has extended the Mumford-Shah segmentation model to a Bayeasian setting. In this report we show that an "inverse isoperimetric" type of bound also exists in this new setting. The new bound can likewise be used to prove desirable properties of the corresponding segmentations.