Discrete region competition for unknown numbers of connected regions

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

  • Janick Cardinale - , ETH Zurich, Swiss Institute of Bioinformatics (Author)
  • Gregory Paul - , ETH Zurich, Swiss Institute of Bioinformatics (Author)
  • Ivo F. Sbalzarini - , ETH Zurich, Swiss Institute of Bioinformatics (Author)

Abstract

We present a discrete unsupervised multiregion-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 image-processing library.

Details

Original languageEnglish
Article number6175954
Pages (from-to)3531-3545
Number of pages15
JournalIEEE transactions on image processing
Volume21
Issue number8
Publication statusPublished - 2012
Peer-reviewedYes
Externally publishedYes

External IDs

PubMed 22481820
ORCID /0000-0003-4414-4340/work/159608296

Keywords

Keywords

  • Connected component, Deconvolution, Digital topology, Discrete level set, Energy-based segmentation, Multiregion segmentation, Region competition, Topological constraint