The presented method encourages real-time implementation of motion compensation algorithms in prostate biopsy with clinically acceptable registration errors. Continuous motion compensation demonstrated registration accuracy with submillimeter and subdegree error, while performing < 50 ms computation times. Image registration technique approaching the frame rate of an ultrasound system offers a key advantage to be smoothly integrated to the clinical workflow. In addition, this technique could be used further for a variety of image-guided interventional procedures to treat and diagnose patients by improving targeting accuracy.

No abstract

In computer tomography (CT), truncated projections are produced due to scanning large objects with a detector that is limited in width. Applying filtered back-projection(FBP) method directly to truncated projections, the reconstructed image will contain truncation artifacts -bright rings on the boundary of region of interest (ROI). Extrapolation algorithms can be used to reduce the truncation artifacts; however extrapolations are usually double the length of the projection data; resulting in an increased calculation time. This paper introduces mixed extrapolation, which is a combination of exponential and quadratic extrapolation. It is proven that doubling the length of the projection data for the mixed extrapolation can be avoided. The projections were extrapolated according to the boundary values and their derivatives. The algorithm achieves equivalence to the extrapolation approach with negligible increased calculation time. Supplementary functions are introduced in order to simplify the calculations. These functions can be calculated prior to extrapolation process, hence the calculation time is significantly reduced. The calculation times are compared between fast extrapolation introduced in this paper and normal extrapolation with doubling the length of projection data.

No abstract

For parallel beam geometry the Fourier reconstruction works via the Fourier slice theorem (or central slice theorem, projection slice theorem). For fan beam situation, Fourier slice can be extended to a generalized Fourier slice theorem (GFST) for fan-beam image reconstruction. We have briefly introduced this method in a conference. This paper reintroduces the GFST method for fan beam geometry in details. The GFST method can be described as following: the Fourier plane is filled by adding up the contributions from all fanbeam projections individually; thereby the values in the Fourier plane are directly calculated for Cartesian coordinates such avoiding the interpolation from polar to Cartesian coordinates in the Fourier domain; inverse fast Fourier transform is applied to the image in Fourier plane and leads to a reconstructed image in spacial domain. The reconstructed image is compared between the result of the GFST method and the result from the filtered backprojection (FBP) method. The major differences of the GFST and the FBP methods are: (1) The interpolation process are at different data sets. The interpolation of the GFST method is at projection data. The interpolation of the FBP method is at filtered projection data.(2) The filtering process are done in different places. The filtering process of the GFST is at Fourier domain. The filtering process of the FBP method is the ramp filter which is done at projections. The resolution of ramp filter is variable with different location but the filter in the Fourier domain lead to resolution invariable with location. One advantage of the GFST method over the FBP method is in short scan situation, an exact solution can be obtained with the GFST method, but it can not be obtained with the FBP method. The calculation of both the GFST and the FBP methods are at O(N 3 ), where N is the number of pixel in one dimension.