This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seeded Region Growing
June 1994 (vol. 16 no. 6)
pp. 641-647

We present here a new algorithm for segmentation of intensity images which is robust, rapid, and free of tuning parameters. The method, however, requires the input of a number of seeds, either individual pixels or regions, which will control the formation of regions into which the image will be segmented. In this correspondence, we present the algorithm, discuss briefly its properties, and suggest two ways in which it can be employed, namely, by using manual seed selection or by automated procedures.

[1] R. Adams, "Two new methods for seeded or semi-interactive image processing,"Proc. APRS Conf. Digital Image Computing: Techniques Appl., 1991, pp. 459-465.
[2] D. H. Ballard and C. M. Brown,Computer Vision. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[3] P. J. Besl and R. C. Jain, "Segmentation through variable-order surface fitting,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-10, pp. 167-192, 1988.
[4] F. Cheevasuvit, H. Maitre, and D. Vidal-Madjar, "A robust method for picture segmentation based on split-and-merge procedure,"Comput. Vis. Graph. Image Process., vol. 34, pp. 268-281, 1986.
[5] S.-Y. Chen, W.-C. Lin, and C.-T. Chen, "Split-and-merge segmentation based on localized feature analysis and statistical tests,"Graph. Models. Image Processing, vol. 53, pp. 457-475, 1991.
[6] L. S. Davis, "A survey of edge detection techniques,"Comput. Graph. Image Process., vol. 4, pp. 248-270, 1975.
[7] D. Y. Hand,Discrimination and Classification. New York: Wiley, 1981.
[8] R. M. Haralick and L. G. Shapiro, "Image segmentation techniques,"Comput. Vis. Graph. Image Process., vol. 29, pp. 100-132, 1985.
[9] S. L. Horowitz and T. Pavlidis, "Picture segmentation by a directed split-and-merge procedure,"Proc. 2nd Int. Joint Conf. Pattern Recognit., 1974, pp. 424-433.
[10] F. Meyer and S. Beucher, "Morphological segmentation,"J. Vis. Commun. Image Represent., vol. 1, pp. 21-46, 1990.
[11] L. O'Gorman and A. C. Sanderson, "The converging squares algorithm: An efficient method for locating peaks in multidimensions,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 280-288, 1984.
[12] T. Pavlidis and Y-T. Liow, "Integrating region growing and edge detection,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, pp. 225-233, 1990.
[13] P. K. Sahoo, S. Soltani, and A. K. C. Wong, "A survey of thresholding techniques,"Comput. Vision Graphics Image Processing, vol. 41, pp. 233-260, 1988.
[14] J. Serra,Image Analysis and Mathematical Morphology. New York: Academic Press, 1982, pp. 390-423.
[15] L. Vincent and P. Soille, "Watersheds in digital spaces: An efficient algorithm based on immersion simulations,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, pp. 583-598, 1991.
[16] S. W. Zucker, "Region growing: Childhood and adolescence,"Comput. Graph. Image Process., vol. 5, pp. 382-399, 1976.

Index Terms:
image segmentation; seeded region growing; intensity image segmentation; seed selection
Citation:
R. Adams, L. Bischof, "Seeded Region Growing," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 6, pp. 641-647, June 1994, doi:10.1109/34.295913
Usage of this product signifies your acceptance of the Terms of Use.