A new graph-theoretic approach to clustering and segmentation

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2003, Pages

  Pavan, Massimiliano ^a   Pelillo, Marcello ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; PATTERN RECOGNITION; SET THEORY; THEOREM PROVING;

CLUSTERING; DOMINANT SETS;

IMAGE SEGMENTATION;

EID: 0041939837     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. J. G. Auguston and J. Minker. An analysis of some graph theoretical clustering techniques. J. ACM, 17(4):571-588, 1970.
2. D. H. Ballard and C. M. Brown. Computer Vision. Prentice-Hall, Englewood Cliffs, NJ, 1982.
3. L. E. Baum and J. A. Eagon. An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Amer. Math. Soc., 73:360-363, 1967.
4. P. F. Felzenszwalb and D. P. Huttenlocher. Efficient graph-based image segmentation. Preprint available at http://www.cs.cornell.edu/~dph/papers/seg-revised.pdf.
5. R. A. Fisher. The Genetical Theory of Natural Selection. Oxford University Press, London, UK, 1930.
6. D. Forsyth and J. Ponce. Computer Vision: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 2002.
7. Y. Gdalyahu, D. Weinshall, and M. Werman. Sef-organization in vision: Stochastic clustering for image segmentation, perceptual grouping, and image database organization. IEEE Trans. Pattern Anal. Machine Intell., 23(10):1053-1074, 2001.
8. L. E. Gibbons, D. W. Hearn, P. M. Pardalos, and M. V. Ramana. Continuous characterizations of the maximum clique problem. Math. Oper. Res., 22:754-768, 1997.
9. C. C. Gotlieb and S. Kumar. Semantic clustering of index terms. J. ACM, 15(4):493-513, 1968.
10. J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics. Cambridge University Press, Cambridge, UK, 1998.
11. J. J. Hopfield and D. W. Tank. Neural computation of decisions in optimization problems. Biol. Cybern., 52:141-152, 1985.
12. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, NJ, 1988.
13. V. Losert and E. Akin. Dynamics of games and genes: Discrete versus continuous time. J. Math. Biol., 17:241-251, 1983.
14. D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, Reading, MA, 1984.
15. Y. Lyubich, G. D. Maistrowskii, and Y. G. Ol'khovskii. Selection-induced convergence to equilibrium in a single-locus autosomal population. Problems of Information Transmission, 16:66-75, 1980.
16. T. S. Motzkin and E. G. Straus. Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math., 17:533-540, 1965.
17. M. Pavan, M. Pelillo, and E. Jabara. On the combinatorics of standard quadratic optimization. Forthcoming, 2003.
18. M. Pelillo. The dynamics of nonlinear relaxation labeling processes. J. Math. Imaging Vision, 7(4):309-323, 1997.
19. M. Pelillo and A. Jagota. Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Networks, 2:411-420, 1995.
20. P. Perona and W. Freeman. A factorization approach to grouping. In H. Burkhardt and B. Neumann, editors, Computer Vision-ECCV'98, pages 655-670. Springer-Verlag, Berlin, 1998.
21. V. V. Raghavan and C. T. Yu. A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Trans. Pattern Anal. Machine Intell., 3:393-402, 1981.
22. A. Rosenfeld, R. A. Hummel, and S. W. Zucker. Scene labeling by relaxation operations. IEEE Trans. Syst. Man & Cybern., 6:420-433, 1976.
23. S. Sarkar and K. L. Boyer. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. Computer Vision and Image Understanding, 71(1):110-136, 1998.
24. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell., 22(8):888-905, 2000.
25. J. W. Weibull. Evolutionary Game Theory. MIT Press, Cambridge, MA, 1995.
26. Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Trans. Pattern Anal. Machine Intell., 15(11):1101-1113, 1993.
27. C. T. Zahn. Graph-theoretic methods for detecting and describing gestalt clusters. IEEE Trans. Comput., 20:68-86, 1971.
28. S. W. Zucker, A. Dobbins, and L. Iverson. Two stages of curve detection suggest two styles of visual computation. Neural Computation, 1:68-81, 1989.