TY - GEN
T1 - An efficient algorithm for point matching using hilbert scanning distance
AU - Tian, Li
AU - Kamata, Sei Ichiro
PY - 2006/12/1
Y1 - 2006/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=34147123102&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34147123102&partnerID=8YFLogxK
U2 - 10.1109/ICPR.2006.237
DO - 10.1109/ICPR.2006.237
M3 - Conference contribution
AN - SCOPUS:34147123102
SN - 0769525210
SN - 9780769525211
T3 - Proceedings - International Conference on Pattern Recognition
SP - 873
EP - 876
BT - Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006
T2 - 18th International Conference on Pattern Recognition, ICPR 2006
Y2 - 20 August 2006 through 24 August 2006
ER -