This Article 
 Bibliographic References 
 Add to: 
Integrating Region Growing and Edge Detection
March 1990 (vol. 12 no. 3)
pp. 225-233

A method that combines region growing and edge detection for image segmentation is presented. The authors start with a split-and merge algorithm wherein the parameters have been set up so that an over-segmented image results. Region boundaries are then eliminated or modified on the basis of criteria that integrate contrast with boundary smoothness, variation of the image gradient along the boundary, and a criterion that penalizes for the presence of artifacts reflecting the data structure used during segmentation (quadtree in this case). The algorithms were implemented in the C language on a Sun 3/160 workstation running under the Unix operating system. Simple tool images and aerial photographs were used to test the algorithms. The impression of human observers is that the method is very successful on the tool images and less so on the aerial photograph images. It is thought that the success in the tool images is because the objects shown occupy areas of many pixels, making it is easy to select parameters to separate signal information from noise.

[1] H. L. Anderson, R. Bajcsy, and M. Mintz, "A modular feedback system for image segmentation," Univ. Pennsylvania GRASP Lab., Tech. Rep. 110, 1987.
[2] D. H. Ballard, "Hierarchic detection of tumors in chest radiographs," Rep. ISR-16, Jan. 1976.
[3] J. Burns, A. Hanson, and E. Riseman, "Extracting straight lines,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-8, no. 4, pp. 425-455, July 1986.
[4] M. Bajcsy, M. Mintz, and E. Liebman, "A common framework for edge detection and region growing," Univ. Pennsylvania GRASP Lab., Tech. Rep. 61, 1986.
[5] P. Bouthemy and J. S. Rivero, "A hierarchical likelihood approach for region segmentation according to motion-based criteria," inProc. 1st Int. Conf. Computer Vision, 1987, pp. 463-467.
[6] P. C. Chen and T. Pavlidis, "Segmentation by texture using a cooccurrence matrix and a split-and-merge algorithm,"Comput. Graphics Image Processing, vol. 10, pp. 172-182, 1979.
[7] M. F. Doherty, M. T. Nogu, and C. M. Bjorklund, "Use of compound predicates in split-and-merge segmentation," inProc. CVPR 85, San Francisco, CA, pp. 659-661.
[8] P. Fua and T. Hanson, "Using generic geometric models for intelligent shape extraction," inProc. DARPA-image Understanding Workshop, 1987, pp. 227-233.
[9] H. F. Feng and T. Pavlidis, "The generation of polygonal outlines of objects from gray level pictures,"IEEE Trans. Circuits Syst., vol. CAS-22, pp. 427-439, 1975.
[10] R. Gershon, A. D. Jepson, and J. K. Tsotsos, "Highlight identification using chromatic information," inProc. 1st Int. Conf. Computer Vision, 1987, pp. 161-170.
[11] S. Grinaker, "Edge based segmentation and texture separation," inProc. 5th Int. Conf. Pattern Recognition, Miami Beach, FL, 1980, pp. 554-557.
[12] S. L. Horowitz and T. Pavlidis, "Picture segmentation by a Tree Traversal Algorithm,"J. Assoc. Comput. Machinery, vol. 23, pp. 368-388, 1976.
[13] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[14] M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active contour models," inProc. 1st Int. Conf. Computer Vision, 1987, pp. 259- 267.
[15] R. H. Laprade and M. F. Doherty, "Split-and-merge segmentation using an F test criterion,"Proc. SPIE--Int. Soc. Opt. Eng., vol. 758, pp. 74-79, 1978.
[16] D. Lee, T. Pavlidis, and K. Huang, "Edge detection through residual analysis," inProc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, June 1988, pp. 215-222.
[17] Y. T. Liow, "Integrating region growing and edge detection," Ph.D. dissertation, Dep. Elec. Eng., SUNY at Stony Brook, 1989.
[18] A. Martelli, "Edge detection using heuristic search methods,"Comput. Graphics Image Processing, vol. 1, pp. 169-182, 1972.
[19] U. Montanari, "On the optimal detection of curves in noisy pictures,"Comm. ACM, vol. 14, pp. 335-345, 1971.
[20] T. Pavlidis,Structural Pattern Recognition. Berlin: Springer-Verlag, 1977.
[21] T. Pavlidis,Algorithms for Graphics and Image Processing. Rockville, MD: Computer Science Press, 1982.
[22] C. H. Reinsch, "Smoothing by spline functions,"Numer. Math., vol. 10, pp. 177-183, 1967.
[23] B. Shahraray and D. J. Anderson, "Optimal estimation of contour properties by cross-validated regularization,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 600-610, June 1989.
[24] G. Wahba, "Convergence rates of thin plate smoothing splines when the data are noisy," inSmoothing Techniques for Curve Estimation, T. Gasser and M. Rosenblatt, Eds. Berlin: Springer-Verlag, 1979, pp. 233-245.

Index Terms:
region boundaries; image gradient variation; pattern recognition; region growing; edge detection; image segmentation; split-and merge algorithm; boundary smoothness; data structure; quadtree; C language; Sun 3/160 workstation; Unix operating system; tool images; aerial photographs; pattern recognition; picture processing
T. Pavlidis, Y.T. Liow, "Integrating Region Growing and Edge Detection," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 3, pp. 225-233, March 1990, doi:10.1109/34.49050
Usage of this product signifies your acceptance of the Terms of Use.