An efficient algorithm for point matching using hilbert scanning distance

研究成果: Conference contribution

抜粋

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.

元の言語English
ホスト出版物のタイトルProceedings - 18th International Conference on Pattern Recognition, ICPR 2006
ページ873-876
ページ数4
DOI
出版物ステータスPublished - 2006 12 1
イベント18th International Conference on Pattern Recognition, ICPR 2006 - Hong Kong, China
継続期間: 2006 8 202006 8 24

出版物シリーズ

名前Proceedings - International Conference on Pattern Recognition
3
ISSN(印刷物)1051-4651

Other

Other18th International Conference on Pattern Recognition, ICPR 2006
China
Hong Kong
期間06/8/2006/8/24

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

フィンガープリント An efficient algorithm for point matching using hilbert scanning distance' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Tian, L., & Kamata, S. I. (2006). An efficient algorithm for point matching using hilbert scanning distance. : Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006 (pp. 873-876). [1699664] (Proceedings - International Conference on Pattern Recognition; 巻数 3). https://doi.org/10.1109/ICPR.2006.237