Object Delineation by κ-Connected Components. (27th August 2008)

• Record Type: Journal Article
• Authors: Miranda Miranda, Paulo A. V. Paulo A. V.; Falcão Falcão, Alexandre X. Alexandre X.; Rocha Rocha, Anderson Anderson; Bergo Bergo, Felipe P. G. Felipe P. G.
• Other Names: Chang Chang Chein-I Chein-I Academic Editor.
• Is Part Of: EURASIP journal on advances in signal processing. Volume 2008(2008)
• Publication Date: 2008-08-27
• Subjects: Signal processing -- Periodicals; Traitement du signal; Signal processing; Periodicals; 621.3822
• DOI: 10.1155/2008/467928
• Languages: English
• ISSNs: 1687-6172

Abstract

Abstract : 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 saidto beaκ -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.