.png){kind=icon}
返回
Non-negativity and locality constrained Laplacian sparse coding for image classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2016.12.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The traditional sparse coding (SC) method has achieved good results in image classification. However, one of its serious weaknesses is that it ignores the relationship between features thus losing spatial information. Moreover, in combinatorial optimisation problems, operations of addition and subtraction are involved, and the use of subtraction may cause features to be cancelled. In this paper, we propose a method called non-negativity and locality constrained Laplacian sparse coding (NLLSC) for image classification. Firstly, non-negative matrix factorisation (NMF) is used in the Laplacian sparse coding (LSC), which is applied to constrain the negativity of both codebook and code coefficient. Secondly, we introduce K nearest neighbouring codewords for local features because locality is more important than sparseness. Finally, non-negativity and locality constrained operators are introduced to obtain a novel sparse coding for local features, and then in the pooling step, we use spatial pyramid division (SPD) and max pooling (MP) to represent the final images. As for image classification, multi-class linear SVM is adopted. Experiments on several standard image datasets have shown better performance than previous algorithms. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Non-negativity
Locality
LSC
K nearest neighbourhoods
SPD
MP
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容