Unsupervised texture segmentation by dominant sets and game dynamics

Proceedings - 12th International Conference on Image Analysis and Processing, ICIAP 2003

Volumn , Issue , 2003, Pages 302-307

  Pavan, Massimiliano ^a   Pelillo, Marcello ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL UNITS; CONTINUOUS OPTIMIZATION; EVOLUTIONARY GAME THEORY; GRAPH-THEORETIC; PARALLEL NETWORK; REPLICATOR DYNAMICS; TEXTURED IMAGES; UNSUPERVISED TEXTURE SEGMENTATION;

CLUSTERING ALGORITHMS; GRAPH THEORY; IMAGE ANALYSIS; NUMBER THEORY;

IMAGE SEGMENTATION;

EID: 33646598800     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAP.2003.1234067     Document Type: Conference Paper

References (16)

1. K. I. Chang, K. W. Bowyer, and M. Sivagurunath. Evaluation of texture segmentation algorithms. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, pages 1063-1069, 1999.
2. D. Forsyth and J. Ponce. Computer Vision: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 2002.
3. D. Geman, S. Geman, C. Graffigne, and P. Dong. Boundary detection by constrained optimization. IEEE Trans. Pattern Anal. Machine Intell., 12(July):609-628, 1990.
4. J. Hofbauer. Imitation dynamics for games. Collegium Budapest, preprint, 1995.
5. J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics. Cambridge University Press, Cambridge, UK, 1998.
6. T. Hofmann, J. Puzicha, and J. Buhmann. Unsupervised texture segmentation in a deterministic annealing framework. IEEE Trans. Pattern Anal. Machine Intell., 20(8):803-818, 1998.
7. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, NJ, 1988.
8. J. Malik and P. Perona. Preattentive texture discrimination with early vision mechanisms. J. Optical Soc. Am., 7(2):923-932, 1990.
9. J. Mao and A. Jain. Texture classification and segmentation using multiresolution simultaneous autoaggressive models. Pattern Recognition, 25:173-188, 1992.
10. T. S. Motzkin and E. G. Straus. Maxima for graphs and a new proof of a theorem of Turan. Canad. J. Math., 17:533-540, 1965.
11. 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.
12. M. Pelillo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11(8):2023-2045, 1999.
13. M. Pelillo and A. Jagota. Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Networks, 2:411-420, 1995.
14. 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.
15. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell., 22(8):888-905, 2000.
16. A. Torsello and M. Pelillo. Continuous-time relaxation labeling processes. Pattern Recognition, 33:1897-1908, 2000.