.png){kind=icon}
返回
Efficient backward elimination algorithm for sparse signal representation using overcomplete dictionaries
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2002.1009004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A sparse representation of a signal, i.e., a representation using a small number of vectors chosen from a dictionary of vectors, is highly desirable in many applications. Here, we extend the backward elimination sparse representation algorithm presented in [1] to allow for an overcomplete dictionary and develop recursions for its implementation. In the overcomplete case, the representation error cannot be used as a general criterion for elimination of a dictionary vector and other criteria must be considered. Simulation on a test-case dictionary shows that the performance of the proposed algorithm can improve upon that of forward selection methods.
Keyword:
backward elimination algorithm
overcomplete dictionary
sparse representation
subset selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
没有更多内容
没有更多内容