𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Self-calibrated GRAPPA method for 2D and 3D radial data

✍ Scribed by Arjun Arunachalam; Alexey Samsonov; Walter F. Block


Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
550 KB
Volume
57
Category
Article
ISSN
0740-3194

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A fast parallel MRI (pMRI) reconstruction method is presented for 2D and 3D radial trajectories. A limitation of the radial generalized autocalibrating partially parallel acquisitions (GRAPPA) method is the need to acquire training data prior to the actual scan. This can be eliminated by the use of self‐calibration when synthesizing the missing data for each coil reconstruction. The training data for each coil are estimated by multiplying the conventionally reconstructed composite image, which contains the aliasing artifacts from undersampling, with each coil's spatial sensitivity profile. An estimate of the individual receiver spatial sensitivity profiles is obtained from the k‐space data that fulfill the Nyquist sampling criterion. The frequency domain representation of the training data is then calculated at the acquired k‐space sample points and at the unacquired locations at which we desire to synthesize k‐space data. Fitting the acquired k‐space samples to the unacquired points creates reconstruction weights that are used to synthesize unacquired radial lines. The in vivo feasibility of the method for 2D radial trajectories is illustrated with an example of 2D abdominal imaging. Preliminary results obtained after applying the method on a 3D radial steady‐state free precession (SSFP) data set are also demonstrated. Magn Reson Med 57:931–938, 2007. © 2007 Wiley‐Liss, Inc.


📜 SIMILAR VOLUMES


A Constraint-Satisfaction Approach for 3
✍ Michael Boshra; Hong Zhang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 415 KB

We present a framework for recognition of 3D objects by integrating 2D and 3D sensory data. The major thrust of this work is to efficiently utilize all relevant data, both 2D and 3D, in the early stages of recognition, in order to reduce the computational requirements of the recognition process. To

A Fast and Robust Algorithm for 2D/3D Pa
✍ Otmar Scherzer; Armin Schoisswohl 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 873 KB

T his paper presents a fast and robust algorithm for generating compound panorama images from partially (spatially) overlapping data sets. This method results in optimizing a nonlinear functional. We propose a multiscale approach for the solution of the optimization problem that is based on a multir

Numerical methods for constrained optimi
✍ J. Nedoma; M. Bartoš; Z. Kestřánek; Z. Kestřánek; Jr.; J. Stehlík 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 363 KB 👁 1 views

This paper formulates, analyses and discusses 2D and 3D static and dynamic model problems in the orthopaedic practice. Finite element approximations, algorithms and iterative methods for constrained optimization are discussed. Since the conjugate gradient method is one of the most effective methods