Close Search Advanced
Journals
Resources
About Us
Open Access

One-Bit Compressed Sensing by Greedy Algorithms

One-Bit Compressed Sensing by Greedy Algorithms
Preview
Add to basket

Year:    2016

Numerical Mathematics: Theory, Methods and Applications, Vol. 9 (2016), Iss. 2 : pp. 169–184

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 unconstrained subproblem at each iteration. Numerical experiments show that STrMP is fast and accurate for one-bit compressed sensing compared with other algorithms.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/nmtma.2016.m1428

Numerical Mathematics: Theory, Methods and Applications, Vol. 9 (2016), Iss. 2 : pp. 169–184

Published online:    2016-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    16

Keywords:   

  1. Adaptive Iterative Hard Thresholding for Least Absolute Deviation Problems with Sparsity Constraints

    Li, Song | Liu, Dekai | Shen, Yi

    Journal of Fourier Analysis and Applications, Vol. 29 (2023), Iss. 1

    https://doi.org/10.1007/s00041-022-09984-w [Citations: 4]

  2. One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints

    Liu, Dekai | Li, Song | Shen, Yi

    IEEE Transactions on Information Theory, Vol. 65 (2019), Iss. 10 P.6650

    https://doi.org/10.1109/TIT.2019.2922328 [Citations: 12]

  3. Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions

    Guo, Ling | Liu, Yongle | Yan, Liang

    Numerical Mathematics: Theory, Methods and Applications, Vol. 10 (2017), Iss. 4 P.775

    https://doi.org/10.4208/nmtma.2017.0001 [Citations: 1]

  4. Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares

    Huang, Jian | Jiao, Yuling | Lu, Xiliang | Zhu, Liping

    SIAM Journal on Scientific Computing, Vol. 40 (2018), Iss. 4 P.A2062

    https://doi.org/10.1137/17M1154102 [Citations: 19]

  5. Improved bounds for universal one-bit compressive sensing

    Acharya, Jayadev | Bhattacharyya, Arnab | Kamath, Pritish

    2017 IEEE International Symposium on Information Theory (ISIT), (2017), P.2353

    https://doi.org/10.1109/ISIT.2017.8006950 [Citations: 12]

  6. Greedy Algorithms for Hybrid Compressed Sensing

    Tai, Ching-Lun | Hsieh, Sung-Hsien | Lu, Chun-Shien

    IEEE Signal Processing Letters, Vol. 27 (2020), Iss. P.2059

    https://doi.org/10.1109/LSP.2020.3037732 [Citations: 0]

  7. Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements

    Chen, Canyi | Zhu, Liping

    Journal of Computational and Graphical Statistics, Vol. 32 (2023), Iss. 3 P.884

    https://doi.org/10.1080/10618600.2022.2118751 [Citations: 1]

  8. Just Least Squares: Binary Compressive Sampling with Low Generative Intrinsic Dimension

    Jiao, Yuling | Li, Dingwei | Liu, Min | Lu, Xiliang | Yang, Yuanyuan

    Journal of Scientific Computing, Vol. 95 (2023), Iss. 1

    https://doi.org/10.1007/s10915-023-02158-w [Citations: 0]