.png){kind=icon}
返回
Compressive Bayesian K-SVD
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2017.08.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Compressed Sensing (CS) is an established way to perform efficient dimensionality reduction during a signal's acquisition process. However, the common transform bases used in CS to represent a signal often lead to a compressible representation that is not optimal in terms of compactness. In this paper we present a novel dictionary learning algorithm designed to work with CS data. Following our approach, dictionaries learned directly from the signal's random projections are specifically suited to the signal class of interest, resulting in very sparse representations. Moreover, since the proposed method lays its foundation in a Bayesian dictionary learning algorithm, no prior information such as the signals' sparsity is needed because it is inferred directly from the data. We show the superiority of our approach by comparing it with a state-of-the-art CS dictionary learning algorithm. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Compressed sensing
Dictionary learning
Sparse representation
Classification
Bayesian inference
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
S
IF:
2.7
论文数:
2.8K
被引数:
4.2K
机构
引用论文
A micromachined efficient parametric array loudspeaker with a wide radiation frequency band具有宽辐射频带的微机械高效参量阵列扬声器
PREAI
分享收藏Potentiometric study of chloro complexes of some divalent transition metal cations in dimethyl sulphoxide at 25°C.png)
Polyhedron
PolyhedronIF0
PREAI
分享收藏
分享收藏
没有更多内容
没有更多内容