返回
Sparsity estimation based adaptive matching pursuit algorithm
DOI:10.1007/s11042-016-4295-0.png)
摘要
En 中文
Compared with convex optimization algorithms and combination algorithms, greedy pursuit algorithms can balance operational efficiency and reconstruction precision, so they are widely used in the signal reconstruction step of compressed sensing. However, most existing greedy pursuit algorithms only work well if the signal sparsity is known, and their reconstruction performance is influenced by signal sparsity. To more accurately match the sparsity and obtain better reconstruction performance, we propose a greedy pursuit algorithm, the sparsity estimation based adaptive matching pursuit algorithm, which achieves image reconstruction using a signal sparsity estimation based on the Restricted Isometry Property (RIP) criterion and a flexible step size. Experimental results demonstrate that this algorithm provides better reconstruction performance and lower computation time, using different measurement matrices, when the sparsity is estimated in advance.
Keyword:
Image reconstruction
Matching pursuit
Sparsity estimation
Restricted Isometry Property
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
Neuronal Loss in the Developing Cerebral Cortex of Normal and Bax-Deficient Mice: Effects of Ethanol Exposure正常和 Bax-缺陷型小鼠发育中大脑皮层的神经元丢失:乙醇暴露的影响
Neuroscience
IF0
Hydrolysis of Dinucleoside Monophosphates Containing Arabinose in Various Internucleotide Linkages by Exonuclease from the Venom of Crotalus adamanteus*
Biochemistry
IF0

