Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

H. J. Landau, “Necessary density conditions for sampling and interpolation of certain entire functions,” Acta Math. , vol. 117, no. 1, pp. 37–52, 1967

1967

Earlier work this paper cites.

R. A. Horn and C. R. Johnson, Matrix Analysis . New York, NY: Cambridge Press, 1985

1985

Earlier work this paper cites.

S. G. Mallat and Z. Zhang, “Matching pursuits and time-frequency dictionaries,” IEEE Trans. Sig. Proc. , vol. 41, no. 12, pp. 3397–3415, Dec. 1993

1993

Earlier work this paper cites.

R. A. DeVore and V. N. Temlyakov, “Some remarks on greedy algorithms,” Adv. in Comp. Math. , vol. 5, pp. 173–187, 1996

1996

Earlier work this paper cites.

G. Davis, S. Mallat, and M. Avellaneda, “Adaptive greedy approximations,” Constr. Approx. , vol. 13, no. 1, pp. 57–98, 1997

1997

Earlier work this paper cites.

S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Sci. Comput. , vol. 20, no. 1, pp. 33–61, 1999

1999

Earlier work this paper cites.

D. L. Donoho and X. Huo, “Uncertainty principles and ideal atomic decompositions,” IEEE Trans. Inf. Theory , vol. 47, no. 7, pp. 2845–2862, Nov. 2001

2001

Earlier work this paper cites.

M. Elad and A. M. Bruckstein, “A generalized uncertainty principle and sparse representation in pairs of bases,” IEEE Trans. Inf. Theory , vol. 48, no. 9, pp. 2558–2567, Sept. 2002

2002

Earlier work this paper cites.

D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 l^{1} minimization,” Proc. Natl. Acad. Sci. , vol. 100, no. 5, pp. 2197–2202, Mar. 2003

2003

Earlier work this paper cites.

T. Strohmer and R. W. Heath Jr., “Grassmannian frames with applications to coding and communication,” Applied and Computational Harmonic Analysis , vol. 14, pp. 257–275, 2003

Original

2003

Earlier work this paper cites.

B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, “Least angle regression,” Ann. Statist. , vol. 32, no. 2, pp. 407–499, 2004

2004

Earlier work this paper cites.

J. Tropp, “Greed is good: Algorithmic results for sparse approximation,” IEEE Trans. Inf. Theory , vol. 50, no. 10, pp. 2231–2242, Oct. 2004

2004

Cited alongside, same era.

E. J. Candès and T. Tao, “Decoding by linear programming,” IEEE Trans. Inf. Theory , vol. 51, no. 12, pp. 4203–4215, Dec. 2005

2005

Cited alongside, same era.

S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, “Sparse solutions to linear inverse problems with multiple measurement vectors,” IEEE Trans. Sig. Proc. , vol. 53, no. 7, pp. 2477–2488, Jul. 2005

2005

Cited alongside, same era.

E. J. Candès, J. K. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006

2006

Cited alongside, same era.

D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006

F. Parvaresh, H. Vikalo, S. Misra, and B. Hassibi, “Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays,” IEEE Journal of Selected Topics in Signal Processing , vol. 2, no. 3, pp. 275–285, Jun. 2008

2008

Later among the works it cites.

M. Mishali and Y. C. Eldar, “Reduce and boost: Recovering arbitrary sets of jointly sparse vectors,” IEEE Trans. Sig. Proc. , vol. 56, no. 10, pp. 4692–4702, Oct. 2008

2008

Later among the works it cites.

Y. M. Lu and M. N. Do, “Sampling signals from a union of subspaces,” IEEE Sig. Proc. Mag. , vol. 25, no. 2, pp. 41–47, Mar. 2008

2008

Later among the works it cites.

R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, “Model-based compressive sensing,” IEEE Trans. Inf. Theory , 2008, submitted

2008

Later among the works it cites.