For implementations of iterative reconstruction algorithms that rotate the image matrix, the characteristics of the rotator may affect the reconstruction quality. Desirable features of the rotator include (a) preservation of image counts, b) accurate count positioning, (c) a uniform and predictable amount of blurring due to the rotation, and (d) rapid computational speed. A new rotation method was developed, entitled Gaussian rotation, in which counts in each pixel in the origin array are deposited in a Gaussian distribution centered over a fractional pixel location in the destination image. This method was compared to standard rotation techniques, and was shown to be superior in terms of the above four features. For example, bilinear interpolation resulted in up to a 23% error in total image counts; such failure to preserve image counts is clearly unacceptable for image reconstruction. By comparison, Gaussian rotation resulted in no variation in image counts. The computational cost of Gaussian rotation was demonstrated to be only slightly more than hi-linear interpolation, and substantially less than that of hi-cubic polynomial or cubic spline interpolation. These features make Gaussian rotation preferable for iterative reconstruction. A more detailed version of this paper was accepted for publication in IEEE Transactions in Medical Imaging in 10/96, with estimated publication early in 1997.
|Number of pages||3|
|State||Published - 1996|
|Event||Proceedings of the 1996 IEEE Nuclear Science Symposium. Part 1 (of 3) - Anaheim, CA, USA|
Duration: Nov 2 1996 → Nov 9 1996
|Conference||Proceedings of the 1996 IEEE Nuclear Science Symposium. Part 1 (of 3)|
|City||Anaheim, CA, USA|
|Period||11/2/96 → 11/9/96|