Transitive distance clustering with K-means duality

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

Volumn , Issue , 2014, Pages 987-994

  Yu, Zhiding ^a   Xu, Chunjing ^b   Meng, Deyu ^c,d   Hui, Zhuo ^a   Xiao, Fanyi ^d   Liu, Wenbo ^a   Liu, Jianzhuang ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b HUAWEI TECHNOLOGIES CO LTD   (China)

^c XI'AN JIAOTONG UNIVERSITY   (China)

^d CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE SEGMENTATION; PATTERN RECOGNITION;

COMPLEX CLUSTERS; COMPUTATIONAL BURDEN; EFFECTIVE DISTANCE; K-MEANS; REAL APPLICATIONS; SPECTRAL CLUSTERING; SPECTRAL CLUSTERING METHODS; TIME COMPLEXITY;

K-MEANS CLUSTERING;

EID: 84911380088     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2014.131     Document Type: Conference Paper

References (24)

1. B. Fischer and J. M. Buhmann. Path-Based Clustering for Grouping of Smooth Curves and Texture Segmentation. IEEE Trans. PAMI, 2003.
2. B. Fischer, V. Roth and J. M. Buhmann. Clustering with the connectivity kernel. In NIPS, 2004.
3. I.S. Dhillon, Y. Guan and B. Kulis. Kernel k-means: spectral clustering and normalized cuts. In ACM SIGKDD, 2004.
4. C. Ding, X. He, H. Xiong and H. Peng. Transitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques. Int. J. of Data Mining and Bioinformatics, 2006.
5. M. Fiedler. Ultrametric sets in euclidean point spaces. Electronic J. of Linear Algebra, 1998.
6. M. Girolami. Mercer kernel-based clustering in feature space. IEEE Trans. Neural Networks, 2002.
7. A.K. Jain, M.N. Murty and P.J. Flynn. Data clustering: a review. ACM Computing Surveys, 1999.
8. A.Y. Lemin, Isometric imbedding of isosceles (non-Archimedean) spaces into Euclidean ones. Dokl. Akad. Nauk SSSR 285:558-562, 1985.
9. A.Y. Ng, M. Jordan and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, 2001.
10. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. PAMI, 2000.
11. G.W. Stewart and J. Sun. Matrix Perturbation Theory. Computer Science and Scientific Computing, 1990.
12. D. Verma and M. Meila. A comparison of spectral clustering algorithms. Technical report 03-05-01, Dept of CSE, Univ. of Washington, 2003.
13. L. Zelnik-Manor and P. Perona. Self-tuning spectral clustering. In NIPS, 2004.
14. Z. Yu, et al.. Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation. In CVPR, 2011.
15. P. Felzenszwalb and D. Huttenlocher. Efficient Graph-Based Image Segmentation. IJCV, 2004.
16. D. Yan, L. Huang, M.I. Jordan. Fast Approximate Spectral Clustering. ACM SIGKDD, 2009.
17. J. Wang, et al.. Normalized Tree Partitioning for Image Segmentation. CVPR, 2008.
18. W. Chen, Y. Song, H. Bai, C. Lin and E. Chang. Parallel Spectral Clustering in Distributed Systems. PAMI, 2011.
19. C. Fowlkes, S. Belongie, F. Chung and J. Malik. Spectral Grouping Using the Nystrom Method. PAMI, 2004.
20. T. Cour, F. Benezit and J. Shi. Spectral Segmentation with Multiscale Graph Decomposition. CVPR, 2005.
21. M. Li, X. Lian, J. Kwok and B. Lu. Time and Space Efficient Spectral Clustering via Column Sampling. CVPR, 2011.
22. G. Mori. Guiding Model Search Using Segmentation. ICCV, 2005.
23. Z. Yu, A. Li, O.C. Au and C. Xu. Bag of Textons for Image Segmentation via Soft Clustering and Convex Shift. CVPR, 2012.
24. M. Mignotte. A label field fusion Bayesian model and its penalized maximum rand estimator for image segmentation. IEEE Trans. on Image Proc., 2010.