期刊文献+

基于核拉普拉斯稀疏编码模型的图像分类 被引量:3

Sparse Coding Model Based on Kernel Laplacian for Image Classification
下载PDF
导出
摘要 在稀疏词袋模型中,由于码书的过完备性,相似特征间稀疏编码存在多种组合方式,从而导致相似的特征可能得到完全不同的编码.文中提出基于核拉普拉斯稀疏编码的图像分类方法.该方法首先通过在高维核空间中构造核拉普拉斯矩阵以描述特征间的几何依赖关系,使相似特征的稀疏编码的相似性尽可能得到保持.再采用交替固定码书与稀疏矩阵的方法优化目标函数进行码书学习,并采用符号猜测法对特征进行稀疏编码.最后用多类SVM分类器分类.实验证明文中方法可较大幅度降低量化误差,提高分类准确率,并在多个数据集上取得良好的测试效果. 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.
出处 《模式识别与人工智能》 EI CSCD 北大核心 2014年第10期915-920,共6页 Pattern Recognition and Artificial Intelligence
基金 江苏省自然科学基金项目(No.BK2011794)资助
关键词 核方法 拉普拉斯矩阵 稀疏编码 图像分类 Kernel Method, Laplacian Matrix, Sparse Coding, Image Classification
  • 相关文献

参考文献16

  • 1Felzenszwalb 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.
  • 2Sivic 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.
  • 3Lazebnik 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.
  • 4Grauman 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.
  • 5Yang 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.
  • 6Wu 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.
  • 7von Luxburg U. A Tutorial on Spectral Clustering. Statistics and Computing, 2007, 17 (4): 395-416.
  • 8Liu 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.
  • 9Lowe D G. Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision, 2004, 60(2): 91-110.
  • 10Wu 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.

同被引文献13

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部