.png){kind=icon}
返回
An AK-BRP dictionary learning algorithm for video frame sparse representation in compressed sensing
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-016-4134-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sparsifying transform is an important prerequisite in compressed sensing. And it is practically significant to research the fast and efficient signal sparse representation methods. In this paper, we propose an adaptive K-BRP (AK-BRP) dictionary learning algorithm. The bilateral random projection (BRP), a method of low rank approximation, is used to update the dictionary atoms. Furthermore, in the sparse coding stage, an adaptive sparsity constraint is utilized to obtain sparse representation coefficient and helps to improve the efficiency of the dictionary update stage further. Finally, for video frame sparse representation, our adaptive dictionary learning algorithm achieves better performance than K-SVD dictionary learning algorithm in terms of computation cost. And our method produces smaller reconstruction error as well.
Keyword:
Bilateral random projections (BRP)
Adaptive K-BRP algorithm
Dictionary learning
Sparse representation
K-SVD algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
暂无机构信息
引用论文
分享收藏A micromachined efficient parametric array loudspeaker with a wide radiation frequency band具有宽辐射频带的微机械高效参量阵列扬声器
PREAI
分享收藏Discriminative dictionary learning via Fisher discrimination K-SVD algorithm.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容