Laplace inversion of low‐resolution NMR relaxometry data using sparse representation methods. (29th May 2013)

• Record Type: Journal Article
• Authors: Berman, Paula; Levi, Ofer; Parmet, Yisrael; Saunders, Michael; Wiesman, Zeev
• Is Part Of: Concepts in magnetic resonance. Volume 42:Number 3(2013)
• Page Start: 72
• Page End: 88
• Publication Date: 2013-05-29
• Subjects: Magnetic resonance -- Periodicals; Nuclear magnetic resonance -- Periodicals; 538
• DOI: 10.1002/cmr.a.21263
• Languages: English
• ISSNs: 1546-6086

Abstract

<abstract abstract-type="main"> <title>ABSTRACT</title> <p>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 <italic>L</italic>₂‐norm regularization. However, sparse representation methods via <italic>L</italic>₁ 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 <italic>L</italic>₁ 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. © 2013 Wiley Periodicals, Inc. Concepts Magn Reson Part A 42A: 72–88, 2013.</p> </abstract>