An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm - fast execution, robust segmentation, and no tuning parameters - but is pixel order independent.

[1]  Moshe J. Augenstein,et al.  Data structures using Pascal (2nd ed.) , 1986 .

[2]  Alan L. Yuille,et al.  Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Moshe J. Augenstein,et al.  Data Structures Using Pascal , 1981 .

[4]  S. Beucher,et al.  Morphological segmentation , 1990, J. Vis. Commun. Image Represent..

[5]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Edmond J. Breen,et al.  An Evaluation of Priority Queues for Mathematical Morphology , 1994, ISMM.

[7]  Pierre Soille,et al.  Mathematical Morphology and Its Applications to Image Processing , 1994, Computational Imaging and Vision.