Compressed sensing performance bounds under Poisson noise
Maxim Raginsky, Rebecca M. Willett, Zachary T. Harmany, Roummel F., Marcia

TL;DR
This paper establishes performance bounds for compressed sensing with Poisson noise, addressing the challenges of non-additive, signal-dependent noise and practical measurement constraints, and analyzing how reconstruction error behaves with signal intensity and measurements.
Contribution
It introduces a feasible positivity-preserving sensing matrix and analyzes the reconstruction error bounds for Poisson noise, highlighting how error scales with signal intensity and measurement count.
Findings
Error bounds decay with increasing signal intensity for fixed measurements.
Signal-dependent error component grows with the number of measurements at fixed intensity.
Constructed sensing matrices adhere to physical constraints like nonnegativity and flux preservation.
Abstract
This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative intensities whose measurements are corrupted by Poisson noise. In this setting, standard CS techniques cannot be applied directly for several reasons. First, the usual signal-independent and/or bounded noise models do not apply to Poisson noise, which is non-additive and signal-dependent. Second, the CS matrices typically considered are not feasible in real optical systems because they do not adhere to important constraints, such as nonnegativity and photon flux preservation. Third, the typical -- minimization leads to overfitting in the high-intensity regions and oversmoothing in the low-intensity areas. In this paper, we describe how a feasible positivity- and flux-preserving sensing matrix can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
