Sparse Coding Model Based on Kernel Laplacian for Image Classification
LIU Yue1, PENG Hong-Jing1, QIAN Su-Jing1, SHI Wei2
1.College of Electronics and Information Engineering, Nanjing Tech University, Nanjing 211816 2.Department of Computer Science, Nanjing Institute of Mechatronic Technology, Nanjing 211135
Abstract In bag-of-words with sparse coding model, similar features can be encoded as various sparse coding combinations due to the over-completeness of the codebook, which results in totally different visual words. In this paper, a sparse coding method based on kernel Laplacian for image classification is proposed. Firstly, a Laplacian matrix is constructed to capture geometric dependencies between the features in high-dimensional kernel space, and thus the similarity of sparse coding between the similar features can be maximally preserved. Secondly, the objective function is optimized for codebook learning by fixing codebook and sparse matrix alternately, and feature-sign search algorithm is used for sparse coding of the features. Finally, the one-to-all linear SVM classifier is applied to classify images. The experimental results on several datasets show the proposed algorithm decreases the quantization error dramatically and improves the classification performance.
[1] Felzenszwalb P F, Girshick R B, McAllester D, et al. Object Detection with Discriminatively Trained Part-Based Models. IEEE Trans on Pattern Analysis and Machine Intellignece, 2010, 32(9): 1627-1645 [2] Sivic J, Zisserman A. Video Google: A Text Retrieval Approach to Object Matching in Videos // Proc of the 9th IEEE International Conference on Computer Vision. Nice, France, 2003, II: 1470- 1477 [3] Lazebnik S, Schmid C, Ponce J. Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories // Proc of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. New York, USA, 2006, II: 2169-2178 [4] Grauman K, Darrell T. The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features // Proc of the 10th IEEE International Conference on Computer Vision. Beijing, China, 2005, II: 1458-1465 [5] Yang J C, Yu K, Gong Y H, et al. Linear Spatial Pyramid Ma-tching Using Sparse Coding for Image Classification // Proc of the IEEE Conference on Computer Vision and Pattern Recognition. Miami, USA, 2009: 1794-1801 [6] Wu J X, Rehg J M. Beyond the Euclidean Distance: Creating Effective Visual Codebooks Using the Histogram Intersection Kernel // Proc of the 12th IEEE International Conference on Computer Vision. Kyoto, Japan, 2009: 630-637 [7] von Luxburg U. A Tutorial on Spectral Clustering. Statistics and Computing, 2007, 17 (4): 395-416 [8] Liu R J, Wang Y H, Baba T, et al. Semi-supervised Learning by Locally Linear Embedding in Kernel Space // Proc of the 19th International Conference on Pattern Recognition. Tampa, USA, 2008: 1-4 [9] Lowe D G. Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision, 2004, 60(2): 91-110 [10] Wu Z, Ke Q F, Isard M, et al. Bundling Features for Large Scale Partial-Duplicate Web Image Search // Proc of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Miami, USA, 2009: 25-32 [11] Gao S H, Tsang I W H, Chia L T, et al. Local Features Are Not Lonely-Laplacian Sparse Coding for Image Classification // Proc of the IEEE Conference on Computer Vision and Pattern Recognition. San Francisco, USA, 2010: 3555-3561 [12] Gao S H, Tsang I W H, Chia L T. Kernel Sparse Representation for Image Classification and Face Recognition // Proc of the 11th European Conference on Computer Vision. Heraklion, Greece, 2010, Ⅳ: 1-14 [13] Gao S H, Tsang I W H, Chia L T. Sparse Representation with Kernels. IEEE Trans on Image Processing, 2013, 22(2): 423-434 [14] Hyvrinen A. The Fixed-Point Algorithm and Maximum Likelihood Estimation for Independent Component Analysis. Neural Processing Letters, 1999, 10(1): 1-5 [15] Lee H, Battle A, Raina R, et al. Efficient Sparse Coding Algorithms // Proc of the 20th Annual Conference on Neural Information Processing Systems. Vancouver, Canada, 2006: 801-808 [16] Bo L F, Sminchisescu C. Efficient Match Kernels between Sets of Features for Visual Recognition // Proc of the 23rd Annual Conference on Neural Information Processing Systems. Vancouver, Canada, 2009: 135-143
2014, Vol. 27 
