1-bit Hamming compressed sensing
- 1 July 2012
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1862-1866
- https://doi.org/10.1109/isit.2012.6283603
Abstract
Compressed sensing (CS) and 1-bit CS cannot directly recover quantized signals preferred in digital systems and require time consuming recovery. In this paper, we introduce 1-bit Hamming compressed sensing (HCS) that directly recovers a k-bit quantized signal of dimension n from its 1-bit measurements via invoking n times of Kullback-Leibler divergence based nearest neighbor search. Compared to CS and 1-bit CS, 1-bit HCS allows the signal to be dense, takes considerably less (linear and non-iterative) recovery time and requires substantially less measurements. Moreover, 1-bit HCS can accelerate 1bit CS recover. We study a quantized recovery error bound of 1-bit HCS for general signals. Extensive numerical simulations verify the appealing accuracy, robustness, efficiency and consistency of 1-bit HCS.Keywords
Other Versions
This publication has 12 references indexed in Scilit:
- Compressed labeling on distilled labelsets for multi-label learningMachine Learning, 2012
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive MeasurementsIEEE Transactions on Signal Processing, 2011
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and ImagesSIAM Review, 2009
- The Dantzig selector: Statistical estimation when p is much larger than nThe Annals of Statistics, 2007
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?IEEE Transactions on Information Theory, 2006
- Compressed sensingIEEE Transactions on Information Theory, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006
- Error correction via linear programmingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995