22 research outputs found
Acceleration Methods for MRI
Acceleration methods are a critical area of research for MRI. Two of the most important acceleration techniques involve parallel imaging and compressed sensing. These advanced signal processing techniques have the potential to drastically reduce scan times and provide radiologists with new information for diagnosing disease. However, many of these new techniques require solving difficult optimization problems, which motivates the development of more advanced algorithms to solve them. In addition, acceleration methods have not reached maturity in some applications, which motivates the development of new models tailored to these applications. This dissertation makes advances in three different areas of accelerations. The first is the development of a new algorithm (called B1-Based, Adaptive Restart, Iterative Soft Thresholding Algorithm or BARISTA), that solves a parallel MRI optimization problem with compressed sensing assumptions. BARISTA is shown to be 2-3 times faster and more robust to parameter selection than current state-of-the-art variable splitting methods. The second contribution is the extension of BARISTA ideas to non-Cartesian trajectories that also leads to a 2-3 times acceleration over previous methods. The third contribution is the development of a new model for functional MRI that enables a 3-4 factor of acceleration of effective temporal resolution in functional MRI scans. Several variations of the new model are proposed, with an ROC curve analysis showing that a combination low-rank/sparsity model giving the best performance in identifying the resting-state motor network.PhDBiomedical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/120841/1/mmuckley_1.pd
A projection algorithm for gradient waveforms design in Magnetic Resonance Imaging
International audienceCollecting the maximal amount of information in a given scanning time is a major concern in Magnetic Resonance Imaging (MRI) to speed up image acquisition. The hardware constraints (gradient magnitude, slew rate, ...), physical distortions (e.g., off-resonance effects) and sampling theorems (Shannon, compressed sensing) must be taken into account simultaneously, which makes this problem extremely challenging. To date, the main approach to design gradient waveform has consisted of selecting an initial shape (e.g. spiral, radial lines, ...) and then traversing it as fast as possible using optimal control. In this paper, we propose an alternative solution which first consists of defining a desired parameterization of the trajectory and then of optimizing for minimal deviation of the sampling points within gradient constraints. This method has various advantages. First, it better preserves the density of the input curve which is critical in sampling theory. Second, it allows to smooth high curvature areas making the acquisition time shorter in some cases. Third, it can be used both in the Shannon and CS sampling theories. Last, the optimized trajectory is computed as the solution of an efficient iterative algorithm based on convex programming. For piecewise linear trajectories, as compared to optimal control reparameterization, our approach generates a gain in scanning time of 10% in echo planar imaging while improving image quality in terms of signal-to-noise ratio (SNR) by more than 6 dB. We also investigate original trajectories relying on traveling salesman problem solutions. In this context, the sampling patterns obtained using the proposed projection algorithm are shown to provide significantly better reconstructions (more than 6 dB) while lasting the same scanning time
Topics in Steady-state MRI Sequences and RF Pulse Optimization.
Small-tip fast recovery (STFR) is a recently proposed rapid steady-state magnetic resonance imaging (MRI) sequence that has the potential to be an alternative to the popular balanced steady-state free precession (bSSFP) imaging sequence, since they have similar signal level and tissue contrast, but STFR has reduced banding artifacts. In this dissertation, an analytic equation of the steady-state signal for the unspoiled version of STFR is first derived. It is shown that unspoiled-STFR is less sensitive to the inaccuracy in excitation than the previous proposed spoiled-STFR. By combining unspoiled-STFR with jointly designed tip-down and tip-up pulses, a 3D STFR acquisition over 3-4 cm thick 3D ROI with single coil and short RF pulses (1.7 ms) is demonstrated. Then, it is demonstrated that STFR can reliably detect functional MRI signal and the contrast is driven mainly from intra-voxel dephasing, not diffusion, using Monte Carlo simulation, human experiments and test-retest reliability. Following that another version of STFR using a spectral pre-winding pulse instead of the spatially tailored pulse is investigated, leading to less T2* weighting, easier implementation. Multidimensional selective RF pulse is a key part for STFR and many other MRI applications. Two novel RF pulse optimization methods are proposed. First, a minimax formulation that directly controls the maximum excitation error, and an effective optimization algorithm using variable splitting and alternating direction method of multipliers (ADMM). The proposed method reduced the maximum excitation by more than half in all the testing cases. Second, a method that jointly optimizes the excitation k-space trajectory and RF pulse is proposed. The k-space trajectory is parametrized using 2nd-order B-splines, and an interior point algorithm is used to explicitly solve the constrained optimization. An effective initialization method is also suggested. The joint design reduced the NRMSE by more than 30 percent compared to existing methods in inner volume excitation and pre-phasing problem. Using the proposed joint design, rapid inner volume STFR imaging with a 4 ms excitation pulse with single transmit coil is demonstrated. Finally, a regularized Bloch-Siegert B1 map reconstruction method is presented that significantly reduces the noise in estimated B1 maps.PhDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/111514/1/sunhao_1.pd
Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems
Optimization methods are at the core of many problems in signal/image
processing, computer vision, and machine learning. For a long time, it has been
recognized that looking at the dual of an optimization problem may drastically
simplify its solution. Deriving efficient strategies which jointly brings into
play the primal and the dual problems is however a more recent idea which has
generated many important new contributions in the last years. These novel
developments are grounded on recent advances in convex analysis, discrete
optimization, parallel processing, and non-smooth optimization with emphasis on
sparsity issues. In this paper, we aim at presenting the principles of
primal-dual approaches, while giving an overview of numerical methods which
have been proposed in different contexts. We show the benefits which can be
drawn from primal-dual algorithms both for solving large-scale convex
optimization problems and discrete ones, and we provide various application
examples to illustrate their usefulness
Convolutional Analysis Operator Learning: Acceleration and Convergence
Convolutional operator learning is gaining attention in many signal
processing and computer vision applications. Learning kernels has mostly relied
on so-called patch-domain approaches that extract and store many overlapping
patches across training signals. Due to memory demands, patch-domain methods
have limitations when learning kernels from large datasets -- particularly with
multi-layered structures, e.g., convolutional neural networks -- or when
applying the learned kernels to high-dimensional signal recovery problems. The
so-called convolution approach does not store many overlapping patches, and
thus overcomes the memory problems particularly with careful algorithmic
designs; it has been studied within the "synthesis" signal model, e.g.,
convolutional dictionary learning. This paper proposes a new convolutional
analysis operator learning (CAOL) framework that learns an analysis sparsifying
regularizer with the convolution perspective, and develops a new convergent
Block Proximal Extrapolated Gradient method using a Majorizer (BPEG-M) to solve
the corresponding block multi-nonconvex problems. To learn diverse filters
within the CAOL framework, this paper introduces an orthogonality constraint
that enforces a tight-frame filter condition, and a regularizer that promotes
diversity between filters. Numerical experiments show that, with sharp
majorizers, BPEG-M significantly accelerates the CAOL convergence rate compared
to the state-of-the-art block proximal gradient (BPG) method. Numerical
experiments for sparse-view computational tomography show that a convolutional
sparsifying regularizer learned via CAOL significantly improves reconstruction
quality compared to a conventional edge-preserving regularizer. Using more and
wider kernels in a learned regularizer better preserves edges in reconstructed
images.Comment: 22 pages, 11 figures, fixed incorrect math theorem numbers in fig.