One-bit compressed sensing by greedy algorithms

DOI10.4208/NMTMA.2016.M1428MaRDI QIDQ5282643zbMATH OpenOpenAlexFDO

Authors

Publication date 14 July 2017

Published in Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

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

zbMATH Keywords

compressed sensinggreedy algorithmsparse signals

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Sign truncated matching pursuit (STrMP) algorithm is presented in this paper. STrMP is a new greedy algorithm for the recovery of sparse signals from the sign measurement, which combines the principle of consistent reconstruction with orthogonal matching pursuit (OMP). The main part of STrMP is as concise as OMP and hence STrMP is simple to implement. In contrast to previous greedy algorithms for one-bit compressed sensing, STrMP only need to solve a convex and unconstraint subproblem at each iteration. Numerical experiments show that STrMP is fast and accurate for one-bit compressed sensing compared with other algorithms.

Recommendations

• One-bit compressed sensing by linear programming
• One-bit compressive sensing of dictionary-sparse signals
• 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 with non-Gaussian measurements

Cited in

(8)

• Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
• Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
• NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
• Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
• Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements
• Just least squares: binary compressive sampling with low generative intrinsic dimension
• Robust decoding from binary measurements with cardinality constraint least squares

This page was built for publication: One-bit compressed sensing by greedy algorithms

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