Sparse approximation, denoising, and large random frames

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5914, Issue , 2005, Pages 1-10

  Fletcher, Alyson K ^a   Rangan, Sundeep ^b   Goyal, Vivek K ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b QUALCOMM INC   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dictionary based representations; Estimation; Isotropic random matrices; Nonlinear approximation; Stable signal recovery; Subspace fitting

Indexed keywords

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; MATRIX ALGEBRA; NOISE ABATEMENT; SIGNAL TO NOISE RATIO;

DICTIONARY-BASED REPRESENTATIONS; ISOTROPIC RANDOM VARIABLES; NONLINEAR APPROXIMATION; SUBSPACE FITTING;

SIGNAL PROCESSING;

EID: 30844457729     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.615772     Document Type: Conference Paper

References (30)

1. R. J. Duffin and A. C. Schaeffer, "A class of nonharmonic Fourier series," Trans. Amer. Math. Soc. 72, pp. 341-366, 1952.
2. I. Daubechies, Ten Lectures on Wavelets, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992.
3. D. L. Donoho, M. Vetterli, R. A. DeVore, and I. Daubechies, "Data compression and harmonic analysis," IEEE Trans. Inform. Th. 44, pp. 2435-2476, Oct. 1998.
4. I. F. Gorodnitsky and B. D. Rao, "Sparse signal reconstruction from limited data using FOCUSS: A reweighted minimum norm algorithm," IEEE Trans. Signal Proc. 45, pp. 600-616, Mar. 1997.
5. D. M. Malioutov, M. Çetin, and A. S. Willsky, "Sparse signal reconstruction perspective for source localization with sensor arrays," IEEE Trans. Signal Proc., to appear.
6. A. K. Fletcher and K. Ramchandran, "Estimation error bounds for frame denoising," in Proc. Wavelets: Appl. in Sig. & Image Proc. X, part of SPIE Int. Symp. on Optical Sci. & Tech., 5207, pp. 40-46, (San Diego, CA), Aug. 2003.
7. A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," Electron. Res. Lab. Memo. M05/5, Univ. California, Berkeley, Sept. 2004.
8. A. K. Fletcher, "Estimation via sparse approximation: Error bounds and random frame analysis," Master's thesis, Univ. California, Berkeley, May 2005.
9. A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," EURASIP J. Appl. Sig. Proc., to appear 2005.
10. G. Davis, Adaptive Nonlinear Approximations. PhD thesis, New York Univ., Sept. 1994.
11. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Computing 24, pp. 227-234, Apr. 1995.
12. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Proc. 41, pp. 3397-3415, Dec. 1993.
13. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev. 43(1), pp. 129-159, 2001.
14. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inform. Th. 48, pp. 2558-2567, Sept. 2002.
15. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inform. Th. 49, pp. 3320-3325, Dec. 2003.
16. R. Gribonval and M. Nielsen, "Highly sparse representations from dictionaries are unique and independent of the sparseness measure," Tech. Rep. R-2003-16, Dept. Mathematical Sciences, Aalborg University, Oct. 2003.
17. 1 minimization," Proc. Nat. Acad. Sci. 100, pp. 2197-2202, Mar. 2003.
18. D. L. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inform. Th., submitted Feb. 2004.
19. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inform. Th. 50, pp. 2231-2242, Oct. 2004.
20. J. A. Tropp, "Just relax: Convex programming methods for subset selection and sparse approximation," ICES Report 0404, Univ. of Texas at Austin, Feb. 2004.
21. R. Gribonval and P. Vandergheynst, "On the exponential convergence of matching pursuits in quasiincoherent dictionaries," Tech. Rep. 1619, IRISA, Rennes, France, Apr. 2004.
22. 1 minimization and greedy algorithms - Application to the analysis of sparse underdetermined ICA," Tech. Rep. 1684, IRISA, Rennes, France, Jan. 2005.
23. N. Saito, "Simultaneous noise suppression and signal compression using a library of orthonormal bases and the minimum description length criterion," in Wavelets in Geophysics, E. Foufoula-Georgiou and P. Kumar, eds., pp. 299-324, Academic Press, San Diego, CA, 1994.
24. B. K. Natarajan, "Filtering random noise from deterministic signals via data compression," IEEE Trans. Signal Proc. 43, pp. 2595-2605, Nov. 1995.
25. H. Krim, D. Tucker, S. Mallat, and D. Donoho, "On denoising and best signal representation," IEEE Trans. Inform. Th. 45, pp. 2225-2238, Nov. 1999.
26. S. G. Chang, B. Yu, and M. Vetterli, "Adaptive wavelet thresholding for image denoising and compression," IEEE Trans. Image Proc. 9, pp. 1532-1546, Sept. 2000.
27. J. Liu and P. Moulin, "Complexity-regularized image denoising," IEEE Trans. Image Proc. 10, pp. 841-851, June 2001.
28. J. H. Conway, R. H. Hardin, and N. J. A. Sloane, "Packing lines, planes, etc.: Packings in Grassmannian spaces," Experimental Mathematics 5(2), pp. 139-159, 1996.
29. T. Strohmer and R. W. Heath Jr., "Grassmannian frames with applications to coding and communication," Appl. Comput. Harm. Anal. 14, pp. 257-275, May 2003.
30. N. J. A. Sloane, R. H. Hardin, and W. D. Smith, "A library of putatively optimal spherical codes, together with other arrangements which may not be optimal but are especially interesting for some reason." URL: http://www.research.att.com/~njas/packings.