.png){kind=icon}
返回
Precise Undersampling Theorems
.png){kind=icon}
OA
AI
DOI：10.1109/JPROC.2010.2045630.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Undersampling theorems state that we may gather far fewer samples than the usual sampling theorem while exactly reconstructing the object of interest-provided the object in question obeys a sparsity condition, the samples measure appropriate linear combinations of signal values, and we reconstruct with a particular nonlinear procedure. While there are many ways to crudely demonstrate such under-sampling phenomena, we know of only one mathematically rigorous approach which precisely quantifies the true sparsity-undersampling tradeoff curve of standard algorithms and standard compressed sensing matrices. That approach, based on combinatorial geometry, predicts the exact location in sparsity-undersampling domain where standard algorithms exhibit phase transitions in performance. We review the phase transition approach here and describe the broad range of cases where it applies. We also mention exceptions and state challenge problems for future research. Sample result: one can efficiently reconstruct a k-sparse signal of length N from n measurements, provided n greater than or similar to 2k . log(N/n), for (k, n, N) large, k << N. AMS 2000 subject classifications. Primary: 41A46, 52A22, 52B05, 62E20, 68P30, 94A20; Secondary: 15A52, 60F10, 68P25, 90C25, 94B20.
Keyword:
Bandlimited measurements
compressed sensing
l(1)-minimization
random measurements
random polytopes
superresolution
undersampling
universality of matrix ensembles
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
25.9
论文数:
9.9K
被引数:
4.5W
机构
引用论文
Modelling of DNA Complexes with Distamycin Analogues Using an ab initio Continuum Solvent Model
PREAI
分享收藏Hydrolysis of Dinucleoside Monophosphates Containing Arabinose in Various Internucleotide Linkages by Exonuclease from the Venom of Crotalus adamanteus*.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容