Surgery – Diagnostic testing – Detecting nuclear – electromagnetic – or ultrasonic radiation
Reexamination Certificate
2001-02-01
2004-02-17
Robinson, Daniel (Department: 3742)
Surgery
Diagnostic testing
Detecting nuclear, electromagnetic, or ultrasonic radiation
Reexamination Certificate
active
06694165
ABSTRACT:
BACKGROUND OF THE INVENTION
This invention relates to magnetic resonance imaging (MRI) systems and more particularly to such systems used for acquiring data and reconstructing data for two- or three-dimensional images.
Magnetic Resonance imaging (MRI) involves acquiring data in the spatial frequency domain referred to as k-space, and transforming the data into the spatial domain prior to viewing. The acquired k-space data samples have both magnitude and phase components. The Fourier transform of the k-space data is the MRI image.
Cartesian sampling in k-space followed by inverse discrete Fourier transform (IDFT) represents a commonly-used magnetic resonance imaging scheme. While the IDFT reconstruction is generally realized using the well-known and highly efficient fast Fourier transform (FFT) algorithm, reconstruction latency can still be significant. Reconstruction latency refers to the interval from the time of data acquisition to the time of actual visualization of the corresponding image.
With a modern MR imaging system run in gated time-resolved, interleaved multi-slice or volumetric imaging mode, depending on the data set size the latency may be on the order of tens of seconds, which may seriously hamper the use of the system for real-time or concurrent monitoring and diagnosis. The conventional practice of separating the FFT-reconstruction from the acquisition of a complete set of k-space samples is a main contributor to the latency. Further, the problem is generally aggravated when spatiotemporal coverage/resolution increases, because the time required to complete an FFT increases as the number of data points increases.
With the MR system run in fluoroscopy mode, the reconstruction latency degrades the system's real-time performance and leads to low image frame rate. In this case, computation redundancy may be another major contributor to the latency. To achieve a smoother depiction of imaged dynamics for example, the known technique of sliding-window reconstruction attempts to increase the number of reconstructed images through sharing raw data between reconstructed images. When this technique is applied in Cartesian-sampling based MR fluoroscopy, data acquisition constantly loops through the phase encodes, resulting in a fully refreshed k-space data frame every T
traverse
seconds (T
traverse
=time required for a complete k-space traversing). Image reconstruction, on the other hand, repeatedly applies FFT to a sliding window of the most recent full set of phase encodes, producing an image every T
compute
seconds (T
compute
=time required for updating an image). While T
traverse
determines the temporal resolution of the fluoroscopic images, T
compute
determines the upper limit of the rate at which one can slide the reconstruction window and hence the frame-rate of the fluoroscopic images. The fluoroscopy's real-time performance will thus be degraded if the FFT's are carried out slowly, because not only will the latency be significant, but also the frame-rate will be low.
In many applications where shortening data acquisition time or enhancing temporal resolution is desired, both reduction of T
traverse
(to improve temporal resolution) and minimization of T
compute
(to achieve real-time monitoring capability) are important. Reduction of T
traverse
can be accomplished through utilizing higher speed gradients for example. Under many circumstances where the MR images are real (up to a constant phase factor), another known technique is to reduce k-space coverage, which generally involves acquiring k-space data with a partial k-space traversing, and consequently reducing the data acquisition time or improving temporal resolution of the fluoroscopic images. However, partial k-space traversing presents some data reconstruction challenges. What is needed is a method for speed-enhanced acquisition and latency-reduced reconstruction when partial k-space traversing is employed.
BRIEF SUMMARY OF THE INVENTION
A method of data acquisition and reconstruction for use with a Magnetic Resonance Imaging (MRI) system comprises partially traversing k-space in a plurality of segments, computing sub-images for each of the segments, and incrementally reconstructing a plurality of intermediate and final images from the sub-images on-the-fly. The partial k-space traversing reduces data acquisition time and the incremental reconstruction reduces acquisition-to-visualization latency.
REFERENCES:
patent: 4830012 (1989-05-01), Riederer
patent: 4837513 (1989-06-01), Yao
patent: 5243284 (1993-09-01), Noll
patent: RE35656 (1997-11-01), Feinberg et al.
patent: 5810726 (1998-09-01), Van Vaals et al.
patent: 5957843 (1999-09-01), Luk Pat et al.
patent: 5987347 (1999-11-01), Khoury et al.
patent: 6198283 (2001-03-01), Foo et al.
patent: 6208139 (2001-03-01), Foo et al.
patent: 6317619 (2001-11-01), Boernert et al.
patent: 6351122 (2002-02-01), Polzin et al.
patent: 6393313 (2002-05-01), Foo
patent: 6430430 (2002-08-01), Gosche
General Electric Company
Patnode Patrick K.
Robinson Daniel
Testa Jean K.
LandOfFree
Method for ultra-fast MR fluoroscopy does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for ultra-fast MR fluoroscopy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for ultra-fast MR fluoroscopy will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3280689