Please use this identifier to cite or link to this item:
|Title:||Accurate and precise 3D surface based registration||Authors:||Yan, C.H.
|Keywords:||Automatic precise 3D registration||Issue Date:||2004||Citation:||Yan, C.H.,Ong, S.H.,Ge, Y.,Teoh, S.H.,Chui, C.K. (2004). Accurate and precise 3D surface based registration. Sixth IASTED International Conference on Signal and Image Processing : 413-417. ScholarBank@NUS Repository.||Abstract:||Image registration is an important task in image-guided pre-surgery planning, surgery and post-surgery analysis. Fudicial markers are commonly used to achieve accurate registration. This technique provides a near real time, robust and accurate registration. However, due to it's invasive nature, it is not as popular as the group of noninvasive techniques that make use of intrinsic features for registration. The main challenge in using intrinsic features is that the accuracy in extracting these features directly affects the registration accuracy. Surface-based registration is one of the most commonly used technique for structural registration (head registration, bone registration, etc). It does not require the use of external markers and is suitable for cross modality registration, computed tomography (CT) and magnetic resonance (MR) images. However, this technique requires the precise extraction of the corresponding surfaces and also an optimization routine to compute the optimal transformation relating the reference and current surface. In this paper, we will describe a near automatic procedure for accurately extracting bone surfaces from CT image. The experimental results show that the registration attained is in the order of sub-pixel accuracy.||Source Title:||Sixth IASTED International Conference on Signal and Image Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/51100||ISBN:||088986442X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.