Computer Science – Information Theory
Scientific paper
2009-11-06
Computer Science
Information Theory
Received the best student paper award in Asilomar 2009
Scientific paper
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.
Calderbank Robert
Jafarpour Sina
Raginsky Maxim
Willett Rebecca
No associations
LandOfFree
Performance Bounds for Expander-based Compressed Sensing in the presence of Poisson Noise does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Performance Bounds for Expander-based Compressed Sensing in the presence of Poisson Noise, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance Bounds for Expander-based Compressed Sensing in the presence of Poisson Noise will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-699337