Patent ID: 8706711

Claim:
A method for using k-dimensional trees for a search, the method comprising: storing a first plurality of descriptors, wherein each of the first plurality of descriptors stored is linked with a first number of stored dimensions; searching, by a computer system, a first k-dimensional tree with a query descriptor for a matching descriptor from among the first plurality of descriptors linked with the first number of stored dimensions, wherein: the first k-dimensional tree is built using the first plurality of descriptors wherein each of the first plurality of descriptors is linked with a second number of dimensions when the first k-dimensional tree is built; and the second number of dimensions is a greater number of dimensions than the first number of stored dimensions; storing, by the computer system, a second plurality of descriptors, wherein each of the second plurality of descriptors stored is linked with the first number of stored dimensions; and following searching the first k-dimensional tree, searching, by the computer system, a second k-dimensional tree using the query descriptor to find the matching descriptor from among the second plurality of descriptors linked with the first number of stored dimensions, wherein the second k-dimensional tree is built using the second plurality of descriptors wherein each of the second plurality of descriptors is linked with the second number of dimensions when the second k-dimensional tree is built.