.png){kind=icon}
返回
A fast dictionary-learning-based classification scheme using undercomplete dictionaries
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2023.109124.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In dictionary-learning-based classification methods, a given data point is classified based on its represen-tation over one or possibly more learned dictionaries. The goal is to find dictionaries that minimize the classification error. Previous works aimed to train dictionaries with representation and classification pow-ers by using overcomplete dictionaries and sparse coding. These approaches are computationally expen-sive and do not scale readily to problems with high dimensional data. This paper presents a dictionary -learning-based classification method with the primary goal of classification and not representation. We propose to train multiple undercomplete dictionaries (one for each class of the problem). Each dictionary approximates the given test data, and the one with the lowest reconstruction error determines the class. Singular value decomposition (SVD) is used to obtain a straightforward algorithm for the resulted opti-mization problem. Simulation results show that our method achieves a higher accuracy compared with a number of successful sparse representation based classification methods, while having a significantly lower computational cost.& COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Dictionary learning
Supervised classification
Undercomplete dictionary
Singular value decomposition (SVD)
Gradient projection
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
Multi-spectral low-rank structured dictionary learning for face recognition.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Gradient-based learning applied to document recognition基于梯度的学习在文档识别中的应用PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏分享收藏
查看更多内容