IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v420y2022ics009630032100984x.html
   My bibliography  Save this article

Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs

Author

Listed:
  • Liang, Junying
  • Peng, Haipeng
  • Li, Lixiang
  • Tong, Fenghua
  • Yang, Yixian

Abstract

In signal processing, compressed sensing (CS) can be used to acquire and reconstruct sparse signals. This paper presents a method of combining vertical expansions and horizontal expansions to construct measurement matrices. Firstly, we give a construction of (n,n,n−1,n−1,n−2)-BIBD based on finite set. It is important to estimate recovery performance of measurement matrices in terms of coherence, and it is found that the incidence matrix H of (n,n,n−1,n−1,n−2)-BIBD is not suitable as a measurement matrix in CS. We present an optimal method of combining vertical expansions and horizontal expansions for addressing this problem. These two extensions provide a new perspective for the construction of measurement matrices. Vertical expansions ensure that the matrix has low coherence. Horizontal expansions ensure that the matrix is more suitable as a measurement matrix in CS because of sizes and coherence. Finally, compared with several typical matrices, our matrices have better recovery performance under OMP and IST by the simulation experiments.

Suggested Citation

  • Liang, Junying & Peng, Haipeng & Li, Lixiang & Tong, Fenghua & Yang, Yixian, 2022. "Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs," Applied Mathematics and Computation, Elsevier, vol. 420(C).
    • Handle: RePEc:eee:apmaco:v:420:y:2022:i:c:s009630032100984x
    DOI: 10.1016/j.amc.2021.126901
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032100984X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126901?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tong, Fenghua & Li, Lixiang & Peng, Haipeng & Yang, Yixian, 2020. "An effective algorithm for the spark of sparse binary measurement matrices," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    2. Wang, Gang & Niu, Min-Yao & Fu, Fang-Wei, 2019. "Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 128-136.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tong, Fenghua & Li, Lixiang & Peng, Haipeng & Yang, Yixian, 2020. "An effective algorithm for the spark of sparse binary measurement matrices," Applied Mathematics and Computation, Elsevier, vol. 371(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:420:y:2022:i:c:s009630032100984x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.