Descriptor storage and searches of k-dimensional trees
First Claim
1. 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, whereinthe 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.
2 Assignments
0 Petitions
Accused Products
Abstract
Various arrangements for using a k-dimensional tree for a search are presented. A plurality of descriptors may be stored. Each of the plurality of descriptors stored is linked with a first number of stored dimensions. The search may be performed using the k-dimensional tree for one or more query descriptors that at least approximately match one or more of the plurality of descriptors linked with the first number of stored dimensions. The k-dimensional tree may be built using the plurality of descriptors wherein each of the plurality of descriptors is linked with a second number of dimensions when the k-dimensional tree is built. The second number of dimensions may be a greater number of dimensions than the first number of stored dimensions.
43 Citations
31 Claims
-
1. 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. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer-readable medium comprising instructions configured to cause a computer to:
-
store a first plurality of descriptors, wherein each of the first plurality of descriptors stored is linked with a first number of stored dimensions; search 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; store 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, search 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. - View Dependent Claims (9, 10, 11, 12, 13)
-
-
14. A system for using k-dimensional trees for a search, the system comprising:
-
a processor; and a first memory communicatively coupled with and readable by the processor having stored therein a series of processor-readable instructions which, when executed by the processor, cause the processor to; cause a first plurality of descriptors to be stored, wherein each of the first plurality of descriptors stored is linked with a first number of stored dimensions; search 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; cause a second plurality of descriptors to be stored, 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, search 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. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. An apparatus for using k-dimensional trees for a search, the apparatus comprising:
-
means for storing a first plurality of descriptors, wherein each of the first plurality of descriptors stored is linked with a first number of stored dimensions and the means for storing the first plurality of descriptors comprises a non-transitory computer-readable storage medium; means for searching 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; the second number of dimensions is a greater number of dimensions than the first number of stored dimensions, and the means for searching the first k-dimensional tree comprises a processor, means for storing a second plurality of descriptors, wherein each of the second plurality of descriptors stored is linked with the first number of stored dimensions; and means for searching 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, such searching occurring after searching the first k-dimensional tree 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. - View Dependent Claims (26, 27, 28, 29, 30)
-
-
31. A system for using k-dimensional trees for a search, the system comprising:
-
a mobile device that comprises an image capture device, the mobile device configured to; capture a query image; create a query descriptor using the query image; and transmit the query descriptor to a computer system; and the computer system comprising a computer-readable medium comprising instructions configured to cause a computer to; receive the query descriptor from the mobile device; cause a first plurality of descriptors to be stored, wherein each of the first plurality of descriptors stored is linked with a first number of stored dimensions; search a first k-dimensional tree with the query descriptor to find a matching descriptor from among the plurality of descriptors linked with the first number of stored dimensions, wherein; the first k-dimensional tree is built using the plurality of descriptors wherein each of the 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; cause a second plurality of descriptors to be stored, 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, search 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.
-
Specification