Performance bounds on compressed sensing with Poisson noise

Details Performance bounds on compressed sensing with Poisson noise Performance bounds on compressed sensing with Poisson noise

2009-01-13

arxiv.org/abs/0901.1900v3

Computer Science

Information Theory

5 pages; to appear in Proc. ISIT 2009

Scientific paper

This paper describes performance bounds for compressed sensing in the presence of Poisson noise when the underlying signal, a vector of Poisson intensities, is sparse or compressible (admits a sparse approximation). The signal-independent and bounded noise models used in the literature to analyze the performance of compressed sensing do not accurately model the effects of Poisson noise. However, Poisson noise is an appropriate noise model for a variety of applications, including low-light imaging, where sensing hardware is large or expensive, and limiting the number of measurements collected is important. In this paper, we describe how a feasible positivity-preserving sensing matrix can be constructed, and then analyze the performance of a compressed sensing reconstruction approach for Poisson data that minimizes an objective function consisting of a negative Poisson log likelihood term and a penalty term which could be used as a measure of signal sparsity.

Affiliated with

Also associated with

No associations

Rating

Performance bounds on compressed sensing with 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 on compressed sensing with Poisson noise, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance bounds on compressed sensing with Poisson noise will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-374605