Performance Bounds for Expander-based Compressed Sensing in the presence of Poisson Noise
Authors:
Preprint
Abstract
This paper provides performance bounds for compressed sensing in the presence of Poisson noise using expander graphs. The Poisson noise model is appropriate for a variety of applications, including low-light imaging and digital streaming, where the signal-independent and/or bounded noise models used in the compressed sensing literature are no longer applicable. In this paper, we develop a novel sensing paradigm based on expander graphs and propose a MAP algorithm for recovering sparse or compressible signals from Poisson observations. The geometry of the expander graphs and the positivity of the corresponding sensing matrices play a crucial role in establishing the bounds on the signal reconstruction error of the proposed algorithm. The geometry of the expander graphs makes them provably superior to random dense sensing matrices, such as Gaussian or partial Fourier ensembles, for the Poisson noise model. We support our results with experimental demonstrations.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Compressed Sensing Performance Bounds Under Poisson NoiseIEEE Transactions on Signal Processing, 2010
- Efficient and Robust Compressed Sensing Using Optimized Expander GraphsIEEE Transactions on Information Theory, 2009
- Practical near-optimal sparse recovery in the L1 norm2008
- Toeplitz-Structured Compressed Sensing Matrices2007
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Image recovery from data acquired with a charge-coupled-device cameraJournal of the Optical Society of America A, 1993