PubMed Health⌕ Search

Biomedical subjects

Yongxian Qian

Publications and source records attributed to Yongxian Qian.

6 recordsLinked to original sources

Decomposed direct matrix inversion for fast non-cartesian SENSE reconstructions.

A new k-space direct matrix inversion (DMI) method is proposed here to accelerate non-Cartesian SENSE reconstructions. In this method a global k-space matrix equation is established on basic MRI principles, and the inverse of the global encoding matrix is found from a set of local matrix equations by taking advantage of the small extension of k-space coil maps. The DMI algorithm's efficiency is achieved by reloading the precalculated global inverse when the coil maps and trajectories remain unchanged, such as in dynamic studies. Phantom and human subject experiments were performed on a 1.5T scanner with a standard four-channel phased-array cardiac coil. Interleaved spiral trajectories were used to collect fully sampled and undersampled 3D raw data. The equivalence of the global k-space matrix equation to its image-space version, was verified via conjugate gradient (CG) iterative algorithms on a 2x undersampled phantom and numerical-model data sets. When applied to the 2x undersampled phantom and human-subject raw data, the decomposed DMI method produced images with small errors (< or = 3.9%) relative to the reference images obtained from the fully-sampled data, at a rate of 2 s per slice (excluding 4 min for precalculating the global inverse at an image size of 256 x 256). The DMI method may be useful for noise evaluations in parallel coil designs, dynamic MRI, and 3D sodium MRI with fixed coils and trajectories.

Algorithms↗

Self-calibrated spiral SENSE.

Current standard sensitivity-encoded parallel imaging (SENSE) utilizes a fully sampled low-resolution reference scan to estimate the coil sensitivities. This reference scan adds scan time and may introduce misregistration artifacts. The purpose of this study was to investigate the feasibility of estimating the coil sensitivities for spiral SENSE directly from an undersampled k-space center. The limited spatial frequencies of the coil sensitivities, and the undersampling beyond the Nyquist radius cause image artifacts. A point spread function (PSF) analysis and experiments on both phantoms and humans identified an optimal radius for the k-space center by minimizing these image artifacts. The preliminary data indicate that self-calibrated SENSE is as accurate as standard SENSE, which uses a fully sampled reference scan.

Algorithms↗

[Advance of fast magnetic resonance spectroscopic imaging].

The required time of conventional magnetic resonance spectroscopic imaging technique is too long to be applied to clinic. It is necessary to develop the fast methods for magnetic resonance spectroscopic imaging. Nowadays there are 7 kinds of methods presented, which come from MRI techniques. In this contribution the conventional spectroscopic imaging and 7 sorts of fast spectroscopic imaging are elaborated. It is envisaged that more rapid imaging techniques will be designed, if these arbitrary trajectory reconstruction methods in MRI are applied to spectroscopic imaging.

Magnetic Resonance Imaging↗

[Software for MR image reconstruction from data acquired on an irregular k-space trajectory].

A PC-based software was developed and programmed with VC++6 for reconstructing MR images from the data acquired on an irregular k-space trajectory. It can read clinical MRI raw data and image data, create numerical phantoms, design k-space trajectories, generate k-space data from numerical phantom, calculate weighting functions, reconstruct images, and carry out error analysis for the reconstructed images. It is helpful to the investigations of new k-space trajectories and new reconstruction algorithms.

Algorithms↗

Direct reconstruction of MR images from data acquired on a non-Cartesian grid using an equal-phase-line algorithm.

The equal-phase line (EPL) algorithm is proposed as a means of allowing rapid Fourier transform (FT) reconstruction of MR image data acquired on a non-Cartesian grid. The pixels on the image are grouped according to their positions. The pixels in a group have the same phase in the complex exponential function -exp[j2pi(xu + yv)] and receive the same contribution from a data point. Each group is related to an EPL in the image space. The contribution of a data point can then be distributed to the pixels along the EPLs. The described EPL algorithm enables a decrease of the reconstruction time to about 40% of the direct FT (DrFT) for the non-Cartesian data. A numerical phantom and two sets of in vivo spiral data were used to investigate an optimal number of the EPLs and to measure the reconstruction time. The EPL algorithm runs nearly as fast as the look-up table (LUT) method (Dale et al. IEEE Trans Med Imaging 2001;20:207-217), but it does not require a large memory to store the coefficients in advance, as is required in the LUT method. Thus, the EPL algorithm can be used to reconstruct images up to 512 x 512 pixels in size in a PC of limited memory, and may be more conveniently applied to a multiprocessor system.

Algorithms↗

Reconstruction of MR images from data acquired on an arbitrary k-space trajectory using the same-image weight.

A sampling density compensation function denoted "same-image (SI) weight" is proposed to reconstruct MR images from the data acquired on an arbitrary k-space trajectory. An equation for the SI weight is established on the SI criterion and an iterative scheme is developed to find the weight. The SI weight is then used to reconstruct images from the data calculated on a random trajectory in a numerical phantom case and from the data acquired on interleaved spirals in an in vivo experiment, respectively. In addition, Pipe and Menon's weight (MRM 1999;41:179-186) is also used in the reconstructions to make a comparison. The images obtained with the SI weight were found to be slightly more accurate than those obtained with Pipe's weight.

Brain↗