Discrete region competition for unknown numbers of connected regions

IEEE Trans Image Process. 2012 Aug;21(8):3531-45. doi: 10.1109/TIP.2012.2192129. Epub 2012 Apr 3.

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.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Image Enhancement / methods
  • Image Interpretation, Computer-Assisted / methods*
  • Pattern Recognition, Automated / methods*
  • Programming Languages*
  • Reproducibility of Results
  • Sensitivity and Specificity
  • Software*