Compressed sensing performance bounds under Poisson noise
arXiv:0910.5146 · doi:10.1109/TSP.2010.2049997
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 constructed, and then analyze the performance of a CS reconstruction approach for Poisson data that minimizes an objective function consisting of a negative Poisson log likelihood term and a penalty term which measures signal sparsity. We show that, as the overall intensity of the underlying signal increases, an upper bound on the reconstruction error decays at an appropriate rate (depending on the compressibility of the signal), but that for a fixed signal intensity, the signal-dependent part of the error bound actually grows with the number of measurements or sensors. This surprising fact is both proved theoretically and justified based on physical intuition.
arXiv comment12 pages, 3 pdf figures; accepted for publication in IEEE Transactions on Signal Processing
References in corpus (5)
- A Proximal Decomposition Method for Solving Convex Variational Inverse Problems
- A proximal iteration for deconvolving Poisson noisy images using sparse representations
- Multiscale likelihood analysis and complexity penalized estimation
- Sparse Recovery of Positive Signals with Minimal Expansion
- Sparse Poisson Intensity Reconstruction Algorithms
Cited by in corpus (37)
- Generalized Orthogonal Matching Pursuit
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms - Theory and Practice
- LDPC Codes for Compressed Sensing
- Poisson Matrix Recovery and Completion
- Performance bounds for expander-based compressed sensing in Poisson noise
- Compressed Domain Image Classification Using a Dynamic-Rate Neural Network
- Subdiffraction incoherent optical imaging via spatial-mode demultiplexing: semiclassical treatment
- Noisy Matrix Completion under Sparse Factor Models
- Inference of High-dimensional Autoregressive Generalized Linear Models
- Phase retrieval from noisy data based on sparse approximation of object phase and amplitude
- Compressed Sensing with Linear Correlation Between Signal and Measurement Noise
- Dimensionality reduction with subgaussian matrices: a unified theory
- Minimax Optimal Sparse Signal Recovery with Poisson Statistics
- Estimating Unknown Sparsity in Compressed Sensing
- Various Compressed Sensing Set-Ups Evaluated Against Shannon Sampling Under Constraint of Constant Illumination
- Spatio-temporal Compressed Sensing with Coded Apertures and Keyed Exposures
- The Vector Poisson Channel: On the Linearity of the Conditional Mean Estimator
- Oracle-order Recovery Performance of Greedy Pursuits with Replacement against General Perturbations
- Sparse Signal Recovery under Poisson Statistics
- Poisson2Sparse: Self-Supervised Poisson Denoising From a Single Image
- Compressive Coded Aperture Keyed Exposure Imaging with Optical Flow Reconstruction
- Sparse Non-Negative Recovery from Biased Subgaussian Measurements using NNLS
- A data-dependent weighted LASSO under Poisson noise
- Extreme Compressed Sensing of Poisson Rates from Multiple Measurements
- A Geometric View on Constrained M-Estimators
- Sparse Poisson Regression with Penalized Weighted Score Function
- Performance Bounds for Expander-based Compressed Sensing in the presence of Poisson Noise
- Minimax optimal convex methods for Poisson inverse problems under -ball sparsity
- Compressive lensless endoscopy with partial speckle scanning
- Minimax Optimal Rates for Poisson Inverse Problems with Physical Constraints
- Reconstruction Error Bounds for Compressed Sensing under Poisson or Poisson-Gaussian Noise Using Variance Stabilization Transforms
- On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions
- A variable metric forward--backward method with extrapolation
- Dictionary Learning Phase Retrieval from Noisy Diffraction Patterns
- Fast Algorithm for Low-rank matrix recovery in Poisson noise
- Compressive Imaging and Characterization of Sparse Light Deflection Maps
- Greedy Sparse Signal Recovery with Tree Pruning