3-Way-Trees: A Similarity Search Method for High-Dimensional Descriptor Matching

In this paper we look into the problem of high-dimensional local descriptor matching for image identification on cultural databases, presenting an important improvement over a classic method, the KD-tree. Our method, the 3-way tree, uses redundant, overlapping sub-trees, in order to avoid the boundary effects that disrupt the KD-tree in higher dimensionalities, achieving more precision for the same querying times.