cvpr cvpr2013 cvpr2013-126 cvpr2013-126-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Michael Donoser, Horst Bischof
Abstract: In this paper we revisit diffusion processes on affinity graphs for capturing the intrinsic manifold structure defined by pairwise affinity matrices. Such diffusion processes have already proved the ability to significantly improve subsequent applications like retrieval. We give a thorough overview of the state-of-the-art in this field and discuss obvious similarities and differences. Based on our observations, we are then able to derive a generic framework for diffusion processes in the scope of retrieval applications, where the related work represents specific instances of our generic formulation. We evaluate our framework on several retrieval tasks and are able to derive algorithms that e. g. achieve a 100% bullseye score on the popular MPEG7 shape retrieval data set.
[1] A. Albarelli, S. Bulo, A. Torsello, and M. Pelillo. Matching as non-cooperative game. In ICCV, 2009.
[2] X. Bai, X. Yang, L. Latecki, W. Liu, and Z. Tu. Learning context-sensitive shape similarity by graph transduction. PAMI, 32:861–874, 2010.
[3] M. Cho and K. M. Lee. Authority-shift clustering: Hierarchical clustering by authority seeking on graphs. In CVPR, 2010.
[4] R. Coifman and S. Lafon. Diffusion maps. Applied and Computational Harmonic Analysis: Special issue on Diffusion Maps and Wavelets, 21:5–30, 2006.
[5] A. Egozi, Y. Keller, and H. Guterman. Improving shape retrieval by spectral matching and meta similarity. IEEE Transactions on Image Processing, 5: 13 19–1327, 2010.
[6] A. Georghiades, P. Belhumeur, and D. Kriegman. From few to many: Illumination cone models for face recognition under variable lighting and pose. PAMI, 23:643–660, 2001.
[7] R. Gopalan, P. Turaga, and R. Chellappa. Articulationinvariant representation of non-planar shapes. In ECCV, 2010.
[8] J. Jiang, B. Wang, and Z. Tu. Unsupervised metric learning by self-smoothing operator. In ICCV, 2011.
[9] P. Kontschieder, M. Donoser, and H. Bischof. Beyond pairwise shape similarity analysis. In ACCV, 2009.
[10] L. Latecki, R. Lakamper, and U. Eckhardt. Shape descriptors for non-rigid shapes with a single closed contour. In CVPR, 2000.
[11] F. Lin and W. W. Cohen. Power iteration clustering. In ICML, 2012.
[12] H. Ling and D. Jacobs. Shape classification using the inner-
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22]
[23]
[24] distance. PAMI, 29(2):286–299, Feb. 2007. H. Ling, X. Yang, and L. J. Latecki. Balancing deformability and discriminability for shape matching. In ECCV, 2010. H. Liu and S. Yan. Common visual pattern discovery via spatially coherent correspondences. In CVPR, 2010. H. Liu and S. Yan. Robust graph mode seeking by graph shift. In ICML, 2010. H. Liu, X. Yang, L. J. Latecki, and S. Yan. Dense neighborhoods on affinity graph. IJCV, 2012. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford, 1998. M. Pelillo. Matching free trees with replicator equations. In NIPS, 2001. B. Wang and Z. Tu. Affinity learning via self-diffusion for image segmentation and clustering. In CVPR, 2012. J. Wang, Y. Li, X. Bai, Y. Zhang, C. Wang, and N. Tang. Learning context-sensitive similarity by shortest path propagation. Pattern Recognition, 44(10-1 1):2367–2374, 2011. X. Yang, S. Koknar-Tezel, and L. Latecki. Locally constrained diffusion process on locally densified distance spaces with applications to shape retrieval. In CVPR, 2009. X. Yang, L. Prasad, and L. J. Latecki. Affinity learning with diffusion on tensor product graph. PAMI, 35, 2013. D. Zhou, J. Weston, A. Gretton, O. Bousquet, and B. Sch o¨lkopf. Ranking on data manifolds. In NIPS. 2004. X. Zhu. Semi-Supervised Learning with Graphs. PhD thesis, Language Technologies Institute, Carnegie Mellon University, 2005. 11111333332222257755