Discrete Region Competition for Unknown Numbers of Connected Regions

Citations Over TimeTop 10% of 2012 papers

Abstract

We present a discrete, unsupervised multi-region competition algorithm for image segmentation over different energy functionals. The number of regions present in an image does not need to be known a priori, nor their photometric properties. The algorithm jointly estimates the number of regions, their photometries, and their contours. The required regularization is provided by defining a region as a connected set of pixels. The evolving contours in the image are represented by computational particles that move as driven by an energy-minimization algorithm. We present an efficient discrete algorithm that allows minimizing a range of well-known energy functionals under the topological constraint of regions being connected components. The presented framework and algorithms are implemented in the open-source Insight Toolkit (ITK) image-processing library.

Related Papers

• → Communication: Entropic measure to prevent energy over-minimization in molecular dynamics simulations(2015)14 cited
• → Energy minimization for the flow in ducts and networks(2014)5 cited
• → Constrained optimization and protein structure determination(1991)4 cited
• → An energy minimization method for matching and comparing structured object representations(1997)1 cited
• → Batteries and Energy Minimization Problems(2003)1 cited