Fast Low-rank Representation based Spatial Pyramid Matching for Image Classification

Page view(s)
0
Checked on
Fast Low-rank Representation based Spatial Pyramid Matching for Image Classification
Title:
Fast Low-rank Representation based Spatial Pyramid Matching for Image Classification
Journal Title:
Knowledge based Systems
OA Status:
Keywords:
Publication Date:
16 October 2015
Citation:
Xi Peng, Rui Yan, Bo Zhao, Huajin Tang, Zhang Yi, Fast low rank representation based spatial pyramid matching for image classification, Knowledge-Based Systems, Volume 90, December 2015, Pages 14-22, ISSN 0950-7051, http://dx.doi.org/10.1016/j.knosys.2015.10.005.
Abstract:
Spatial Pyramid Matching (SPM) and its variants have achieved a lot of success in image classification. The main difference among them is their encoding schemes. For example, ScSPM incorporates Sparse Code (SC) instead of Vector Quantization (VQ) into the framework of SPM. Although the methods achieve a higher recognition rate than the traditional SPM, they consume more time to encode the local descriptors extracted from the image. In this paper, we propose using Low Rank Representation (LRR) to encode the descriptors under the framework of SPM. Different from SC, LRR considers the group effect among data points instead of sparsity. Benefiting from this property, the proposed method (i.e., LrrSPM) can offer a better performance. To further improve the generalizability and robustness, we reformulate the rank-minimization problem as a truncated projection problem. Extensive experimental studies show that LrrSPM is more efficient than its counterparts (e.g., ScSPM) while achieving competitive recognition rates on nine image data sets.
License type:
http://creativecommons.org/licenses/by-nc-nd/4.0/
Funding Info:
Description:
ISSN:
0950-7051
1872-7409
Files uploaded: