Compressed Sensing Performance Bounds Under Poisson Noise

DOI10.1109/TSP.2010.2049997MaRDI QIDQ4570422zbMATH OpenOpenAlexFDO

Authors Maxim Raginsky, Rebecca Willett, Zachary Harmany, Roummel F. Marcia

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0910.5146

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

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 $el{l}_2$--$el{l}_1$ 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.

Recommendations

• Performance Bounds for Expander-Based Compressed Sensing in Poisson Noise
• On the Achievability of Cramér–Rao Bound in Noisy Compressed Sensing
• Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling
• Information Theoretic Bounds for Compressed Sensing
• Shannon-Theoretic Limits on Noisy Compressive Sampling
• Compressed sensing and -quantization
• The Noise-Sensitivity Phase Transition in Compressed Sensing
• A Probabilistic and RIPless Theory of Compressed Sensing
• Corrections to “Asymptotic Achievability of the Cramér–Rao Bound for Noisy Compressive Sampling” [Mar 09 1233-1236]
• Snapshot Compressed Sensing: Performance Bounds and Algorithms

Cited in

(25)

• High dimensional generalized linear models for temporal dependent data
• Characterization of maximum likelihood solutions to image reconstruction in photon emission tomography
• Sparse Poisson regression with penalized weighted score function
• Recovery error analysis of noisy measurement in compressed sensing
• A variable metric forward-backward method with extrapolation
• On some steplength approaches for proximal algorithms
• Compressive imaging and characterization of sparse light deflection maps
• Signal recovery and system calibration from multiple compressive Poisson measurements
• A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography
• Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling
• A Useful Performance Metric for Compressed Channel Sensing
• Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing
• Performance Limits of Segmented Compressive Sampling: Correlated Measurements Versus Bits
• Mathematical methods in biomedical imaging
• Convergence of inexact forward-backward algorithms using the forward-backward envelope
• Dimensionality reduction with subgaussian matrices: a unified theory
• Variance-stabilization-based compressive inversion under Poisson or Poisson–Gaussian noise with analytical bounds
• Compressive imaging through optical fiber with partial speckle scanning
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
• Debiased Lasso under Poisson-Gauss model
• Inexact proximal methods for weakly convex functions
• Low-rank matrix completion with Poisson observations via nuclear norm and total variation constraints
• Theoretical analysis for support recovery with \(\frac{\ell_1}{\ell_p}\) based on mutual coherence
• Unbiased test error estimation in the Poisson means problem via coupled bootstrap techniques
• Optimal dual certificates for noise robustness bounds in compressive sensing

This page was built for publication: Compressed Sensing Performance Bounds Under Poisson Noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570422)