794 research outputs found
Simultaneous use of Individual and Joint Regularization Terms in Compressive Sensing: Joint Reconstruction of Multi-Channel Multi-Contrast MRI Acquisitions
Purpose: A time-efficient strategy to acquire high-quality multi-contrast
images is to reconstruct undersampled data with joint regularization terms that
leverage common information across contrasts. However, these terms can cause
leakage of uncommon features among contrasts, compromising diagnostic utility.
The goal of this study is to develop a compressive sensing method for
multi-channel multi-contrast magnetic resonance imaging (MRI) that optimally
utilizes shared information while preventing feature leakage.
Theory: Joint regularization terms group sparsity and colour total variation
are used to exploit common features across images while individual sparsity and
total variation are also used to prevent leakage of distinct features across
contrasts. The multi-channel multi-contrast reconstruction problem is solved
via a fast algorithm based on Alternating Direction Method of Multipliers.
Methods: The proposed method is compared against using only individual and
only joint regularization terms in reconstruction. Comparisons were performed
on single-channel simulated and multi-channel in-vivo datasets in terms of
reconstruction quality and neuroradiologist reader scores.
Results: The proposed method demonstrates rapid convergence and improved
image quality for both simulated and in-vivo datasets. Furthermore, while
reconstructions that solely use joint regularization terms are prone to
leakage-of-features, the proposed method reliably avoids leakage via
simultaneous use of joint and individual terms.
Conclusion: The proposed compressive sensing method performs fast
reconstruction of multi-channel multi-contrast MRI data with improved image
quality. It offers reliability against feature leakage in joint
reconstructions, thereby holding great promise for clinical use.Comment: 13 pages, 13 figures. Submitted for possible publicatio
Frequency-splitting Dynamic MRI Reconstruction using Multi-scale 3D Convolutional Sparse Coding and Automatic Parameter Selection
Department of Computer Science and EngineeringIn this thesis, we propose a novel image reconstruction algorithm using multi-scale 3D con- volutional sparse coding and a spectral decomposition technique for highly undersampled dy- namic Magnetic Resonance Imaging (MRI) data. The proposed method recovers high-frequency information using a shared 3D convolution-based dictionary built progressively during the re- construction process in an unsupervised manner, while low-frequency information is recovered using a total variation-based energy minimization method that leverages temporal coherence in dynamic MRI. Additionally, the proposed 3D dictionary is built across three different scales to more efficiently adapt to various feature sizes, and elastic net regularization is employed to promote a better approximation to the sparse input data. Furthermore, the computational com- plexity of each component in our iterative method is analyzed. We also propose an automatic parameter selection technique based on a genetic algorithm to find optimal parameters for our numerical solver which is a variant of the alternating direction method of multipliers (ADMM). We demonstrate the performance of our method by comparing it with state-of-the-art methods on 15 single-coil cardiac, 7 single-coil DCE, and a multi-coil brain MRI datasets at different sampling rates (12.5%, 25% and 50%). The results show that our method significantly outper- forms the other state-of-the-art methods in reconstruction quality with a comparable running time and is resilient to noise.ope
Robust Depth Linear Error Decomposition with Double Total Variation and Nuclear Norm for Dynamic MRI Reconstruction
Compressed Sensing (CS) significantly speeds up Magnetic Resonance Image
(MRI) processing and achieves accurate MRI reconstruction from under-sampled
k-space data. According to the current research, there are still several
problems with dynamic MRI k-space reconstruction based on CS. 1) There are
differences between the Fourier domain and the Image domain, and the
differences between MRI processing of different domains need to be considered.
2) As three-dimensional data, dynamic MRI has its spatial-temporal
characteristics, which need to calculate the difference and consistency of
surface textures while preserving structural integrity and uniqueness. 3)
Dynamic MRI reconstruction is time-consuming and computationally
resource-dependent. In this paper, we propose a novel robust low-rank dynamic
MRI reconstruction optimization model via highly under-sampled and Discrete
Fourier Transform (DFT) called the Robust Depth Linear Error Decomposition
Model (RDLEDM). Our method mainly includes linear decomposition, double Total
Variation (TV), and double Nuclear Norm (NN) regularizations. By adding linear
image domain error analysis, the noise is reduced after under-sampled and DFT
processing, and the anti-interference ability of the algorithm is enhanced.
Double TV and NN regularizations can utilize both spatial-temporal
characteristics and explore the complementary relationship between different
dimensions in dynamic MRI sequences. In addition, Due to the non-smoothness and
non-convexity of TV and NN terms, it is difficult to optimize the unified
objective model. To address this issue, we utilize a fast algorithm by solving
a primal-dual form of the original problem. Compared with five state-of-the-art
methods, extensive experiments on dynamic MRI data demonstrate the superior
performance of the proposed method in terms of both reconstruction accuracy and
time complexity
Accelerated Cardiac Diffusion Tensor Imaging Using Joint Low-Rank and Sparsity Constraints
Objective: The purpose of this manuscript is to accelerate cardiac diffusion
tensor imaging (CDTI) by integrating low-rankness and compressed sensing.
Methods: Diffusion-weighted images exhibit both transform sparsity and
low-rankness. These properties can jointly be exploited to accelerate CDTI,
especially when a phase map is applied to correct for the phase inconsistency
across diffusion directions, thereby enhancing low-rankness. The proposed
method is evaluated both ex vivo and in vivo, and is compared to methods using
either a low-rank or sparsity constraint alone. Results: Compared to using a
low-rank or sparsity constraint alone, the proposed method preserves more
accurate helix angle features, the transmural continuum across the myocardium
wall, and mean diffusivity at higher acceleration, while yielding significantly
lower bias and higher intraclass correlation coefficient. Conclusion:
Low-rankness and compressed sensing together facilitate acceleration for both
ex vivo and in vivo CDTI, improving reconstruction accuracy compared to
employing either constraint alone. Significance: Compared to previous methods
for accelerating CDTI, the proposed method has the potential to reach higher
acceleration while preserving myofiber architecture features which may allow
more spatial coverage, higher spatial resolution and shorter temporal footprint
in the future.Comment: 11 pages, 16 figures, published on IEEE Transactions on Biomedical
Engineerin
First order algorithms in variational image processing
Variational methods in imaging are nowadays developing towards a quite
universal and flexible tool, allowing for highly successful approaches on tasks
like denoising, deblurring, inpainting, segmentation, super-resolution,
disparity, and optical flow estimation. The overall structure of such
approaches is of the form ; where the functional is a data fidelity term also
depending on some input data and measuring the deviation of from such
and is a regularization functional. Moreover is a (often linear)
forward operator modeling the dependence of data on an underlying image, and
is a positive regularization parameter. While is often
smooth and (strictly) convex, the current practice almost exclusively uses
nonsmooth regularization functionals. The majority of successful techniques is
using nonsmooth and convex functionals like the total variation and
generalizations thereof or -norms of coefficients arising from scalar
products with some frame system. The efficient solution of such variational
problems in imaging demands for appropriate algorithms. Taking into account the
specific structure as a sum of two very different terms to be minimized,
splitting algorithms are a quite canonical choice. Consequently this field has
revived the interest in techniques like operator splittings or augmented
Lagrangians. Here we shall provide an overview of methods currently developed
and recent results as well as some computational studies providing a comparison
of different methods and also illustrating their success in applications.Comment: 60 pages, 33 figure
- …