180 290

Cited 0 times in

Fast and Accurate Rigid Registration of 3D CT Images by Combining Feature and Intensity

Authors
June, Naw Chit Too; Cui, Xuenan; Li, Shengzhe; Kim, HI; Kwack, KS
Citation
Journal of computing science and engineering : JCSE, 6(1):1-11, 2012
Journal Title
Journal of computing science and engineering : JCSE
ISSN
1976-46772093-8020
Abstract
Computed tomography (CT) images are widely used for the analysis of the temporal evaluation or monitoring of the progression of a disease. The follow-up examinations of CT scan images of the same patient require a 3D registration technique. In this paper, an automatic and robust registration is proposed for the rigid registration of 3D CT images. The proposed method involves two steps. Firstly, the two CT volumes are aligned based on their principal axes, and then, the alignment from the previous step is refined by the optimization of the similarity score of the image?셲 voxel. Normalized cross correlation (NCC) is used as a similarity metric and a downhill simplex method is employed to find out the optimal score. The performance of the algorithm is evaluated on phantom images and knee synthetic CT images. By the extraction of the initial transformation parameters with principal axis of the binary volumes, the searching space to find out the parameters is reduced in the optimization step. Thus, the overall registration time is algorithmically decreased without the deterioration of the accuracy. The preliminary experimental results of the study demonstrate that the proposed method can be applied to rigid registration problems of real patient images.
Keywords
Image registrationComputed tomographyPrincipal axesNormalized cross correlation
Appears in Collections:
Journal Papers > School of Medicine / Graduate School of Medicine > Radiology
AJOU Authors
곽, 규성
Full Text Link
Files in This Item:
Journal of computing science and engineering_6(1)_1-11.pdfDownload
Export
RIS (EndNote)
XLS (Excel)
XML

qrcode

해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse