Optimal non-linear models for sparsity and sampling

Journal of Fourier Analysis and Applications

Volumn 14, Issue 5-6, 2008, Pages 793-812

  Aldroubi, Akram ^a   Cabrelli, Carlos ^b,c   Molter, Ursula ^b,c  

^a VANDERBILT UNIVERSITY   (United States)

^b UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^c Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

Author keywords

Compressed sensing; Frames; Sampling; Sparsity

Indexed keywords

EID: 57349099263     PISSN: 10695869     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00041-008-9040-2     Document Type: Article

References (28)

1. M. Aharon M. Elad A.M. Bruckstein 2006 The k-svd: An algorithm for designing of overcomplete dictionaries for sparse representation IEEE Trans. Signal Process. 54 11 4311 4322
2. M. Aharon M. Elad A.M. Bruckstein 2006 On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them Linear Algebra Appl. 416 1 48 67 MR2232919 (2007a:94026)
3. A. Aldroubi K.-H. Gröchenig 2001 Non-uniform sampling in shift-invariant space SIAM Rev. 43 4 585 620
4. A. Aldroubi C.A. Cabrelli D. Hardin U.M. Molter 2007 Optimal shift invariant spaces and their parseval frame generators Appl. Comput. Harmon. Anal. 23 273 283
5. Aldroubi, A., Cabrelli, C., Hardin, D.P., Molter, U., Rodado, E.: Determining sets of shift invariant spaces. In: Proceedings of ICWA (Chenai, India), 2003
6. Baraniuk, R., Davenport, M., DeVore, R.A., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constr. Approx. (2007). doi: 10.1007/s00365-007-9003-x
7. n ) J. Funct. Anal. 177 282 309
8. E. Candès J. Romberg 2006 Quantitative robust uncertainty principles and optimally sparse decompositions Found. Comput. Math. 6 227 254
9. E. Candès T. Tao 2006 Near optimal signal recovery from random projections: Universal encoding strategies IEEE Trans. Inf. Theory 52 5406 5425
10. E. Candès J. Romberg T. Tao 2006 Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inf. Theory 52 489 509
11. P.G. Casazza 2000 The art of frame theory Taiwan. J. Math. 4 2 129 201
12. Christensen, O.: An Introduction to Frames and Riesz Basis. Applied and Numerical Harmonic Analysis. Birkhäuser, Basel (2003)
13. R.A. DeVore 2007 Deterministic constructions of compressed sensing matrices J. Complex. 23 918 925
14. D.L. Donoho 2006 Compressed sensing IEEE Trans. Inf. Theory 52 1289 1306
15. P.L. Dragotti M. Vetterli T. Blu 2007 Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets strang-fix IEEE Trans. Signal Process. 55 1741 1757
16. C. Eckart G. Young 1936 The approximation of one matrix by another of lower rank Psychometrica 1 211 218
17. R. Gribonval M. Nielsen 2003 Sparse decompositions in unions of bases IEEE Trans. Inf. Theory 49 3320 3325
18. Gröchenig, K.: Foundations of Time-Frequency Analysis. Appl. Numer. Harmon. Anal. Birkhäuser, Basel (2001)
19. Hernández, E., Weiss, G.: A First Course on Wavelets. CRC Press, Boca Raton (1996)
20. Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press, Cambridge (1985)
21. Y. Lu M.N. Do 2008 A theory for sampling signals from a union of subspaces IEEE Trans. Signal Process. 56 2334 2345
22. Y. Ma H. Derksen W. Hong J. Wright 2007 Segmentation of multivariate mixed data via lossy coding and compression IEEE Trans. Pattern Anal. Mach. Intell. (PAMI) 29 9 1546 1562
23. Y. Ma A. Yang H. Derksen R. Fossum 2008 Estimation of subspace arrangements with applications in modeling and segmenting mixed data SIAM Rev. 50 413 458
24. I. Maravic M. Vetterli 2005 Sampling and reconstruction of signals with finite rate of innovation in the presence of noise IEEE Trans. Signal Process. 53 2788 2805
25. H. Rauhut K. Schass P. Vandergheynst 2008 Compressed sensing and redundant dictionaries IEEE Trans. Inf. Theory 4 2210 2219
26. E. Schmidt 1907 Zur theorie der linearen und nichtlinearen integralgleichungen. i teil. entwicklung willkürlichen funktionen nach system vorgeschriebener Math. Ann. 63 433 476
27. J.A. Tropp 2004 Greed is good: Algorithmic results for sparse approximation IEEE Trans. Inf. Theory 50 2231 2242
28. R. Vidal Y. Ma S. Sastry 2005 Generalized principal component analysis (gpca) IEEE Trans. Pattern Anal. Mach. Intell. 27 1 15