Dominant sets and hierarchical clustering

Proceedings of the IEEE International Conference on Computer Vision

Volumn 1, Issue , 2003, Pages 362-369

  Pavan, Massimiliano ^a   Pelillo, Marcello ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; EVOLUTIONARY ALGORITHMS; GAME THEORY; HIERARCHICAL SYSTEMS; IMAGE SEGMENTATION; MATRIX ALGEBRA; PARAMETER ESTIMATION; QUADRATIC PROGRAMMING; SET THEORY;

DOMINANT SETS; EVOLUTIONARY GAME THEORY; HIERARCHICAL CLUSTERING; REGULARIZATION PARAMETER;

COMPUTER VISION;

EID: 0345414100     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccv.2003.1238367     Document Type: Conference Paper

References (26)

1. S. Aksoy and R. M. Haralick. Graph-theoretic clustering for image grouping and retrieval. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, 1999.
2. J. G. Auguston and J. Minker. An analysis of some graph theoretical clustering techniques. J. ACM, 17(4):571-588, 1970.
3. I. M. Bomze. Evolution towards the maximum clique. J. Global Optim., 10:143-164, 1997.
4. Y. Gdalyahu. Stochastic Clustering and its Applications to Computer Vision. PhD thesis, Hebrew University, Jerusalem, Israel, 1999.
5. Y. Gdalyahu and D. Weinshall. Flexible syntactic matching of curves and its application to automatic to automatic hierarchical classification of silhouettes. IEEE Trans. Pattern Anal. Machine Intell., 21(12):1312-1328, 1999.
6. Y. Gdalyahu, D. Weinshall, and M. Werman. Self-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.
7. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, UK, 1985.
8. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, NJ, 1988.
9. P. N. Klein, T. B. Sebastian, and B. B. Kimia. Shape matching using edit-distance: An implementation. In Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pages 781-190, 2001.
10. D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, Reading, MA, 1984.
11. B. Luo, A. Robles-Kelly, A. Torsello, R. C. Wilson, and E. R. Hancock. A probabilistic framework for graph clustering. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, volume 1, pages 912-919, 2001.
12. D. Miller and S. W. Zucker. Efficient simplex-like methods for equilibria of nonsymmetric analog networks. Neural Computation, 4(2):167-190, 1992.
13. 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.
14. M. Pavan and M. Pelillo. A new graph-theoretic approach to clustering and segmentation. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, volume 1, pages 145-152, 2003.
15. M. Pavan and M. Pelillo. Unsupervised texture segmentation by dominant sets and game dynamics. In Proc. IEEE Int. Conf. on Image Analysis and Processing, 2003 (in press).
16. M. Pavan, M. Pelillo, and E. Jabara. On the combinatorics of standard quadratic optimization. Forthcoming.
17. M. Pelillo, K. Siddiqi, and S. W. Zucker. Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Machince Intell., 21(11):1105-1120, 1999.
18. 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.
19. 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.
20. 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.
21. K. Sengupta and K. L. Boyer. Organizing large structural modelbases. IEEE Trans. Pattern Anal. Machine Intell., 17(4):321-332, 1995.
22. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell., 22(8):888-905, 2000.
23. K. Siddiqi, A. Shokoufaundeh, S. J. Dickinson, and S. W. Zucker. Shock graphs and shape matching. Int. J. Computer Vision, 35(1):1999, 1999.
24. J. W. Weibull. Evolutionary Game Theory. MIT Press, Cambridge, MA, 1995.
25. 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.
26. C. T. Zahn. Graph-theoretic methods for detecting and describing gestalt clusters. IEEE Trans. Comput., 20:68-86, 1971.