By Topic

Greedy sparse signal reconstruction from sign measurements

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Petros T. Boufounos ; Mitsubishi Electric Research Laboratories, Cambridge, MA 02139, USA

This paper presents Matched Sign Pursuit (MSP), a new greedy algorithm to perform sparse signal reconstruction from signs of signal measurements, i.e., measurements quantized to 1-bit. The algorithm combines the principle of consistent reconstruction with greedy sparse reconstruction. The resulting MSP algorithm has several advantages, both theoretical and practical, over previous approaches. Although the problem is not convex, the experimental performance of the algorithm is significantly better compared to reconstructing the signal by treating the quantized measurement as values. Our results demonstrate that combining the principle of consistency with a sparsity prior outperforms approaches that use only consistency or only sparsity priors.

Published in:

2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers

Date of Conference:

1-4 Nov. 2009