# Linear Spatial Pyramid Matching Using Non-convex and non-negative Sparse Coding for Image Classification

Source: [Linear Spatial Pyramid Matching Using Non-convex and non-negative Sparse Coding for Image Classification](<https://www.sota2.com/research/paper/68fa61ce1e209131ce9f61aa>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T20:06:28.249Z

Authors: Chengqiang Bao, Liangtian He, Yilun Wang

Published: 2015-04-27T00:46:54.000Z

## Abstract

Recently sparse coding have been highly successful in image classification mainly due to its capability of incorporating the sparsity of image representation. In this paper, we propose an improved sparse coding model based on linear spatial pyramid matching(SPM) and Scale Invariant Feature Transform (SIFT ) descriptors. The novelty is the simultaneous non-convex and non-negative characters added to the sparse coding model. Our numerical experiments show that the improved approach using non-convex and non-negative sparse coding is superior than the original ScSPM\[1\] on several typical databases.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1504.06897>)

[PDF](<https://arxiv.org/pdf/1504.06897.pdf>)