arXiv subjects

Florian Knoll

Publications and source records attributed to Florian Knoll.

25 records · Page 2Linked to original sources

arXiv2019

Deep Learning Methods for Parallel Magnetic Resonance Image Reconstruction

Following the success of deep learning in a wide range of applications, neural network-based machine learning techniques have received interest as a means of accelerating magnetic resonance imaging (MRI). A number of ideas inspired by deep learning techniques from computer vision and image processing have been successfully applied to non-linear image reconstruction in the spirit of compressed sensing for both low dose computed tomography and accelerated MRI. The additional integration of multi-coil information to recover missing k-space lines in the MRI reconstruction process, is still studied less frequently, even though it is the de-facto standard for currently used accelerated MR acquisitions. This manuscript provides an overview of the recent machine learning approaches that have been proposed specifically for improving parallel imaging. A general background introduction to parallel MRI is given that is structured around the classical view of image space and k-space based methods. Both linear and non-linear methods are covered, followed by a discussion of recent efforts to further improve parallel imaging using machine learning, and specifically using artificial neural networks. Image-domain based techniques that introduce improved regularizers are covered as well as k-space based methods, where the focus is on better interpolation strategies using neural networks. Issues and open problems are discussed as well as recent efforts for producing open datasets and benchmarks for the community.

eess.SP↗

arXiv2018

Coupled regularization with multiple data discrepancies

We consider a class of regularization methods for inverse problems where a coupled regularization is employed for the simultaneous reconstruction of data from multiple sources. Applications for such a setting can be found in multi-spectral or multi-modality inverse problems, but also in inverse problems with dynamic data. We consider this setting in a rather general framework and derive stability and convergence results, including convergence rates. In particular, we show how parameter choice strategies adapted to the interplay of different data channels allow to improve upon convergence rates that would be obtained by treating all channels equally. Motivated by concrete applications, our results are obtained under rather general assumptions that allow to include the Kullback-Leibler divergence as data discrepancy term. To simplify their application to concrete settings, we further elaborate several practically relevant special cases in detail. To complement the analytical results, we also provide an algorithmic framework and source code that allows to solve a class of jointly regularized inverse problems with any number of data discrepancies. As concrete applications, we show numerical results for multi-contrast MR and joint MR-PET reconstruction.

math.OC↗

arXiv2018

Multicompartment Magnetic Resonance Fingerprinting

Magnetic resonance fingerprinting (MRF) is a technique for quantitative estimation of spin-relaxation parameters from magnetic-resonance data. Most current MRF approaches assume that only one tissue is present in each voxel, which neglects the tissue's microstructure, and may lead to artifacts in the recovered parameter maps at boundaries between tissues. In this work, we propose a multicompartment MRF model that accounts for the presence of multiple tissues per voxel. The model is fit to the data by iteratively solving a sparse linear inverse problem at each voxel, in order to express the magnetization signal as a linear combination of a few fingerprints in the precomputed dictionary. Thresholding-based methods commonly used for sparse recovery and compressed sensing do not perform well in this setting due to the high local coherence of the dictionary. Instead, we solve this challenging sparse-recovery problem by applying reweighted-l1-norm regularization, implemented using an efficient interior-point method. The proposed approach is validated with simulated data at different noise levels and undersampling factors, as well as with a controlled phantom imaging experiment on a clinical magnetic-resonance system.

physics.med-ph↗

arXiv2017

Learning a Variational Network for Reconstruction of Accelerated MRI Data

Purpose: To allow fast and high-quality reconstruction of clinical accelerated multi-coil MR data by learning a variational network that combines the mathematical structure of variational models with deep learning. Theory and Methods: Generalized compressed sensing reconstruction formulated as a variational model is embedded in an unrolled gradient descent scheme. All parameters of this formulation, including the prior model defined by filter kernels and activation functions as well as the data term weights, are learned during an offline training procedure. The learned model can then be applied online to previously unseen data. Results: The variational network approach is evaluated on a clinical knee imaging protocol. The variational network reconstructions outperform standard reconstruction algorithms in terms of image quality and residual artifacts for all tested acceleration factors and sampling patterns. Conclusion: Variational network reconstructions preserve the natural appearance of MR images as well as pathologies that were not included in the training data set. Due to its high computational performance, i.e., reconstruction time of 193 ms on a single graphics card, and the omission of parameter tuning once the network is trained, this new approach to image reconstruction can easily be integrated into clinical workflow.

cs.CV↗

arXiv2016

Low Rank Alternating Direction Method of Multipliers Reconstruction for MR Fingerprinting

Purpose The proposed reconstruction framework addresses the reconstruction accuracy, noise propagation and computation time for Magnetic Resonance Fingerprinting (MRF). Methods Based on a singular value decomposition (SVD) of the signal evolution, MRF is formulated as a low rank inverse problem in which one image is reconstructed for each singular value under consideration. This low rank approximation of the signal evolution reduces the computational burden by reducing the number of Fourier transformations. Also, the low rank approximation improves the conditioning of the problem, which is further improved by extending the low rank inverse problem to an augmented Lagrangian that is solved by the alternating direction method of multipliers (ADMM). The root mean square error and the noise propagation are analyzed in simulations. For verification, in vivo examples are provided. Results The proposed low rank ADMM approach shows a reduced root mean square error compared to the original fingerprinting reconstruction, to a low rank approximation alone and to an ADMM approach without a low rank approximation. Incorporating sensitivity encoding allows for further artifact reduction. Conclusion The proposed reconstruction provides robust convergence, reduced computational burden and improved image quality compared to other MRF reconstruction approaches evaluated in this study.

physics.med-ph↗

arXiv2015

Preconditioned ADMM with nonlinear operator constraint

We are presenting a modification of the well-known Alternating Direction Method of Multipliers (ADMM) algorithm with additional preconditioning that aims at solving convex optimisation problems with nonlinear operator constraints. Connections to the recently developed Nonlinear Primal-Dual Hybrid Gradient Method (NL-PDHGM) are presented, and the algorithm is demonstrated to handle the nonlinear inverse problem of parallel Magnetic Resonance Imaging (MRI).

math.NA↗

arXiv2014

Fast T2 Mapping with Improved Accuracy Using Undersampled Spin-echo MRI and Model-based Reconstructions with a Generating Function

A model-based reconstruction technique for accelerated T2 mapping with improved accuracy is proposed using undersampled Cartesian spin-echo MRI data. The technique employs an advanced signal model for T2 relaxation that accounts for contributions from indirect echoes in a train of multiple spin echoes. An iterative solution of the nonlinear inverse reconstruction problem directly estimates spin-density and T2 maps from undersampled raw data. The algorithm is validated for simulated data as well as phantom and human brain MRI at 3 T. The performance of the advanced model is compared to conventional pixel-based fitting of echo-time images from fully sampled data. The proposed method yields more accurate T2 values than the mono-exponential model and allows for undersampling factors of at least 6. Although limitations are observed for very long T2 relaxation times, respective reconstruction problems may be overcome by a gradient dampening approach. The analytical gradient of the utilized cost function is included as Appendix.

physics.med-ph↗