nips nips2007 nips2007-109 nips2007-109-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Mehul Parsana, Sourangshu Bhattacharya, Chiru Bhattacharya, K. Ramakrishnan
Abstract: This paper introduces kernels on attributed pointsets, which are sets of vectors embedded in an euclidean space. The embedding gives the notion of neighborhood, which is used to define positive semidefinite kernels on pointsets. Two novel kernels on neighborhoods are proposed, one evaluating the attribute similarity and the other evaluating shape similarity. Shape similarity function is motivated from spectral graph matching techniques. The kernels are tested on three real life applications: face recognition, photo album tagging, and shot annotation in video sequences, with encouraging results. 1
[1] Helmut Alt and Leonidas J. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation A survey. Technical Report B 96-11, 1996.
[2] E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK Users’ Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, third edition, 1999.
[3] Karsten M. Borgwardt and Hans-Peter Kriegel. Shortest-path kernels on graphs. In ICDM ’05: Proceedings of the Fifth IEEE International Conference on Data Mining, pages 74–81, Washington, DC, USA, 2005. IEEE Computer Society.
[4] Chih-Chung Chang and Chih-Jen Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/∼cjlin/libsvm.
[5] Ingvar Eidhammer, Inge Jonassen, and William R. Taylor. Structure comparison and structure patterns. Journal of Computational Biology, 7(5):685–716, 2000.
[6] C. Harris and M.J. Stephens. A combined corner and edge detector. In Proc. of Alvey Vision Conf., 1988.
[7] David Haussler. Convolution kernels on discrete structures. Technical report, University of California, Santa Cruz, 1999.
[8] Koji Tsuda Hisashi Kashima and Akihiro Inokuchi. Marginalized kernels between labeled graphs. In Twentieth International Conference on Machine Learning (ICML), 2003.
[9] Risi Kondor and Tony Jebara. A kernel between sets of vectors. In Twentieth International Conference on Machine Learning (ICML), 2003.
[10] Tai Sing Lee. Image representation using 2d gabor wavelets. IEEE TPAMI, 18(10):959–971, 1996.
[11] D. Lowe. Distinctive image features from scale-invariant keypoints. Int. Journal of Computer Vision, 20:91–110, 2003.
[12] Siwei Lyu. Mercer kernels for object recognition with local features. In IEEE CVPR, 2005.
[13] A.M. Martinez and R. Benavente. The ar face database. CVC Technical Report, 24, 1998.
[14] Bo Gun Park, Kyoung Mu Lee, and Sang Uk Lee. Face recognition using face-arg matching. IEEE TPAMI, 27(12):1982–1988, 2005.
[15] Amnon Shashua and Tamir Hazan. Algebraic set kernels with application to inference over local image representations. In Neural Information Processing Systems (NIPS), 2004.
[16] Shinji Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE transactions on pattern analysis and machine intelligence, 10(5):695–703, 1988.
[17] Lior Wolf and Amnon Shashua. Learning over sets using kernel principal angles. Journal of Machine Learning Research, (4):913–931, 2003.
[18] Haim J. Wolfson and Isidore Rigoutsos. Geometric hashing: An overview. IEEE Comput. Sci. Eng., 4(4):10–21, 1997.
[19] L. Zhang, L. Chen, M. Li, and H. Zhang. Automated annotation of human faces in family albums, 2003.
[20] W. Zhao, R. Chellappa, P. J. Phillips, and A. Rosenfeld. Face recognition: A literature survey. ACM Comput. Surv., 35(4):399–458, 2003. 8