Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
Abstract
Keywords
MSC codes
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In

Copyright
History
Keywords
MSC codes
Authors
Funding Information
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuitSampling Theory, Signal Processing, and Data Analysis, Vol. 23, No. 1 | 10 February 2025
- Robust censored regression with $$\ell _1$$-norm regularizationTEST, Vol. 32, No. 1 | 25 August 2022
- Robust instance-optimal recovery of sparse signals at unknown noise levelsInformation and Inference: A Journal of the IMA, Vol. 11, No. 3 | 4 August 2021
- Phase Transitions in Recovery of Structured Signals From Corrupted MeasurementsIEEE Transactions on Information Theory, Vol. 68, No. 7 | 1 Jul 2022
- Towards Optimal Sampling for Learning Sparse Approximations in High DimensionsHigh-Dimensional Optimization and Probability | 5 April 2022
- Phase Transitions in Recovery of Structured Signals from Corrupted Measurements2021 IEEE International Symposium on Information Theory (ISIT) | 12 Jul 2021
- The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery GuaranteesIEEE Transactions on Signal Processing, Vol. 69 | 1 Jan 2021
- Iterative and greedy algorithms for the sparsity in levels model in compressed sensingWavelets and Sparsity XVIII | 9 Sep 2019
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].