Recovery of Binary Sparse Signals With Biased Measurement Matrices

DOI10.1109/TIT.2019.2929192MaRDI QIDQ5211560zbMATH OpenFDO

Authors Axel Flinth, Sandra Keiper

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Abstract: This work treats the recovery of sparse, binary signals through box-constrained basis pursuit using biased measurement matrices. Using a probabilistic model, we provide conditions under which the recovery of both sparse and saturated binary signals is very likely. In fact, we also show that under the same condition, the solution of the boxed-constrained basis pursuit program can be found using boxed-constrained least-squares.

Cited in

(2)

• Sparse recovery with integrality constraints
• Binary least squares: an algorithm for binary sparse signal recovery

This page was built for publication: Recovery of Binary Sparse Signals With Biased Measurement Matrices

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