Laplace inversion of low-resolution NMR relaxometry data using sparse representation methods

Paula Berman, Ofer Levi, Yisrael Parmet, Michael Saunders, Zeev Wiesman

Research output: Contribution to journalArticlepeer-review

88 Scopus citations

Abstract

Low-resolution nuclear magnetic resonance (LR-NMR) relaxometry is a powerful tool that can be harnessed for characterizing constituents in complex materials. Conversion of the relaxation signal into a continuous distribution of relaxation components is an ill-posed inverse Laplace transform problem. The most common numerical method implemented today for dealing with this kind of problem is based on L2-norm regularization. However, sparse representation methods via L1 regularization and convex optimization are a relatively new approach for effective analysis and processing of digital images and signals. In this article, a numerical optimization method for analyzing LR-NMR data by including non-negativity constraints and L1 regularization and by applying a convex optimization solver PDCO, a primal-dual interior method for convex objectives, that allows general linear constraints to be treated as linear operators is presented. The integrated approach includes validation of analyses by simulations, testing repeatability of experiments, and validation of the model and its statistical assumptions. The proposed method provides better resolved and more accurate solutions when compared with those suggested by existing tools.

Original languageEnglish
Pages (from-to)72-88
Number of pages17
JournalConcepts in Magnetic Resonance Part A: Bridging Education and Research
Volume42
Issue number3
DOIs
StatePublished - 1 May 2013

Keywords

  • Convex optimization
  • L regularization
  • Low-resolution NMR
  • Sparse reconstruction

ASJC Scopus subject areas

  • Spectroscopy

Fingerprint

Dive into the research topics of 'Laplace inversion of low-resolution NMR relaxometry data using sparse representation methods'. Together they form a unique fingerprint.

Cite this