Fast Compressed Sensing of 3D Radial T[sub.1] Mapping with Different Sparse and Low-Rank Models

• Published in: Journal of imaging Vol. 9; no. 8
• Main Authors: Paajanen, Antti, Hanhela, Matti, Hänninen, Nina, Nykänen, Olli, Kolehmainen, Ville, Nissi, Mikko J
• Format: Journal Article
• Language: English
• Published: MDPI AG 01.07.2023
• Subjects: Data compression; Image processing; Magnetic resonance imaging; Methods; Finland
• ISSN: 2313-433X; 2313-433X
• DOI: 10.3390/jimaging9080151

Knowledge of the relative performance of the well-known sparse and low-rank compressed sensing models with 3D radial quantitative magnetic resonance imaging acquisitions is limited. We use 3D radial T[sub.1] relaxation time mapping data to compare the total variation, low-rank, and Huber penalty function approaches to regularization to provide insights into the relative performance of these image reconstruction models. Simulation and ex vivo specimen data were used to determine the best compressed sensing model as measured by normalized root mean squared error and structural similarity index. The large-scale compressed sensing models were solved by combining a GPU implementation of a preconditioned primal-dual proximal splitting algorithm to provide high-quality T[sub.1] maps within a feasible computation time. The model combining spatial total variation and locally low-rank regularization yielded the best performance, followed closely by the model combining spatial and contrast dimension total variation. Computation times ranged from 2 to 113 min, with the low-rank approaches taking the most time. The differences between the compressed sensing models are not necessarily large, but the overall performance is heavily dependent on the imaged object.