Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A rapid look-up table method for reconstructing MR images from arbitrary K-space trajectories
Autore:
Dale, B; Wendt, M; Duerk, JL;
Indirizzi:
Case Western Reserve Univ, Dept Radiol & Biomed Engn, Cleveland, OH 44106 USA Case Western Reserve Univ Cleveland OH USA 44106 Cleveland, OH 44106 USA Univ Hosp Cleveland, Cleveland, OH 44106 USA Univ Hosp Cleveland Cleveland OH USA 44106 eland, Cleveland, OH 44106 USA
Titolo Testata:
IEEE TRANSACTIONS ON MEDICAL IMAGING
fascicolo: 3, volume: 20, anno: 2001,
pagine: 207 - 217
SICI:
0278-0062(200103)20:3<207:ARLTMF>2.0.ZU;2-6
Fonte:
ISI
Lingua:
ENG
Soggetto:
DENSITY COMPENSATION; GRIDDING ALGORITHM; FOURIER INVERSION; TOMOGRAPHY;
Keywords:
gridding; image reconstruction; k-space trajectory; tables;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Clinical Medicine
Engineering, Computing & Technology
Citazioni:
21
Recensione:
Indirizzi per estratti:
Indirizzo: Duerk, JL Case Western Reserve Univ, Dept Radiol & Biomed Engn, Cleveland,OH 44106 USA Case Western Reserve Univ Cleveland OH USA 44106 , OH 44106 USA
Citazione:
B. Dale et al., "A rapid look-up table method for reconstructing MR images from arbitrary K-space trajectories", IEEE MED IM, 20(3), 2001, pp. 207-217

Abstract

Look-up tables (LUTs) are a common method for increasing the speed of manyalgorithms. Their use can be extended to the reconstruction of nonuniformly sampled k-space data using either a discrete Fourier transform (DFT) algorithm or a convolution-based gridding algorithm. A table for the DFT would be precalculated arrays of weights describing how each data point affects all of image space. A table for a convolution-based gridding operation wouldbe a precalculated table of weights describing how each data point affectsa small k-space neighborhood, These LUT methods were implemented in C++ ona modest personal computer system; they allowed a radial Ic-space acquisition sequence, consisting of 180 views of 256 points each, to be gridded in 36.2 ms, or, in approximately 800 ns/point, By comparison, a similar implementation of the gridding operation, without LUTs, required 45 times longer (1639.2 ms) to grid the same data. This was possible even while using a 4 x4 Kaiser-Bessel convolution kernel, which is larger than typically used. These table-based computations will allow real time reconstruction in the future and can currently be run concurrently with the acquisition allowing for completely real-time gridding.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 26/01/20 alle ore 16:01:14