loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Conference on Pattern Recognition (ICPR'06) Volume 3
An Efficient Algorithm for Point Matching Using Hilbert Scanning Distance
Hong Kong
August 20-August 24
ISBN: 0-7695-2521-0
Li Tian, Waseda University, Japan
Sei-ichiro Kamata, Waseda University, Japan
A fast and accurate similarity named Hilbert Scanning Distance(HSD) [9] has recently been presented for point matching. In this study, we improved an efficient algorithm of search strategy for HSD in the large search space. This search strategy is associated with two ideas: a relaxation greedy search, and an accelerating process using Monte Carlo sampling. The experimental results implicate that this improved algorithm is robust and efficient for point matching using HSD. It also makes a tradeoff between accuracy and speed under different requirements.
Citation:
Li Tian, Sei-ichiro Kamata, "An Efficient Algorithm for Point Matching Using Hilbert Scanning Distance," icpr, vol. 3, pp.873-876, 18th International Conference on Pattern Recognition (ICPR'06) Volume 3, 2006
Usage of this product signifies your acceptance of the Terms of Use.