Research of image matching algorithm based on local features
Lists
Only you see this
Abstract
For the problem of low efficiency in SIFT algorithm while using exhaustive method to search the nearest neighbor and next nearest neighbor of feature points, this paper introduces K-D tree algorithm, to index the feature points extracted in database images according to the tree structure, at the same time, using the concept of a weighted priority, further improves the algorithm, to further enhance the efficiency of feature matching.
BibTeX
@inproceedings{sun2015research,
author = {Wei Sun},
title = {{Research of image matching algorithm based on local features}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2015},
doi = {10.1117/12.2197153},
}Loading related content...