Local features are not lonely – Laplacian sparse coding for image classification

Citations Over TimeTop 1% of 2010 papers

Abstract

Sparse coding which encodes the original signal in a sparse signal space, has shown its state-of-the-art performance in the visual codebook generation and feature quantization process of BoW based image representation. However, in the feature quantization process of sparse coding, some similar local features may be quantized into different visual words of the codebook due to the sensitiveness of quantization. In this paper, to alleviate the impact of this problem, we propose a Laplacian sparse coding method, which will exploit the dependence among the local features. Specifically, we propose to use histogram intersection based kNN method to construct a Laplacian matrix, which can well characterize the similarity of local features. In addition, we incorporate this Laplacian matrix into the objective function of sparse coding to preserve the consistence in sparse representation of similar local features. Comprehensive experimental results show that our method achieves or outperforms existing state-of-the-art results, and exhibits excellent performance on Scene 15 data set.

Related Papers

• → Geometry constrained sparse coding for single image super-resolution(2012)99 cited
• → Two dimensional synthesis sparse model(2013)19 cited
• → An Overview of Sparse Representation Based Action Recognition in Video(2018)1 cited
• → Sparse Representation On Single Image(2019)
• → Letter from Prof. Kirchhoff on the chemical analysis of the solar atmosphere(1862)