Optimised KD-trees for fast image descriptor matching
In this paper, we look at improving the KD-tree for a specific usage: indexing a large number of SIFT and other types of image descriptors. We have extended priority search, to priority search among multiple trees. By creating multiple KD-trees from the same data set and simultaneously searching among these trees, we have improved the KD-tree's search performance significantly. We have also exploited the structure in SIFT descriptors (or structure in any data set) to reduce the time spent in...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of CVPR 2008|
|01_Silpa-Anan_Optimised_KD-trees_for_fast_2008.pdf||586.09 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.