Data-time tradeoffs for optimal k-thresholding algorithms in quantized compressed sensing
Open Access
- 3 January 2025
- journal article
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Mathematica
- Vol. 55 (2) , 343
Abstract
松弛最优阈值(ROT)算法是压缩感知中的一种新的阈值技术, 用于从少量带噪线性测量中高效恢复稀疏信号, 克服了传统硬阈值算法由于残差函数振荡导致的缺点. 本文考虑一种新颖的数据时间权衡分析, 以说明在任何固定恢复精度下, 松弛最优阈值算法在压缩感知、量化压缩感知还原信号过程中测量数量和迭代次数之间的权衡. 理论结果还给出了在压缩感知、量化压缩感知中实现信号恢复所需的有效测量阶数. 最后, 通过数字实验也展示了ROT算法在稀疏重建问题中的数据时间权衡.Keywords
This publication has 42 references indexed in Scilit:
- Hard thresholding pursuit algorithms: Number of iterationsApplied and Computational Harmonic Analysis, 2016
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraintsApplied and Computational Harmonic Analysis, 2013
- An Invitation to Compressive Sensing2013
- Sobolev Duals for Random Frames and ΣΔ Quantization of Compressed Sensing MeasurementsFoundations of Computational Mathematics, 2012
- Frame permutation quantizationApplied and Computational Harmonic Analysis, 2011
- Iterative hard thresholding for compressed sensingApplied and Computational Harmonic Analysis, 2009
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samplesApplied and Computational Harmonic Analysis, 2009
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- Iterative thresholding algorithmsApplied and Computational Harmonic Analysis, 2008
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004