Accelerated partial separable model using dimension-reduced optimization technique for ultra-fast cardiac MRI
Objective. Imaging dynamic object with high temporal resolution is challenging in magnetic resonance imaging (MRI). Partial separable (PS) model was proposed to improve the imaging quality by reducing the degrees of freedom of the inverse problem. However, PS model still suffers from long acquisition time and even longer reconstruction time. The main objective of this study is to accelerate the PS model, shorten the time required for acquisition and reconstruction, and maintain good image quality simultaneously. Approach. We proposed to fully exploit the dimension reduction property of the PS model, which means implementing the optimization algorithm in subspace. We optimized the data consistency term, and used a Tikhonov regularization term based on the Frobenius norm of temporal difference. The proposed dimension-reduced optimization technique was validated in free-running cardiac MRI. We have performed both retrospective experiments on public dataset and prospective experiments on in-vivo data. The proposed method was compared with four competing algorithms based on PS model, and two non-PS model methods. Main results. The proposed method has robust performance against shortened acquisition time or suboptimal hyper-parameter settings, and achieves superior image quality over all other competing algorithms. The proposed method is 20-fold faster than the widely accepted PS+Sparse method, enabling image reconstruction to be finished in just a few seconds. Significance. Accelerated PS model has the potential to save much time for clinical dynamic MRI examination, and is promising for real-time MRI applications.
Code (0)
등록된 구현이 없습니다.
Tasks
Dimensionality ReductionImage ReconstructionSimilar Papers 제목 키워드 기반
Variance Reduced Coordinate Descent with Acceleration: New Method With a Surprising Application to Finite-Sum Problems
We propose an accelerated version of stochastic variance reduced coordinate descent -- ASVRCD. As other variance reduced coordinate descent methods such as SEGA or SVRCD, our method can deal with problems that include a …
Parallel Coordinate Descent Methods for Big Data Optimization
In this work we show that randomized (block) coordinate descent methods can be accelerated by parallelization when applied to the problem of minimizing the sum of a partially separable smooth convex function and a simple…
Using Variable Interaction Graphs to Improve Particle Swarm Optimization
This paper presents Variable Interaction Graph Particle Swarm Optimization (VIGPSO), an adaptation to Particle Swarm Optimization (PSO) that dynamically learns and exploits variable interactions during the optimization p…
Accelerated Optimization in the PDE Framework: Formulations for the Manifold of Diffeomorphisms
We consider the problem of optimization of cost functionals on the infinite-dimensional manifold of diffeomorphisms. We present a new class of optimization methods, valid for any optimization problem setup on the space o…
Optical Flow EstimationvalidVariational PDEs for Acceleration on Manifolds and Application to Diffeomorphisms
We consider the optimization of cost functionals on manifolds and derive a variational approach to accelerated methods on manifolds. We demonstrate the methodology on the infinite-dimensional manifold of diffeomorphisms,…