Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
From MaRDI portal
Abstract: We study the problem of reconstructing a sparse signal from a limited number of its linear projections when a part of its support is known, although the known part may contain some errors. The ``known" part of the support, denoted T, may be available from prior knowledge. Alternatively, in a problem of recursively reconstructing time sequences of sparse spatial signals, one may use the support estimate from the previous time instant as the ``known" part. The idea of our proposed solution (modified-CS) is to solve a convex relaxation of the following problem: find the signal that satisfies the data constraint and is sparsest outside of T. We obtain sufficient conditions for exact reconstruction using modified-CS. These are much weaker than those needed for compressive sensing (CS) when the sizes of the unknown part of the support and of errors in the known part are small compared to the support size. An important extension called Regularized Modified-CS (RegModCS) is developed which also uses prior signal estimate knowledge. Simulation comparisons for both sparse and compressible signals are shown.
Recommendations
- A short note on compressed sensing with partially known signal support
- On phaseless compressed sensing with partially known support
- Non-convex compressed sensing using partial support information
- A Measurement Rate-MSE Tradeoff for Compressive Sensing Through Partial Support Recovery
- Adaptive Compressed Sensing for Support Recovery of Structured Sparse Sets
- scientific article; zbMATH DE number 6907423
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Approximation-tolerant model-based compressive sensing
- Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling
- LS-CS-Residual (LS-CS): Compressive Sensing on Least Squares Residual
Cited in
(45)- Compressed sensing of data with a known distribution
- Recovery of signals under the condition on RIC and ROC via prior support information
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- A sparse signal reconstruction algorithm in wireless sensor networks
- Restricted \(p\)-isometry properties of partially sparse signal recovery
- A short note on compressed sensing with partially known signal support
- Sufficient conditions for the uniqueness of solution of the weighted norm minimization problem
- Local recovery bounds for prior support constrained compressed sensing
- On phaseless compressed sensing with partially known support
- New conditions on stable recovery of weighted sparse signals via weighted l₁ minimization
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
- Partial \(S\)-goodness for partially sparse signal recovery
- Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
- Off-the-grid recovery of piecewise constant images from few Fourier samples
- Video compressive sensing for spatial multiplexing cameras using motion-flow models
- Sharp MSE bounds for proximal denoising
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- A null-space-based weightedl1minimization approach to compressed sensing
- Single-frame signal recovery using a similarity-prior
- ORKA: Object reconstruction using a K-approximation graph
- Recovery analysis for block _p-_1 minimization with prior support information
- Robust recovery of signals with partially known support information using weighted BPDN
- Fast thresholding algorithms with feedbacks and partially known support for compressed sensing
- Image reconstruction using analysis model prior
- Video Compressive Sensing for Spatial Multiplexing Cameras Using Motion-Flow Models
- Uniqueness conditions for a class of \(\ell_{0}\)-minimization problems
- Robust signal recovery for \(\ell_{1-2}\) minimization via prior support information
- Weighted _p-minimization for sparse signal recovery under arbitrary support prior
- Model selection via reweighted partial sparse recovery
- Sparse reconstruction via the mixture optimization model with iterative support estimate
- Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization
- A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
- Stable recovery of approximately block \(k\)-sparse signals with partial block support information via weighted \(\ell_2/\ell_p\) (\(0 < p \leq 1\)) minimization
- Effectiveness of the tail-atomic norm in gridless spectrum estimation
- AdaTL₁: an adaptive non-convex sparse solver with applications to CT reconstruction and image denoising
- Optimality analysis on partial l₁-minimization recovery
- Locality regularized reconstruction: structured sparsity and Delaunay triangulations
- Theoretical analysis of weighted \(\ell_1\) and \(\ell_{1-2}\)-minimization with multiple weighting sets
- A new analysis for support recovery of OLS and OMP with partial support information
- Resilient state recovery using prior measurement support information
- Uniform RIP bounds for recovery of signals with partial support information by weighted _p-minimization
- Recovery conditions in weighted sparse phase retrieval via weighted \(\ell_q\) (\(0<q\le 1\)) minimization
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Letter to the editor. The general tail-atomic norm for gridless spectral estimations-II
This page was built for publication: Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570497)
