A short note on compressed sensing with partially known signal support

DOI10.1016/j.sigpro.2010.05.025zbMath1197.94063arXiv0908.0660OpenAlexW1978885364MaRDI QIDQ1957941

Laurent Jacques

Publication date: 27 September 2010

Published in: Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationinstance optimalitycompressed sensingsparse signal recovery

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property, Recovery analysis for block ℓp − ℓ1 minimization with prior support information, Model selection via reweighted partial sparse recovery, On phaseless compressed sensing with partially known support, Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support, Stable recovery of weighted sparse signals from phaseless measurements via weighted l₁ minimization, A tight bound of modified iterative hard thresholding algorithm for compressed sensing., Interpolation via weighted \(\ell_{1}\) minimization, Partial \(S\)-goodness for partially sparse signal recovery, Restricted \(p\)-isometry properties of partially sparse signal recovery, Recovery of signals under the condition on RIC and ROC via prior support information, Robust recovery of signals with partially known support information using weighted BPDN, Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\), Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing, Optimality analysis on partial \(l_1\)-minimization recovery, Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization, New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization, Sufficient conditions for the uniqueness of solution of the weighted norm minimization problem, Uniqueness Conditions for A Class of ℓ₀-Minimization Problems, Robust signal recovery for ℓ _1–2 minimization via prior support information, Weighted $\ell_p$-Minimization for Sparse Signal Recovery under Arbitrary Support Prior, Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information

Uses Software

• PDCO
• CoSaMP

Cites Work

• Unnamed Item
• The restricted isometry property and its implications for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Compressed sensing and best 𝑘-term approximation
• Decoding by Linear Programming
• Atomic Decomposition by Basis Pursuit
• Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing