返回
Parameter self-tuning schemes for the two phase test sample sparse representation classifier
DOI:10.1007/s13042-019-01045-x.png)
摘要
En 中文
Sparse Representation Classifier (SRC) and its variants were considered as powerful classifiers in the domains of computer vision and pattern recognition. However, classifying test samples is computationally expensive due to the l1norm minimization problem that should be solved in order to get the sparse code. Therefore, these classifiers could not be the right choice for scenarios requiring fast classification. In order to overcome the expensive computational cost of SRC, a two-phase coding classifier based on classic Regularized Least Square was proposed. This classifier is more efficient than SRC. A significant limitation of this classifier is the fact that the number of the samples that should be handed over to the next coding phase should be specified a priori. This paper overcomes this main limitation and proposes five data-driven schemes allowing an automatic estimation of the optimal size of the local samples. These schemes handle the three cases that are encountered in any learning system: supervised, unsupervised, and semi-supervised. Experiments are conducted on five image datasets. These experiments show that the introduced learning schemes can improve the performance of the two-phase linear coding classifier adopting ad-hoc choices for the number of local samples.
Keyword:
Sparse representation
Two phase test sample sparse representation
Parameter self-tuning
Clusters
Classification
Performance evaluation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
Bazalt ve Atık Cam Agregalı Betonlarda Alkali-Silis Reaksiyonu Genleşmeleri ve Alkali Sızıntısı Seviyeleri
Teknik Dergi
IF0

