Integrating Region Growing and Edge Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 12, Issue 3, 1990, Pages 225-233

  Pavlidis, Theo ^a   Liow, Yuh Tay ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

Edge detection; image analysis; merge algorithm; region growing; segmentation; split and merge algorithm

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS;

EDGE DETECTION; IMAGE SEGMENTATION;

IMAGE PROCESSING;

EID: 0025403806     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.49050     Document Type: Article

References (24)

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. B. Burns, A. R. Hanson, and E. M. Riseman, “Extracting straight lines,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, pp. 425–455, 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,” in Proc. 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,” in Proc. CVPR 85, San Francisco, CA, pp. 659–661.
8. P. Fua and T. Hanson, “Using generic geometric models for intelligent shape extraction,” in Proc. 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,” in Proc. 1st Int. Conf. Computer Vision, 1987, pp. 161–170.
11. S. Grinaker, “Edge based segmentation and texture separation,” in Proc. 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. ACM, vol. 23, pp. 368–388, 1976.
13. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Rockville, MD: Computer Science Press, 1978.
14. M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active contour models,” in Proc. 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,” in Proc. CVPR'88, Ann Arbor, MI, June 6–10, 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. Montaneri, “On the optimal detection of curves in noisy pictures,” Commun. ACM, vol. 14, no. 5, pp. 335–345, May 1971.
20. T. Pavlidis, Structural Pattern Recognition. Berlin: Springer-Ver-lag, 1977.
21. —, 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,” in Smoothing Techniques for Curve Estimation, T. Gasser and M. Rosenblatt, Eds. Berlin: Springer-Verlag, 1979, pp. 233–245.