.png){kind=icon}
Return
Measurement Matrix Design for Sample-Efficient Binary Compressed Sensing
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2022.3179230.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter investigates the problem of recovering a binary-valued signal from compressed measurements of its convolution with a known finite impulse response filter. We show that it is possible to attain optimum sample complexity for exact recovery (in absence of noise) with a computationally efficient algorithm. We achieve this by adopting an algorithm-measurement co-design strategy where the measurement matrix is designed as a function of the filter, such that the recovery of binary signals with arbitrary sparsity is possible by using a sequential decoding algorithm. Such a filter-dependent sampler design can overcome the computational challenges associated with enforcing binary constraints, and enable us to operate in extreme compression regimes, where the number of measurements can be much smaller than the sparsity level.
Keywords:
Finite impulse response filters
Signal processing algorithms
Filtering algorithms
Decoding
Computational efficiency
Compressed sensing
Matching pursuit algorithms
Binary signals
compressed sensing
extreme compression
measurement matrix design
sequential decoding
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveReconstruction of Binary Shapes From Blurred Images via Hankel-Structured Low-Rank Matrix Recovery
PREAI
ShareSaveShareSaveShareSave
View more