Characterization of _1 minimizer in one-bit compressed sensing

DOI10.1142/S0219530519500131MaRDI QIDQ5236754zbMATH OpenOpenAlexFDO

Authors Ning Bi, Jun Tan

Publication date 10 October 2019

Published in Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219530519500131

zbMATH Keywords

sparse signalone-bit compressive sensing\(\ell_1\) minimizer

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Recommendations

• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• One-bit compressed sensing by linear programming
• Noisy 1-bit compressive sensing: models and algorithms
• Stability of 1-bit compressed sensing in sparse data reconstruction

Cites work

• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• A mathematical introduction to compressive sensing
• A simple proof of the restricted isometry property for random matrices
• Atomic Decomposition by Basis Pursuit
• Certifying the Restricted Isometry Property is Hard
• Compressed sensing
• Compressed sensing with coherent and redundant dictionaries
• Decoding by Linear Programming
• Iterative hard thresholding for compressed sensing
• Iteratively reweighted least squares minimization for sparse recovery
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Noisy 1-bit compressive sensing: models and algorithms
• One-bit compressed sensing by greedy algorithms
• One-bit compressed sensing by linear programming
• RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Sparse optimization theory and methods
• Sparse representations in unions of bases
• The bounds of restricted isometry constants for low rank matrices recovery
• The restricted isometry property and its implications for compressed sensing
• Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements

Cited in

(4)

• Stability of 1-bit compressed sensing in sparse data reconstruction
• A reliable iteration algorithm for one-bit compressive sensing on the unit sphere
• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: Characterization of \(\ell_1\) minimizer in one-bit compressed sensing

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