Abstract
Graph costructing plays an essential role in graph based learning algorithms. Recently, a new kind of graph called L1 graph which was motivated by that each datum can be represented as a sparse combination of the remaining data was proposed and showed its advantages over the conventional graphs. In this paper, the L1 graph was extended to kernel space. By solving a kernel sparse representation problem, the adjacency and the weights of the graph are simutaneously obtained. Kernel L1 graph preserved the advantages of L1 graph and can be more robust to noise and more data adaptive. Experiments on graph based learning tasks verified the supeririority of kernel L1 graph over the conventional K-NN graph, ε-ball graph, and the state-of-the-art L1 graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tenenbaum, J.B., Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000)
Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323–2326 (2000)
Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15(6), 1373–1396 (2002)
Yan, S., Xu, D., Zhang, B.: Graph Embedding and Extensions: A General Framework for Dimensionality Reduction. IEEE TPAMI 29(1), 40–51 (2007)
Cheng, B., Yang, J., Yan, S.: Learning With l 1-Graph for Image Analysis. IEEE TIP 19(4), 858–866 (2010)
Gao, S., Tsang, I.W.-H., Chia, L.-T.: Kernel Sparse Representation for Image Classification and Face Recognition. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part IV. LNCS, vol. 6314, pp. 1–14. Springer, Heidelberg (2010)
Li, H., Gao, Y., Sun, J.: Fast kernel sparse representation. In: Int. Conf. Digital Image Computing: Tech. & Appl. (2011)
Luxburg, U.V.: A Tutorial on Spectral Clustering. Statistics and Computing (2007)
Wright, J., Ma, Y., Mairal, J., Sapiro, G.: Sparse Representation for Computer Vision and Pattern Recognition. Proc. of IEEE (2009)
Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 1.21 (October 2010), http://cvxr.com/cvx
Lee, H., Battle, A., Raina, R., Ng, A.Y.: Efficient sparse coding algorithms. In: Neural Information Processing Systems, pp. 801–808 (2006)
Song, L., Smola, A., Gretton, A., Borgwardt, K.M.: A dependence maximization view of clustering. In: Proc. of ICML, Corvallis, Oregon, USA, pp. 815–822 (2007)
Hull, J.: A database for handwritten text recognition research. IEEE Trans. Pattern Anal. Mach. Intell. 16(5), 550–554 (1994)
Tropp, J.A.: Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50(10), 2231–2242 (2004)
Wang, M., Hua, X., Hong, R., et al.: Unified Video Annotation via Multigraph Learning. IEEE Trans. on Circuits and Systems for Video Technology 19(5), 733–746 (2009)
Wang, M., Hua, X., Tang, J., et al.: Beyond Distance Measurement: Constructing Neighborhood Similarity for Video Annotation. IEEE Trans. on Multimedia 11(3), 465–476 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, L., Dai, B., Fang, Y., Wu, T. (2012). Kernel L1 Graph for Image Analysis. In: Liu, CL., Zhang, C., Wang, L. (eds) Pattern Recognition. CCPR 2012. Communications in Computer and Information Science, vol 321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33506-8_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-33506-8_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33505-1
Online ISBN: 978-3-642-33506-8
eBook Packages: Computer ScienceComputer Science (R0)