Catalogo Articoli (Spogli Riviste)
OPAC HELP
Titolo: A rapid lookup table method for reconstructing MR images from arbitrary Kspace 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:
 02780062(200103)20:3<207:ARLTMF>2.0.ZU;26
 Fonte:
 ISI
 Lingua:
 ENG
 Soggetto:
 DENSITY COMPENSATION; GRIDDING ALGORITHM; FOURIER INVERSION; TOMOGRAPHY;
 Keywords:
 gridding; image reconstruction; kspace 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 lookup table method for reconstructing MR images from arbitrary Kspace trajectories", IEEE MED IM, 20(3), 2001, pp. 207217
Abstract
Lookup tables (LUTs) are a common method for increasing the speed of manyalgorithms. Their use can be extended to the reconstruction of nonuniformly sampled kspace data using either a discrete Fourier transform (DFT) algorithm or a convolutionbased 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 convolutionbased gridding operation wouldbe a precalculated table of weights describing how each data point affectsa small kspace neighborhood, These LUT methods were implemented in C++ ona modest personal computer system; they allowed a radial Icspace 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 KaiserBessel convolution kernel, which is larger than typically used. These tablebased computations will allow real time reconstruction in the future and can currently be run concurrently with the acquisition allowing for completely realtime 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