"Ratio regions": A technique for image segmentation

Proceedings - International Conference on Pattern Recognition

Volumn 2, Issue , 1996, Pages 557-564

  Cox, I J ^a   Rao, S B ^a   Zhong, Yu ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b Michigan State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; PATTERN RECOGNITION;

COMPUTATIONAL COSTS; COMPUTATIONALLY EFFICIENT; GRAPH PARTITIONING ALGORITHMS; IMAGE PARTITIONING; IMAGE SEGMENTATION ALGORITHM; SEGMENTATION METHODS; SEGMENTED REGIONS; SMOOTHNESS CONSTRAINTS;

IMAGE SEGMENTATION;

EID: 84898796787     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.1996.546886     Document Type: Conference Paper

References (16)

1. A. Amini, S. Tehrani, and T. Weymouth. Using dynamical programming for minimizing the energy of active contours in the presence of hard constraints. Proc. Inter. Conf. on Computer Vision (ICCV), pages 95-99, 1988.
2. A. Blake and A. Zisserman. Visual Reconstruction. MIT Press, 1987.
3. A. Chakraborty, L. H. Staib, and J. S. Duncan. Deformable boundary finding influenced by region homogeneity. Proc. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), pages 624-627, Seattle, WA, June 1994
4. L. Cohen. Note on active contour models and balloons. CVGIP: Image Understanding, 53(2):211-218, Mar.1991
5. I. J. Cox, P. Hansen, and B. Julesz, editors. Proc. DI-MACS Workshop on Partitioning Data Sets: With applications to psychology, vision and target tracking. American Mathematical Society, 1994
6. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley and Sons, 1973.
7. D. Geiger. Personal communication. 1995.
8. D. Geiger, A. Gupta, L. Costa, and J. Vlontzos. Dynamic programming for detecting, tracking, and matching deformable contours. IEEE Trans. Pattern Anal, and Machine IntelL, 17(3):294-302, Mar. 1993.
9. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, 1988.
10. M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Active contour models. Int. J. Computer Vision, pages 321-331, 1988.
11. Y. G. Leclerc. Constructing simple stable descriptions for image partitioning. Int. J. of Computer Vision, 3:73-102, 1989.
12. U. Montanari. On the optimal detection of curves in noisy pictures. Communications of the ACM, 15(5)-.335-345, May 1971.
13. S. Rao, Faster algorithms for finding small separators in planar graphs. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 229-240, May 1992.
14. R-Ronfard. Region-based strategies for active contour models. Int. J. Comput. Vision, 13(2):229-251, 1994.
15. Z. Wu and R. Leahy. An optimal graph theoretical approach to data clustering: theory and its application to image segmentation. IEEE Trans. Pattern Anal, and Machine IntelL, 15(11):1101-1U3, Nov. 1993.
16. S. C. Zhu, T. S. Lee, and A. L. Yuille. Region competition: Unifying snakes, region growing, energy/bay es/mdl for multi-band image segmentation. In Fifth Int. Conf. on Computer Vision, pages 416-423, 1995.