Performance bounds on compressed sensing with poisson noise

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 174-178

  Willett, Rebecca M ^a   Raginsky, Maxim ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED NOISE; COMPRESSED SENSING; LIGHT IMAGING; LOG LIKELIHOOD; MATRIX; NOISE MODELS; OBJECTIVE FUNCTIONS; PENALTY TERM; PERFORMANCE BOUNDS; POISSON DATA; POISSON NOISE; SPARSE APPROXIMATIONS;

INFORMATION THEORY; POISSON DISTRIBUTION; SIGNAL RECONSTRUCTION;

POISSON EQUATION;

EID: 70449499636     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205258     Document Type: Conference Paper

References (16)

1. E. J. Candés and T. Tao, "Near-optimal signal recovery from random projections: universal encoding strategies?" IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5406-5425, 2006.
2. D. Donoho, "Compressed sensing," IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
3. E. Candés, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Communications on Pure and Applied Mathematics, vol. 59, no. 8, pp. 1207-1223, 2006.
4. J. Haupt and R. D. Nowak, "Signal reconstruction from noisy random projections," IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 4036-4048, 2006.
5. D. L. Snyder, A. M. Hammond, and R. L. White, "Image recovery from data acquired with a charge-coupled-device camera," J. Opt. Soc. Amer. A, vol. 10, pp. 1014-1023, 1993.
6. E. J. Candés and T. Tao, "Decoding by linear programming," IEEE Trans. Inform. Theory, vol. 15, no. 12, pp. 4203-4215, 2005.
7. J. A. Tropp, "Just relax: convex programming methods for identifying sparse signals in noise," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1030-1051, 2006.
8. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Statist. Soc. Ser. B, vol. 58, no. 1, pp. 267-288, 1996.
9. W. Dai and O. Milenkovic, "Weighted superimposed codes and constrained integer compressive sensing," IEEE Trans. Inform. Theory, vol. 55, no. 5, pp. 2215-2229, May 2009.
10. M. A. Khajehnejad, A. G. Dimakis, W. Xu, and B. Hassibi, "Sparse recovery of positive signals with minimal expansion," 2009, submitted.
11. S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, "Reconstruction and subgaussian operators in asymptotic geometric analysis," Geom. Funct. Anal., vol. 17, pp. 1248-1282, 2007.
12. I. Csiszár, "Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems," Annals of Stat., vol. 19, no. 4, pp. 2032-2066, 1991.
13. Q. Li and A. Barron, "Mixture density estimation," in Advances in Neural Information Processing, vol. 12. MIT Press, 2000.
14. E. Kolaczyk and R. Nowak, "Multiscale likelihood analysis and complexity penalized estimation," Annals of Stat., vol. 32, pp. 500-527, 2004.
15. Y. Censor and S. A. Zenios, Parallel Optimization: Theory, Algorithms, and Applications. Oxford Univ. Press, 1997.
16. M. Gehm, R. John, D. Brady, R. Willett, and T. Schultz, "Single-shot compressive spectral imaging with a dual-disperser architecture," Optics Express, vol. 15, no. 21, pp. 14 013-14 027, 2007.