DrZ.ac

@article{raginsky-tsp2011-expanderpoissoncs,

  doi = {10.1109/TSP.2011.2157913},

  arxiv = {1007.2377},

  title = {Performance bounds for expander-based compressed sensing in Poisson noise},

  author = {Raginsky, Maxim and Jafarpour, Sina and Harmany, Zachary T. and Marcia, Roummel F. and Willett, Rebecca M. and Calderbank, Robert},

  journal = {IEEE Transactions on Signal Processing},

  volume = {59},

  number = {9},

  month = {sep},

  year = {2011},

  pages = {4139–4153},

  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 maximum a posteriori (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.}

}