1-bit compressive sensing: reformulation and RRSP-based sign recovery theory

DOI10.1007/s11425-016-5153-2zbMath1349.90617arXiv1412.5514OpenAlexW2963319894MaRDI QIDQ341409

ChunLei Xu, Yun-bin Zhao

Publication date: 16 November 2016

Published in: Science China. Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear program\(\ell_0\)-minimization1-bit basis pursuit1-bit compressive sensingrestricted range space propertysparse signal recovery

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Sampling theory in information and communication theory (94A20)

Related Items

Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares ⋮ Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization ⋮ Stability of 1-bit compressed sensing in sparse data reconstruction ⋮ Stability analysis of a class of sparse optimization problems ⋮ Optimality analysis on partial \(l_1\)-minimization recovery ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction ⋮ Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems ⋮ Characterization of ℓ1 minimizer in one-bit compressed sensing

Cites Work

• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
• Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• One-bit compressed sensing with non-Gaussian measurements
• One-Bit Compressed Sensing by Linear Programming
• Certifying the Restricted Isometry Property is Hard
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Compressed sensing and best 𝑘-term approximation
• On Sparse Representations in Arbitrary Redundant Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• On Polar Polytopes and the Recovery of Sparse Representations
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
• Regime Change: Bit-Depth Versus Measurement-Rate in Compressive Sensing
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
• Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
• 1-Bit matrix completion
• A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• Binary Compressed Imaging
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory