Open Access

Object Delineation by -Connected Components

  • Paulo M. V. Miranda1,
  • Alexandre X. Falcão1Email author,
  • Anderson Rocha1 and
  • Felipe P. G. Bergo1
EURASIP Journal on Advances in Signal Processing20082008:467928

Received: 30 November 2007

Accepted: 2 June 2008

Published: 18 June 2008


The notion of "strength of connectedness" between pixels has been successfully used in image segmentation. We present extensions to these works, which can considerably improve the efficiency of object delineation tasks. A set of pixels is said to be a -connected component with respect to a seed pixel, when the strength of connectedness of any pixel in that set with respect to the seed is higher than or equal to a threshold. We discuss two approaches that define objects based on -connected components with respect to a given seed set: with and without competition among seeds. While the previous approaches either assume no competition with a single threshold for all seeds or eliminate the threshold for seed competition, we show that seeds with different thresholds can improve segmentation in both paradigms. We also propose automatic and user-friendly interactive methods to determining the thresholds. The proposed methods are presented in the framework of the image foresting transform, which naturally leads to efficient and correct graph algorithms. The improvements are demonstrated through several segmentation experiments involving medical images.

Publisher note

To access the full article, please see PDF.

Authors’ Affiliations

Institute of Computing, University of Campinas


© Paulo A. V. Miranda et al. 2008

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.