z-logo
Premium
MR fluoroscopy: Technical feasibility
Author(s) -
Riederer Stephen J.,
Tasciyan Talin,
Farzaneh Farhad,
Lee James N.,
Wright Ronald C.,
Herfkens Robert J.
Publication year - 1988
Publication title -
magnetic resonance in medicine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.696
H-Index - 225
eISSN - 1522-2594
pISSN - 0740-3194
DOI - 10.1002/mrm.1910080102
Subject(s) - computer science , computer vision , sliding window protocol , artificial intelligence , imaging phantom , data acquisition , window (computing) , iterative reconstruction , image (mathematics) , sequence (biology) , physics , optics , biology , genetics , operating system
A method of magnetic resonance image acquisition and reconstruction is described in which high imaging rates and fast reconstruction times are allowed. The acquisition is a modification of the basic FLASH sequence but with a restricted number N of phase encodings. The encodings are applied sequentially, periodically, and continuously. Images are formed by sliding a window of width N encodings along the acquired data and reconstructing an image for each position of the window. In general the acquisition time per image exceeds the time between successive images, and the method thus has a temporal lag. Experimental studies were performed with a dynamic phantom using 48 phase encodings and a TR of 20 ms, for an image acquisition time of about 1 s. The image display rate in the reconstructed sequence was 12.5 images/s, and the image sequence portrayed the motion of the phantom. Additional studies were done with 24 encodings. It is shown how the sliding window technique lends itself to high‐speed reconstruction, with each newly acquired echo used to quickly update the image on display. The combination of the acquisition technique described and a hardware implementation of the reconstruction algorithm can result in realtime MR image acquisition and reconstruction. © 1988 Academic Press, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here