Fetching the paper…
Reading the bibliography…
This paper provides performance bounds for compressed sensing in the presence of Poisson noise using expander graphs.
P. McCullagh and J. Nelder, Generalized Linear Models , 2nd ed. London: Chapman and Hall, 1989
1989
Earlier work this paper cites.
D. Bertsekas and R. Gallager, Data Networks . Prentice-Hall, 1992
1992
Earlier work this paper cites.
D. Snyder, A. Hammond, and R. White, “Image recovery from data acquired with a charge-coupled-device camera.” J. Opt. Soc. Amer. A , vol. 10, pp. 1014–1023, 1993
1993
Earlier work this paper cites.
M. Sipser and D. Spielman, “Expander Codes,” IEEE Trans. Inform. Theory , vol. 42, no. 6, pp. 1710–1722, 1996
1996
Earlier work this paper cites.
W. Fang and L. Peterson, “Inter-AS traffic patterns and their implications,” in Proc. IEEE GLOBECOM , 1999
1999
Earlier work this paper cites.
N. Alon and J. Spencer, The Probabilistic Method . Wiley-Interscience, 2000
2000
Earlier work this paper cites.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, “Deriving traffic demands for operational IP networks: methodology and experience,” in Proc. ACM SIGCOMM , 2000
2000
Earlier work this paper cites.
L. Wasserman, All of Statistics: A Concise Course in Statistical Inference . Springer, 2003
2003
Earlier work this paper cites.
C. Estan and G. Varghese, “New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice,” ACM Trans. Computer Sys. , vol. 21, no. 3, pp. 270–313, 2003
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
F. Parvaresh and A. Vardy, “Correcting errors beyond the Guruswami-Sudan radius in polynomial time,” Proc. 46th Ann. IEEE Symp. on Foundations of Computer Science (FOCS) , pp. 285–294, 2005
2005
Earlier work this paper cites.
E. Candès and J. Romberg, “ ℓ 1 \ell_{1} -MAGIC: Recovery of Sparse Signals via Convex Programming,” available at http://www.acm.caltech.edu/l1magic , 2005
2005
Earlier work this paper cites.
D. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory , vol. 52, no. 4, pp. 1289–1306, April 2006
2006
Earlier work this paper cites.
E. Candès, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Commun. Pure Appl. Math. , vol. 59, no. 8, pp. 1207–1223, 2006
2006
Cited alongside, same era.
E. 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, December 2006
2006
Cited alongside, same era.
E. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory , vol. 52, no. 2, pp. 489–509, 2006
2006
Cited alongside, same era.
S. Hoory, N. Linial, and A. Wigderson, “Expander Graphs and their Applications,” Bull. Amer. Math. Soc. (New Series) , vol. 43, 2006
2006
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. Wiley, 2006
R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, “Combining geometry and combinatorics: a unified approach to sparse signal recovery,” in Proc. Allerton Conf. , September 2008, pp. 798–805
2008
Later among the works it cites.
I. Rish and G. Grabarnik, “Sparse signal recovery with exponential-family noise,” in Allerton Conference on Communication, Control, and Computing , 2009
2009
Later among the works it cites.
L. Jacques, D. K. Hammond, and M. J. Fadili, “Dequantizing compressed sensing with non-gaussian constraints,” in Proc. of ICIP’09 , 2009
2009
Later among the works it cites.
J. N. Laska, M. A. Davenport, and R. G. Baraniuk, “Exact signal recovery from sparsely corrupted measurements through the pursuit of justice,” in 43rd Asilomar Conference on Signals, Systems and Computers , 2009
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
J. Tropp and A. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Trans. Inform. Theory , vol. 53, no. 12, pp. 4655–4666, December 2007
2007
Cited alongside, same era.
V. Guruswami, C. Umans, and S. Vadhan., “Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes.” IEEE Conference on Computational Complexity (CCC) , 2007
2007
Cited alongside, same era.
R. Berinde and P. Indyk, “Sparse recovery using sparse random matrices,” Technical Report, MIT , 2008
2008
Cited alongside, same era.
R. Berinde, P. Indyk, and M. Ruzic, “Practical near-optimal sparse recovery in the ℓ 1 \ell_{1} norm,” 46th Annual Allerton Conf. on Comm., Control, and Computing , 2008
2008
Cited alongside, same era.
R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, “Combining geometry and combinatorics: a unified approach to sparse signal recovery.” 46th Annual Allerton Conference on Communication, Control, and Computing , pp. 798–805, September 2008
2008
Cited alongside, same era.
P. Indyk and M. Ruzic, “Near-optimal sparse recovery in the ℓ 1 \ell 1 norm,” Proc. 49th Ann. IEEE Symp. on Foundations of Computer Science (FOCS) , pp. 199–207, 2008
2008
Cited alongside, same era.
V. Guruswami, J. Lee, and A. Razborov, “Almost euclidean subspaces of ℓ 1 \ell_{1} via expander codes,” Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp. 353–362, January 2008
2008
Cited alongside, same era.
R. Willett and M. Raginsky, “Performance bounds on compressed sensing with Poisson noise,” in Proc. IEEE Int. Symp. on Inform. Theory , Seoul, Korea, Jun/Jul 2009, pp. 174–178
2009
Later among the works it cites.
S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank, “Efficient and robust compressed sensing using optimized expander graphs,” IEEE Trans. Inform. Theory , vol. 55, no. 9, pp. 4299–4308, September 2009
2009
Later among the works it cites.
Z. Harmany, R. Marcia, and R. Willett, “Sparse Poisson intensity reconstruction algorithms,” in Proc. IEEE Stat. Sig. Proc. Workshop , 2009
2009
Later among the works it cites.
M. A. Khajehnejad, A. G. Dimakis, W. Xu, and B. Hassibi, “Sparse recovery of positive signals with minimal expansion,” Submitted , 2009
2009
Later among the works it cites.
R. Berinde and P. Indyk, “Sequential Sparse Matching Pursuit,” Allerton , 2009
2009
Later among the works it cites.
R. E. Carrillo, K. E. Barner, and T. C. Aysal, “Robust sampling and reconstruction methods for sparse signals in the presence of impulsive noise,” IEEE Journal of Selected Topics in Signal Processing , vol. 4, no. 2, pp. 392–408, 2010
2010
Closest in time.
M. Raginsky, Z. Harmany, R. Marcia, and R. Willett, “Compressed sensing performance bounds under Poisson noise,” IEEE Trans. Signal Process. , vol. 58, pp. 3990–4002, August 2010
2010
Closest in time.
M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 1.21,” http://cvxr.com/cvx
2011
Closest in time.