Performance Bounds for Expander-Based Compressed Sensing in Poisson Noise
From MaRDI portal
Abstract: 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.
Cited in
(6)- High dimensional generalized linear models for temporal dependent data
- Noise tolerance of expanders and sublinear expansion reconstruction
- Signal recovery and system calibration from multiple compressive Poisson measurements
- Compressed Sensing Performance Bounds Under Poisson Noise
- Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing
- Adaptive control and signal processing literature survey (No. 27)
This page was built for publication: Performance Bounds for Expander-Based Compressed Sensing in Poisson Noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573160)