Local recovery bounds for prior support constrained compressed sensing

DOI10.1134/S0001434622010102MaRDI QIDQ2113400zbMATH OpenOpenAlexFDO

Authors K. Z. Najiya, Munnu Sonkar, C. S. Sastry

Publication date 14 March 2022

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.01082

zbMATH Keywords

compressed sensingprior supportweighted 1-norm minimizationlocal recovery guarantees

Mathematics Subject Classification ID

Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for integral transforms (65R10) Sampling theory in information and communication theory (94A20)

Abstract: Prior support constrained compressed sensing has of late become popular due to its potential for applications. The existing results on recovery guarantees provide global recovery bounds in the sense that they deal with full support. However, in some applications, one might be interested in the recovery guarantees limited to the given prior support, such bounds may be termed as local recovery bounds. The present work proposes the local recovery guarantees and analyzes the conditions on associated parameters that make recovery error small.

Recommendations

• On oracle-type local recovery guarantees in compressed sensing
• Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
• Globally sparse and locally dense signal recovery for compressed sensing
• Compressive Sensing With Prior Information: Requirements and Probabilities of Reconstruction in 𝓁₁- Minimization
• Compressed sensing recovery via nonconvex shrinkage penalties
• Compressive sensing using locality-preserving matrices
• Compressive Sensing via Nonlocal Low-Rank Regularization
• Compressed Sensing With Prior Information: Strategies, Geometry, and Bounds
• A hierarchical framework for recovery in compressive sensing

Cites work

• A convolution back projection algorithm for local tomography
• A remark on compressed sensing
• Decoding by Linear Programming
• Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
• Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
• Recovering Compressively Sampled Signals Using Partial Support Information
• Recovery of signals under the condition on RIC and ROC via prior support information
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Stable Recovery of Sparse Signals and an Oracle Inequality
• Uncertainty principles and ideal atomic decomposition
• Wavelet methods for a weighted sparsity penalty for region of interest tomography

Cited in

(4)

• The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery Guarantees
• Interior reconstruction in tomography via prior support constrained compressed sensing
• A Measurement Rate-MSE Tradeoff for Compressive Sensing Through Partial Support Recovery
• \(AdaTL_1\): an adaptive non-convex sparse solver with applications to CT reconstruction and image denoising

This page was built for publication: Local recovery bounds for prior support constrained compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113400)