Binary Matrices for Compressed Sensing

DOI10.1109/TSP.2017.2757915MaRDI QIDQ4621516zbMATH OpenFDO

Authors Weizhi Lu, Tao Dai, Shutaong Xia

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2017.2757915

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
• Sparsification of matrices and compressed sensing
• A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
• Compressive Sensing and Recovery for Binary Images
• Compressed Sensing Matrices From Fourier Matrices
• Deterministic constructions of compressed sensing matrices
• Fast binary embeddings and quantized compressed sensing with structured matrices
• Compressive sensing and structured random matrices
• Compressed sensing of low-rank plus sparse matrices

Cited in

(7)

• Bipolar measurement matrix using chaotic sequence
• Recovering low-rank matrices from binary measurements
• Deterministic convolutional compressed sensing matrices
• Chaotic Binary Sensing Matrices
• Binned Progressive Quantization for Compressive Sensing
• Non-Cartesian spiral binary sensing matrices
• Reconstruction of binary matrices under fixed size neighborhood constraints

This page was built for publication: Binary Matrices for Compressed Sensing

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