Motion estimation is an essential step common to all magnetic resonance elastography (MRE) methods. For dynamic techniques, the motion is obtained from a sinusoidal fit of the image phase at multiple, uniformly spaced relative phase offsets, phi, between the motion and the motion encoding gradients (MEGs). Generally, eight values of phi sampled at the Nyquist interval pi/4 over [0, 2pi). We introduce a method, termed reduced motion encoding (RME), that reduces the number of phi required, thereby reducing the imaging time for an MRE acquisition. A frequency-domain algorithm was implemented using the discrete Fourier transform (DFT) to derive the general least-squares solution for the motion amplitude and phase given an arbitrary number of phi. A closed form representation of the condition number of the transformation matrix which is used for estimating motion was introduced to determine the sensitivity to noise for different sampling patterns of phi. Simulation results confirmed the minimum error sampling patterns suggested from the condition number maps. The minimum noise in the motion estimate is obtained when the sampled phi are essentially evenly distributed over the range [0, pi) with an interval pi/n, where n is the number of phi sampled, or alternatively with an interval 2pi/n over the range [0, 2pi) which represents the Nyquist interval. Simulations also show that the noise level decreases as n increases as expected. The decrease in noise is the largest when n is small and it becomes less significant as n increases. The algorithm also makes it possible to estimate the motion from only two values of phi, which cannot be accomplished with traditional methods because sampling at the Nyquist interval is indeterminate. Finally, noise levels in motion estimated from phantom studies and in vivo results taken with different n agreed with that predicted by simulation and condition number calculations.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2804898 | PMC |
http://dx.doi.org/10.1088/0031-9155/53/8/012 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!