Fast voxel-based 2D/3D registration algorithm using a volume rendering method based on the shear-warp factorization
نویسندگان
چکیده
2D/3D registration makes it possible to use pre-operative CT scans during X-ray fluoroscopy guided interventions for navigation purposes. For this registration task a fast voxel-based method is presented, which uses a recently introduced similarity measure (pattern intensity). This measure is especially suitable for 2D/3D registration, because it is robust with respect to structures as, for instance, a stent visible in the X-ray fluoroscopy image but not in the CT scan. The method uses only a part of the CT scan for the generation of digitally reconstructed radiographs (DRRs) to accelerate their computation. Nevertheless, computation time is crucial for intra-operative application, because numerous DRRs must be computed. The suitability of different volume rendering methods for 2D/3D registration has been investigated therefore. A method based on the shear-warp factorization turned out to be especially suitable and builds the basis of the registration algorithm. The algorithm has been applied to images of a spine phantom and to clinical images. For comparison, registration results have been calculated using ray-casting. The shear-warp factorization based rendering method accelerates registration by a factor up to seven compared to ray-casting without degrading registration accuracy. Using a vertebra as feature for registration, computation time is in the range of 3-4s (Sun UltraSparc, 300 MHz) which is acceptable for intra-operative application.
منابع مشابه
Fast Volume Rendering Methods for Voxel-based 2D/3D Registration - A Comparative Study
Voxel-based 2D/3D registration enables the use of preoperative 3D CT scans during X-ray fluoroscopy guided interventions for navigation purposes. Both a high accuracy and a short computation time are crucial. The method used in this project is described. Most time consuming is the computation of a perspective projection from the 3D data. Several volume visualisation methods to compute such a pr...
متن کاملThe parallelization of the perspective shear-warp volume rendering algorithm
The shear-warp algorithm for volume rendering is among the fastest volume rendering algorithms. It is an objectorder algorithm, based on the idea of the factorization of the view matrix into a 3D shear and a 2D warp component. Thus, the compositing can be done in sheared object space, which allows the algorithm to take advantage of data locality. Although the idea of a perspective projection sh...
متن کاملThe parallelized perspective shear-warp algorithm for volume rendering
The shear-warp algorithm for volume rendering is among the fastest volume rendering algorithms. It is an object-order algorithm, based on the idea of the factorization of the view matrix into a 3D shear and a 2D warp component. Thus, the compositing can be done in sheared object space, which allows the algorithm to take advantage of data locality. Although the idea of a perspective projection s...
متن کاملFast Volume Rotation using Binary Shear-Warp Factorization
This paper presents a fast volume rotation technique based on binary shear-warp factorization. Unlike many acceleration algorithms this method does not trade image quality for speed and does not require any specialized hardware either. In order to skip precisely the empty regions along the rays to be evaluated a binary volume is generated indicating the locations of the transparent cells. This ...
متن کاملTowards fast image-based rendering of volume data
Volume rendering is a technique for directly displaying a sampled 3D scalar field without first fitting geometric primitives to the samples, allowing to represent the interior of objects and not only the outer shell. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Therefore, the task of fast rende...
متن کامل