Atoms of All Channels, Unite! Average Case Analysis of Multi-Channel Sparse Recovery Using Greedy Algorithms

Baraniuk, R., Davenport, M., DeVore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constr. Approx. (to appear)

Baron, D., Duarte, M., Sarvotham, S., Wakin, M., Baraniuk, R.: An information-theoretic approach to distributed compressed sensing. In: Proc. 45rd Conference on Communication, Control, and Computing (2005)

Baron, D., Wakin, M., Duarte, M., Sarvotham, S., Baraniuk, R.: Distributed compressed sensing. Preprint (2005)

Candès, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207–1223 (2006)

Candes, E., Tao, T.: Near optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inf. Theory 52(12), 5406–5425 (2006)

Chen, J., Huo, X.: Sparse representations for multiple measurement vectors (MMV) in an over-complete dictionary. In: International Conference on Acoustics, Speech and Signal Processing (ICASSP-2005) (2005)

Chen, J., Huo, X.: Theoretical results on sparse representations of multiple measurement vectors. IEEE Trans. Signal Process. 54(12), 4634–4643 (2006)

DeVore, R., Lorentz, G.: Constructive Approximation. Springer, Berlin (1993)

Donoho, D., Elad, M.: Maximal sparsity representation via l 1 minimization. Proc. Nat. Acad. Sci. 100(4), 369–388 (2003)

Donoho, D., Elad, M., Temlyakov, V.: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inf. Theory 52(1), 6–18 (2006)

Donoho, D., Vetterli, M., DeVore, R.A., Daubechies, I.: Data compression and harmonic analysis. IEEE Trans. Inf. Theory 44, 391–432 (1998)

Gribonval, R., Nielsen, M.: Beyond sparsity: Recovering structured representations by l1 minimization and greedy algorithms. Publication interne 1684, IRISA, Rennes (2005)

Gribonval, R., Nielsen, M., Vandergheynst, P.: Towards an adaptive computational strategy for sparse signal approximation. Preprint of the Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA) (2006)

Grimmett, G.R., Stirzaker, D.R.: Probability and Random Processes. Oxford University Press, London (2001)

Ledoux, M.: The Concentration of Measure Phenomenon. Am. Math. Soc., Providence (2001)

Ledoux, M., Talagrand, M.: Probability in Banach Spaces. Isoperimetry and Processes. Springer, Berlin (1991)

Luo, Z., Gaspar, M., Liu, J., Swami, A.: Distributed signal processing in sensor networks. IEEE Signal Process. Mag. 23(4), 14–15 (2006)

Rauhut, H.: Stability results for random sampling of sparse trigonometric polynomials. IEEE Trans. Inf. Theory (to appear)

Rauhut, H., Schnass, K., Vandergheynst, P.: Compressed sensing and redundant dictionaries. IEEE Trans. Inf. Theory 54(5), 2210–2219 (2008)

Rudelson, M., Vershynin, R.: Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. In: Proc. CISS 2006 (40th Annual Conference on Information Sciences and Systems) (2006)

Schnass, K., Vandergheynst, P.: Average Performance Analysis for Thresholding. IEEE Signal Process. Lett. 14(11), 828–831 (2007)

Schnass, K., Vandergheynst, P.: Dictionary preconditioning for greedy algorithms. IEEE Trans. Signal Process. 56(5), 1994–2002 (2008)

Taubman, D., Marcellin, W.: JPEG2000: Image Compression Fundamentals, Standards, and Practice. Springer, Berlin (2002)

Tropp, J.: Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50(10), 2231–2242 (2004)

Tropp, J.: Topics in sparse approximation. Ph.D. Thesis, University of Texas at Austin (2004)

Tropp, J.: Just relax: Convex programming methods for subset selection and sparse approximation. IEEE Trans. Inf. Theory 51(3), 1030–1051 (2006)

Tropp, J.: On the conditioning of random subdictionaries. Appl. Comput. Harmon. Anal. 25, 1–24 (2008)

Tropp, J., Gilbert, A., Strauss, M.: Algorithms for simultaneous sparse approximations. Part I: Greedy pursuit. Signal Process. 86, 572–588 (2006). Special issue “Sparse approximations in signal and image processing”