Close category search window
 

An improved algorithm for rotational motion artifact suppression in MRI

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weerasinghe, Chaminda ; Dept. of Electr. Eng., Sydney Univ., NSW, Australia ; Hong Yan

An improved algorithm for planar rotational motion artifact suppression in standard two-dimensional Fourier transform magnetic resonance images is presented. It is shown that interpolation of acquired view data on the uncorrupted k-space create data overlap and void regions. The authors present a method of managing overlap data regions, using weighted averaging of redundant data. The weights are assigned according to a priority ranking based on the minimum distance between the data set and the k-space grid points. An iterative estimation technique for filling the data void regions, using projections onto convex sets (POCS), is also described. The method has been successfully tested using computer simulations.

Published in:
Medical Imaging, IEEE Transactions on  (Volume:17 ,  Issue: 2 )

Date of Publication: April 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.