Consensus of k-NNs for robust neighborhood selection on graph-based manifolds

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

Volumn , Issue , 2013, Pages 1594-1601

  Premachandran, Vittal ^a   Kakarala, Ramakrishna ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

graph sparsification; manifold learning

Indexed keywords

DATA MANIFOLDS; GRAPH SPARSIFICATION; GRAPH-BASED; K-NEAREST NEIGHBORHOODS; LOCAL NEIGHBORHOODS; MANIFOLD LEARNING; SELECTION CRITERIA; SIMILARITY INFORMATIONS;

COMPUTER SCIENCE; ELECTRICAL ENGINEERING; SOFTWARE ENGINEERING;

PATTERN RECOGNITION;

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

References (19)

1. X. Bai, X. Yang, L. Latecki, W. Liu, and Z. Tu. Learning context-sensitive shape similarity by graph transduction. IEEE Trans. Pattern Anal. Machine Intell., 32(5):861-874, 2010.
2. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Machine Intell., pages 509-522, 2002.
3. M. Jaakkola. Partially labeled classification with markov random walks. In NIPS, volume 2, page 945. MIT Press, 2002.
4. P. Kontschieder, M. Donoser, and H. Bischof. Beyond pairwise shape similarity analysis. In ACCV, pages 655-666. Springer, 2010.
5. A. Lancichinetti and S. Fortunato. Consensus clustering in complex networks. Scientific Reports, 2, 2012.
6. H. Ling and D. Jacobs. Shape classification using the innerdistance. IEEE Trans. Pattern Anal. Machine Intell., pages 286-299, 2007.
7. H. Liu, X. Yang, L. Latecki, and S. Yan. Dense neighborhoods on affinity graph. Int. J. of Computer Vision, pages 1-18, 2011.
8. S. Monti, P. Tamayo, J. Mesirov, and T. Golub. Consensus clustering: a resampling-based method for class discovery and visualization of gene expression microarray data. Machine learning, 52(1):91-118, 2003.
9. M. Pavan and M. Pelillo. Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Machine Intell., 29(1):167-172, 2007.
10. P. Perona and L. Zelnik-Manor. Self-tuning spectral clustering. NIPS, 17:1601-1608, 2004.
11. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326, 2000.
12. B. Schölkopf, A. Smola, and K. Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural computation, 10(5):1299-1319, 1998.
13. J. Tenenbaum, V. De Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
14. O. Tuzel, F. Porikli, and P. Meer. Human detection via classification on riemannian manifolds. In CVPR, pages 1-8. IEEE, 2007.
15. X. Yang, X. Bai, L. Latecki, and Z. Tu. Improving shape retrieval by learning graph transduction. ECCV, pages 788-801, 2008.
16. X. Yang, S. Koknar-Tezel, and L. Latecki. Locally constrained diffusion process on locally densified distance spaces with applications to shape retrieval. In CVPR, pages 357-364. IEEE, 2009.
17. X. Yang and L. Latecki. Affinity learning on a tensor product graph with applications to shape and image retrieval. In CVPR, pages 2369-2376. IEEE, 2011.
18. X. Yang, L. Prasad, and L. Latecki. Affinity learning with diffusion on tensor product graph. IEEE Trans. Pattern Anal. Machine Intell., 2012.
19. Z. Zhang, J. Wang, and H. Zha. Adaptive manifold learning. IEEE Trans. Pattern Anal. Machine Intell., 34(2):253-265, 2012