Kernel L1 Graph for Image Analysis

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, e-ball graph, and the state-of-the-art L1 graph.

[1]  Shuicheng Yan,et al.  Learning With $\ell ^{1}$-Graph for Image Analysis , 2010, IEEE Transactions on Image Processing.

[2]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[3]  Jonathan J. Hull,et al.  A Database for Handwritten Text Recognition Research , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[5]  Meng Wang,et al.  Unified Video Annotation via Multigraph Learning , 2009, IEEE Transactions on Circuits and Systems for Video Technology.

[6]  Le Song,et al.  A dependence maximization view of clustering , 2007, ICML '07.

[7]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[8]  Guillermo Sapiro,et al.  Sparse Representation for Computer Vision and Pattern Recognition , 2010, Proceedings of the IEEE.

[9]  Shuicheng Yan,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007 .

[10]  Meng Wang,et al.  Beyond Distance Measurement: Constructing Neighborhood Similarity for Video Annotation , 2009, IEEE Transactions on Multimedia.

[11]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[12]  Liang-Tien Chia,et al.  Kernel Sparse Representation for Image Classification and Face Recognition , 2010, ECCV.

[13]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[14]  Jun Sun,et al.  Fast Kernel Sparse Representation , 2011, 2011 International Conference on Digital Image Computing: Techniques and Applications.

[15]  Rajat Raina,et al.  Efficient sparse coding algorithms , 2006, NIPS.

[16]  Thomas Deselaers,et al.  ClassCut for Unsupervised Class Segmentation , 2010, ECCV.