Graph-theoretic algorithms for image segmentation

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn 6, Issue , 1999, Pages

  Scanlon, James ^a   Deo, Narsingh ^a  

^a UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIMILARITY MEASURES;

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; TREES (MATHEMATICS);

IMAGE SEGMENTATION;

EID: 17444450599     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (6)

1. N. Deo and N. Kumar. Constrained spanning tree problems: Fast approximate methods and parallel computation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 40:191-217,1998.
2. B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 15:99-117,1993.
3. N. R. Pal and S. K. Pal. A review on image segmentation techniques. Pattern Recognition, 25(9): 1277-1293, 9 1993.
4. J. Scanlon and N. Deo. Graph-theoretic algorithms for image segmentation. UCF Technical Report CS-TR-99-02, 1999.
5. J. Shi and J. Malik. Normalized cuts and image segmentation. Proc. IEEE Conf on Pattern Recognition and Image Processing, 10063-6919.
6. Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 15(11):1101-1113,1993.