Atomic decomposition by basis pursuit

SIAM Journal of Scientific Computing

Volumn 20, Issue 1, 1998, Pages 33-61

  Chen, Scott Shaobing ^a   Donoho, David L ^b   Saunders, Michael A ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Cosine packets; Denoising; Interior point methods for linear programming; L1 norm optimization; Matching pursuit; Overcomplete signal representation; Time frequency analysis; Time scale analysis; Wavelet packets; Wavelets

Indexed keywords

BASIS PURSUIT (BP); BEST ORTHOGONAL BASIS (BOB); INTERIOR-POINT METHODS; MATCHING PURSUIT (MP); METHOD OF FRAMES (MOF);

COMPUTATIONAL COMPLEXITY; DIGITAL SIGNAL PROCESSING; LINEAR PROGRAMMING; PROBLEM SOLVING; WAVELET TRANSFORMS;

WAVEFORM ANALYSIS;

EID: 0032131292     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596304010     Document Type: Article

References (40)

1. R. E. BIXBY, Commentary: Progress in linear programming, ORSA J. Comput., 6 (1994), pp. 15-22.
2. P. BLOOMFIELD AND W. STEIGER, Least Absolute Deviations: Theory, Applications, and Algorithms, Birkhauser, Boston, 1983.
3. J. BUCKHEIT AND D. L. DONOHO, WaveLab and reproducible research, in Wavelets and Statistics, A. Antoniadis, Ed., Springer, Berlin, New York, 1995.
4. S. S. CHEN, Basis Pursuit, Ph.D. Thesis, Department of Statistics, Stanford University, Stanford, CA, 1995 (http://www-stat.stanford.edu/̃schen/).
5. S. CHEN, S. A. BILLINGS, AND W. LUO, Orthogonal least squares methods and their application to non-linear system identification, Internat. J. Control, 50 (1989), pp. 1873-1896.
6. R. R. COIFMAN AND Y. MEYER, Remarques sur l'analyze de Fourier à Fenêtre, Comptes Rendus Acad. Sci. Paris (A), 312 (1991), pp. 259-261.
7. R. R. COIFMAN AND M. V. WICKERHAUSER, Entropy-based algorithms for best-basis selection, IEEE Trans. Inform. Theory, 38 (1992), pp. 713-718.
8. G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
9. I. DAUBECHIES, Time-frequency localization operators: A geometric phase space approach, IEEE Trans. Inform. Theory, 34 (1988), pp. 605-612.
10. I. DAUBECHIES, Ten Lectures on Wavelets, SIAM, Philadelphia, 1992.
11. G. DAVIS, S. MALLAT, AND Z. ZHANG, Adaptive time-frequency decompositions, Optical Engrg., 33 (1994), pp. 2183-2191.
12. R. A. DEVORE AND V. N. TEMLYAKOV, Some remarks on greedy algorithms, Adv. Comput. Math., 5 (1996), pp. 173-187.
13. D. L. DONOHO, De-Noising by soft thresholding, IEEE Trans. Inform. Theory, 41 (1995), pp. 613-627.
14. D. L. DONOHO AND I. M. JOHNSTONE, Ideal de-noising in an orthonormal basis chosen from a library of bases, C. R. Acad. Sci. Paris, Ser. I, 319 (1994), pp. 1317-1322.
15. D. L. DONOHO AND I. M. JOHNSTONE, Empirical Atomic Decomposition, manuscript, 1995.
16. D. L. DONOHO, I. M. JOHNSTONE, G. KERKYACHARIAN, AND D. PICARD, Wavelet shrinkage: Asymptopia? J. Roy. Statist. Soc., Ser. B, 57 (1995), pp. 301-369.
17. P. E. GILL, W. MURRAY, D. B. PONCELEÓN, AND M. A. SAUNDERS, Solving Reduced KKT Systems in Barrier Methods for Linear and Quadratic Programming, Tech. report SOL 91-7, Stanford University, Stanford, CA, July 1991.
18. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Numerical Linear Algebra and Optimization, Addison-Wesley, Redwood City, CA, 1991.
19. G. GOLUB AND C. V LOAN, Matrix Computations, 2nd ed. Johns Hopkins University Press, Baltimore, MD, 1989.
20. N. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 375-395.
21. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, Springer-Verlag, New York, 1989.
22. Y. LI AND F. SANTOSA, A computational algorithm for minimizing total variation in image restoration, IEEE Trans. Image Proc., 5 (1996), pp. 987-995.
23. I. J. LUSTIG, R. E. MARSTEN AND D. F. SHANNO, Interior point methods for linear programming: Computational state of the art, ORSA J. Comput., 6 (1994), pp. 1-14.
24. S. MALLAT AND W. L. HWANG, Singularity detection and processing with wavelets, IEEE Trans. Inform. Theory, 38 (1992), pp. 017-643.
25. S. MALLAT AND Z. ZHANG, Matching pursuit in a time-frequency dictionary, IEEE Trans. Signal Proc., 41 (1993), pp. 3397-3415.
26. S. MALLAT AND Z. ZHONG, Wavelet transform maxima and multiScale edges, in Ruskai et al., eds., Wavelet and their Applications, Jones and Bartlett, Boston, 1992.
27. N. MEGIDDO, On finding primal- and dual-optimal bases, ORSA J. Comput., 3 (1991), pp. 63-65.
28. Y. MEYER, Ondelettes sur l'intervalle, Rev. Mat. Iberoamericana, 7 (1991), pp. 115-134.
29. Y. MEYER, Wavelets: Algorithms and Applications, SIAM, Philadelphia, 1993.
30. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
31. L. J. RUDIN, S. OSHER, AND E. FATEMI, Nonlinear total-variation-based noise removal algorithms, Physica D, 60 (1992), pp. 259-268.
32. C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
33. C. C. PAIGE AND M. A. SAUNDERS, Algorithm 583; LSQR: Sparse linear equations and least-squares problems, ACM Trans. Math. Software, 8 (1982), pp. 195-209.
34. Y. C. PATI, R. REZAIIFAR, AND P. S. KRISHNAPRASAD, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, in Proc. 27th Asilomar Conference on Signals, Systems and Computers, A. Singh, ed., Los Alamitos, CA, USA IEEE Comput. Soc. Press, 1993.
35. SHIE QIAN AND DAPANG CHEN, Signal representation using adaptive normalized Gaussian functions, Signal Process., 36 (1994), pp. 1-11.
36. M. A. SAUNDERS, Commentary: Major Cholesky would feel proud, ORSA J. Comput., 6 (1994), pp. 23-27.
37. E. P. SIMONCELLI, W. T. FREEMAN, E. H. ADELSON, AND D. J. HEEGER, Shiftable multiscale transforms, IEEE Trans. Inform. Theory, 38 (1992), pp. 587-607.
38. M. J. TODD, Commentary: Theory and practice for interior point methods, ORSA J. Comput., 6 (1994), pp. 28-31.
39. R. J. VANDERBEI, Commentary: Interior point methods: Algorithms and formulations, ORSA J. Comput., 6 (1994), pp. 32-34.
40. L. F. VILLEMOES, Best Approximation with Walsh Atoms, Constr. Approx., 13 (1997), pp. 329-355.