On combining graph-partitioning with non-parametric clustering for image segmentation

Computer Vision and Image Understanding

Volumn 95, Issue 1, 2004, Pages 72-85

  Martínez, Aleix M ^a   Mittrapiyanuruk, Pradit ^b   Kak, Avinash C ^b  

^a Ohio State University   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; PARAMETER ESTIMATION;

CLUSTERING ALGORITHMS; EIGENSPACE; GRAPH-PARTITIONING; NON-PARAMETRIC CLUSTERING;

IMAGE SEGMENTATION;

EID: 3042512178     PISSN: 10773142     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cviu.2004.01.003     Document Type: Article

References (26)

1. Alpert C.J., Kahng A.B. Recent developments in netlist partitioning: a survey. Integration: VLSI J. 19:1995;1-81.
2. Alpert C.J., Kahng A.B., Yao S. Spectral partitioning with multiple eigenvectors. Discrete Appl. Math. 90:1999;3-26.
3. Barnes E.R. An algorithm for partitioning the nodes of a graph. SIAM J. Alg. Dic. Math. 3:1982;541-549.
4. Chan P.K., Schlag M.D.F., Zien J. Spectral k-way ratio cut partitioning and clustering. IEEE Trans. CAD. 1994;1088-1096.
5. Ding C.H.Q., He X., Zha H., Gu M., Simon H.D. A min-max cut algorithm for graph partitioning and data clustering. Proc. IEEE Int. Conf. Data Mining. 2001.
6. Frankle J., Karp R.M. Circuit placements and cost bounds by eigenvector decomposition. Proc. IEEE Int. Conf. Comput. Aided Des. 1986;414-417.
7. Fiedler M. Algebraic connectivity of graph. Czech. Math. J. 23:1973;298-305.
8. Fukunaga K. Introduction to Statistical Pattern Recognition. second ed. 1990;Academic Press, New York.
9. Gdalyahu Y., Weinshall D., Werman M. Self-organization in vision: stochastic clustering for image segmentation, perceptual grouping, and image database organization. IEEE Trans. Pattern Anal. Mach. Intell. 23(10):2001;1053-1074.
10. Hadley S.W., Mark B.L., Vannelli A. An efficient eigenvector approach for finding netlist partitions. IEEE Trans. CAD. 11:1992;885-892.
11. Hagen L., Kahng A.B. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput. Aided Des. 11:1992;1074-1085.
12. Hall K.M. An r-dimensional quadratic placement algorithm. Manag. Sci. 17:1970;219-229.
13. Koontz W.L.G., Fukunaga K. A nonparametric valley-seeking technique for cluster analysis. IEEE Trans. Comput. 21:1972;171-178.
14. Malik J., Belongie S., Leung T., Shi J. Contour and texture analysis for image segmentation. Int. J. Comp. Vis. 43(1):2001;7-27.
15. Mohar B. Alavi Y., Chartrand G., Oellermann O.R., Schwenk A.J. The Laplacian Spectrum of Graphs, In Graph Theory, Combinatorics and Applications, vol. 2. 1991;871-898 Wiley, New York.
16. Perona P., Freeman W.T. A factorization approach to grouping. Proc. Eur. Conf. Comput. Vis. 1998;655-670.
17. Sanfeliu A., Alquézar R., Andrade J., Climent J., Serratosa F., Vergés J. Graph-based representations and techniques for image processing and image analysis. Patt. Recogn. 35:2002;639-650.
18. Sarkar S., Boyer K.L. Computing Perceptual Organization in Computer Vision. 1994;World Scientific, Singapore.
19. Sarkar S., Boyer K.L. Quantitative measures of change based on feature organization: eigenvalues and eigenvectors. Proc. IEEE Conf. Comput. Vis. Patt. Recogn. 1996;478-483.
20. Sarkar S., Soundararajan P. Supervise learning of large perceptual organization: graph spectral partitioning and learning automata. IEEE Trans. Patt. Anal. Mach. Intell. 22(5):2000;504-525.
21. Shi J., Malik J. Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 22(8):2000;888-905.
22. Soundararajan P., Sarkar S. An in-depth study of graph partitioning measures for perceptual organization. IEEE Trans. Patt. Anal. Mach. Intell. 25(6):2003;642-660.
23. D. Tal, J. Malik, "Combining color, texture and contour cues for image segmentation, Preprint, 2001.
24. Wang S., Siskind J.M. Image segmentation with minimum min cut. Proc. Int. Conf. Comput. Vis. 2001.
25. Wang S., Siskind J.M. Image segmentation with ratio cut. IEEE Trans. Patt. Anal. Mach. Intell. 25(6):2003;675-690.
26. Wu Z., Leahy R. An optimal graph theoretical approach to data clustering: theory and its application to image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 15:1993;1101-1113.