Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy

DOI10.1155/2007/20248zbMath1168.94410OpenAlexW2071677464WikidataQ59213128 ScholiaQ59213128MaRDI QIDQ836250

Iddo Drori

Publication date: 1 September 2009

Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2007/20248

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (4)

Sparse signal recovery via non-convex optimization and overcomplete dictionaries ⋮ Analysis non-sparse recovery for relaxed ALASSO ⋮ A recursive sparse blind source separation method and its application to correlated data in NMR spectroscopy of biofluids ⋮ Analysis of inpainting via clustered sparsity and microlocal analysis

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Least angle regression. (With discussion)
• An EM algorithm for wavelet-based image restoration
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Signal Recovery and the Large Sieve
• On the inherent intractability of certain coding problems (Corresp.)
• Atomic Decomposition by Basis Pursuit
• Uncertainty principles and ideal atomic decomposition
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution

This page was built for publication: Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy