Computer Science – Information Theory
Scientific paper
2010-07-14
Computer Science
Information Theory
revised version; accepted to IEEE Transactions on Signal Processing
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. We support our results with experimental demonstrations of reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arrivals of packets in each flow follow a Poisson process.
Calderbank Robert
Harmany Zachary
Jafarpour Sina
Marcia Roummel
Raginsky Maxim
No associations
LandOfFree
Performance bounds for expander-based compressed sensing in 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 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 Poisson noise will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-121157