摘要
We present a data clustering method for robust SIFT matching. Our matching process contains an offline module to cluster features from a group of reference images and an online module to match them to the live images in order to enhance matching robustness. The main contribution lies in constructing a composite k-d data structure which can be used not only to cluster features but also to implement features matching. Then an optimal keyframe selection method is proposed using our composite k-d tree, which can not only put the matching process forward but also give us a way to employ a cascading feature matching strategy to combine matching results of composite k-d tree and keyframe. Experimental results show that our method dramatically enhances matching robustness.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1123-1129 |
| 页数 | 7 |
| 期刊 | Jisuanji Yanjiu yu Fazhan/Computer Research and Development |
| 卷 | 49 |
| 期 | 5 |
| 出版状态 | 已出版 - 5月 2012 |
学术指纹
探究 'A data-clustering based robust SIFT feature matching method' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver