Fast ℓ1 minimization by iterative thresholding for multidimensional NMR spectroscopy

Eurasip Journal on Advances in Signal Processing

Volumn 2007, Issue , 2007, Pages

  Drori, Iddo ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE RECONSTRUCTION; ITERATIVE METHODS; LARGE SCALE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; WAVELET TRANSFORMS;

ITERATIVE THRESHOLDING; MULTIDIMENSIONAL SPECTROSCOPY; SPARSESTSOLUTION; WAVELET REPRESENTATION;

NUCLEAR MAGNETIC RESONANCE SPECTROSCOPY;

EID: 36949033181     PISSN: 16876172     EISSN: 16876180     Source Type: Journal    
DOI: 10.1155/2007/20248     Document Type: Article

References (46)

1. S. Kim T. Szyperski szypersk@chem.buffalo.edu GFT NMR, a new approach to rapidly obtain precise high-dimensional NMR spectral information. Journal of the American Chemical Society 125 5 2003 1385 1393
2. M. Mobli A. S. Stern J. C. Hoch hoch@uchc.edu Spectral reconstruction methods in fast NMR: reduced dimensionality, random sampling and maximum entropy. Journal of Magnetic Resonance 182 1 2006 96 105
3. D. Rovnyak D. P. Frueh M. Sastry Accelerated acquisition of high resolution triple-resonance spectra using non-uniform sampling and maximum entropy reconstruction. Journal of Magnetic Resonance 170 1 2004 15 21
4. P. Schmieder A. S. Stern G. Wagner J. C. Hoch Application of nonlinear sampling schemes to COSY-type spectra. Journal of Biomolecular NMR 3 5 1993 569 576
5. P. Schmieder A. S. Stern G. Wagner J. C. Hoch Improved resolution in triple-resonance spectra by nonlinear sampling in the constant-time domain. Journal of Biomolecular NMR 4 4 1994 483 490
6. I. Drori idrori@tau.ac.il D. Cohen-Or dcor@tau.ac.il H. Yeshurun hezy@tau.ac.il Fragment-based image completion. ACM Transactions on Graphics (TOG) 22 3 2003 303 312
7. I. Drori idrori@tau.ac.il D. Lischinski danix@cs.huji.ac.il Fast multiresolution image operations in the wavelet domain. IEEE Transactions on Visualization and Computer Graphics 9 3 2003 395 411
8. A. C. Gilbert S. Guha P. Indyk S. Muthukrishnan M. Strauss Near-optimal sparse Fourier representations via sampling. Proceedings on 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada 2002 152 161
9. D. L. Donoho donoho@stanford.edu Compressed sensing. IEEE Transactions on Information Theory 52 4 2006 1289 1306
10. E. J. Candès emmanuel@acm.caltech.edu J. Romberg jrom@acm.caltech.edu T. Tao tao@math.ucla.edu Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory 52 2 2006 489 509
11. E. Berlekamp R. McEliece H. van Tilborg On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24 3 1978 384 386
12. S. S. Chen schen@watson.ibm.com D. L. Donoho donoho@stat.stanford.edu M. A. Saunders mike@SOL-Michael.stanford.edu Atomic decomposition by basis pursuit. SIAM Journal of Scientific Computing 20 1 1998 33 61
13. D. L. Donoho donoho@stanford.edu For most large underdetermined systems of equations, the minimal ℓ1-norm near-solution approximates the sparsest near-solution. Communications on Pure and Applied Mathematics 59 7 2006 907 934
14. B. Efron brad@stat.stanford.edu T. Hastie I. Johnstone R. Tibshirani Least angle regression. The Annals of Statistics 32 2 2004 407 499
15. R. Tibshirani Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society 58 1996 1 267 288
16. D. L. Donoho donoho@stanford.edu M. Elad elad@cs.technion.ac.il V. N. Temlyakov temlyak@math.sc.edu Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory 52 1 2006 6 18
17. D. L. Donoho X. Huo Uncertainty principles and ideal atomic decomposition. IEEE Transactions on Information Theory 47 7 2001 2845 2862
18. D. L. Donoho Y. Tsaig Fast solution of ℓ1-norm minimization problems when the solution may be sparse. Department of Statistics, Stanford University Stanford, Calif, USA 2006-18 2006
19. M. A. Saunders B. Kim PDCO: primal-dual interior method for convex objectives. http://www.stanford.edu/group/SOL/software/pdco.html
20. Y. Ye Interior Point Algorithms: Theory and Analysis. John Wiley & Sons New York, NY, USA 1997
21. M. Lustig D. L. Donoho J. M. Pauly Rapid MR imaging with compressed sensing and randomly under-sampled 3DFT trajectories. Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM '06) Seattle, Wash, USA 2006
22. M. Lustig J. M. Santos D. L. Donoho J. M. Pauly Rapid MR angiography with randomly under-sampled 3DFT trajectories and non-linear reconstruction. Proceedings of the 9th Annual Scientific Sessions of the Society for Cardiovascular Magnetic Resonance (SCMR '06) Miami, Fla, USA 2006
23. M. Lustig J. M. Santos J.-H. Lee D. L. Donoho J. M. Pauly Compressed sensing for rapid MR imaging. Proceedings of the Signal Processing with Adaptative Sparse Structured Representations (SPARS '05) Rennes, France 2005
24. D. L. Donoho B. F. Logan Signal recovery and the large sieve. SIAM Journal on Applied Mathematics 52 2 1992 577 591
25. E. J. Candès emmanuel@acm.caltech.edu T. Tao tao@math.ucla.edu Decoding by linear programming. IEEE Transactions on Information Theory 51 12 2005 4203 4215
26. M. Rudelson rudelson@math.missouri.edu R. Vershynin vershynin@math. ucdavis.edu Geometric approach to error-correcting codes and reconstruction of signals. International Mathematics Research Notices 2005 2005 4019 4041
27. I. Drori V. C. Stodden E. H. Hurowitz Fast ℓ1 minimization for genome-wide analysis of mRNA lengths. Proceedings of the IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS '06) College Station, Tex, USA 2006 19 20
28. R. Freeman rf110@cus.cam.ac.uk E. Kupče New methods for fast multidimensional NMR. Journal of Biomolecular NMR 27 2 2003 101 114
29. D. Malmodin M. Billeter martin.billeter@chem.gu.se High-throughput analysis of protein NMR spectra. Progress in Nuclear Magnetic Resonance Spectroscopy 46 2-3 2005 109 129
30. J. C. Hoch A. S. Stern NMR Data Processing. John Wiley & Sons New York, NY, USA 1996
31. S. Hiller F. Fiorito K. Wüthrich wuthrich@mol.biol.ethz.ch G. Wider Automated projection spectroscopy (APSY). Proceedings of the National Academy of Sciences of the United States of America 102 31 2005 10876 10881
32. E. Kupče R. Freeman rf110@hermes.cam.ac.uk Fast reconstruction of four-dimensional NMR spectra from plane projections. Journal of Biomolecular NMR 28 4 2004 391 395
33. V. Y. Orekhov orov@nmr.se I. Ibraghimov M. Billeter Optimizing resolution in multidimensional NMR by three-way decomposition. Journal of Biomolecular NMR 27 2 2003 165 173
34. D. L. Donoho Y. Tsaig I. Drori J.-L. Starck Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit. Department of Statistics, Stanford University Stanford, Calif, USA 2006-02 2006
35. S. Sardy A. G. Bruce P. Tseng Block coordinate relaxation methods for nonparametric wavelet denoising. Journal of Computational and Graphical Statistics 9 2000 2 361 379
36. S. Sardy A. G. Bruce P. Tseng Robust wavelet denoising. IEEE Transactions on Signal Processing 49 6 2001 1146 1152
37. I. Daubechies ingrid@math.princeton.edu M. Defrise mdefrise@minf.vub.ac. be C. De Mol demol@ulb.ac.be An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics 57 11 2004 1413 1457
38. M. Elad elad@cs.technion.ac.il Why simple shrinkage is still relevant for redundant representations? IEEE Transactions on Information Theory 52 12 2006 5559 5569
39. M. Elad B. Matalon M. Zibulevsky Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization. Journal on Applied and Computational Harmonic Analysis 2006
40. M. A. T. Figueiredo mtf@lx.it.pt R. D. Nowak nowak@rice.edu An EM algorithm for wavelet-based image restoration. IEEE Transactions on Image Processing 12 8 2003 906 916
41. M. A. T. Figueiredo R. D. Nowak A bound optimization approach to wavelet-based image deconvolution. Proceedings of the IEEE International Conference on Image Processing (ICIP '05) Genova, Italy 2 2005 782 785
42. C. C. Paige M. A. Saunders LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software (TOMS) 8 1982 1 43 71
43. Y. C. Pati R. Rezaiifar P. S. Krishnaprasad Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. Proceedings of the 27th Asilomar Conference on Signals, Systems & Computers Pacific Grove, Calif, USA 1 1993 40 44
44. J. A. Tropp jtropp@umich.edu Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory 50 10 2004 2231 2242
45. P. T. Lee J. Li M. R. Chapman SESAME: an experiment management system for biomolecularNMR. http://www.sesame.wisc.edu
46. I. Daubechies CBMS-NSF Regional Conference Series in Applied Mathematics Ten Lectures on Wavelets. SIAM Philadelphia, Pa, USA 1994