This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE International Conference on Multimedia and Expo
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
Toronto, ON, Canada
July 09-July 12
ISBN: 1-4244-0366-7
Jiann-der Lee, Department of Electrical Engineering, Chang Gung University, Tao-Yuan, Taiwan
Shih-sen Hsieh, Department of Electrical Engineering, Chang Gung University, Tao-Yuan, Taiwan
Chung-hsien Huang, Department of Electrical Engineering, Chang Gung University, Tao-Yuan, Taiwan
Li-chang Liu, Department of Electrical Engineering, Chang Gung University, Tao-Yuan, Taiwan
Cheien-tsai Wu, Medical Augmented Reality Research Center, Chang Gung Memorial Hospital, Lin-Kou, Taiwan; Department of Neurosurgery, Chang Gung Memorial Hospital, Taiwan
Shin-tseng Lee, Medical Augmented Reality Research Center, Chang Gung Memorial Hospital, Lin-Kou, Taiwan; Department of Neurosurgery, Chang Gung Memorial Hospital, Taiwan
Jyi-feng Chen, Medical Augmented Reality Research Center, Chang Gung Memorial Hospital, Lin-Kou, Taiwan; Department of Neurosurgery, Chang Gung Memorial Hospital, Taiwan
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm(ICP) which is widely used in registration applications in medical and 3-D architecture areas. In recent researches of finding coupling points, Approximate K-D tree search algorithm (AK-D tree) is an efficient nearest neighbor search algorithm with comparable results. We proposed Adaptive Dual AK-D tree search algorithm (ADAK-D tree) for searching and synthesizing coupling points as significant control points to improve the registration accuracy in ICP registration applications. ADAK-D tree utilizes AK-D tree twice in different geometrical projection orders to reserve true nearest neighbor points used in later ICP stages. An adaptive threshold in ADAK-D tree is used to reserve sufficient coupling points for a smaller alignment error. Experimental results are shown that the registration accuracy of using ADAK-D tree is improved more than the result of using AK-D tree and the computation time is acceptable.
Citation:
Jiann-der Lee, Shih-sen Hsieh, Chung-hsien Huang, Li-chang Liu, Cheien-tsai Wu, Shin-tseng Lee, Jyi-feng Chen, "Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications," icme, pp.177-180, 2006 IEEE International Conference on Multimedia and Expo, 2006
Usage of this product signifies your acceptance of the Terms of Use.