Patent · US Active

Descriptor storage and searches of k-dimensional trees

US8706711B2 · kind B2 · utility

2Cited by

20References

31Claims

0Family size

Assignee

QUALCOMM Incorporated · US

Inventors

Sundeep Vaddadi · San Diego, US
Onur C. Hamsici · San Diego, US
John H. Hong · San Diego, US
Yuriy Reznik · San Diego, US
Chong U. Lee · San Diego, US

Key dates

Filing date	Dec 29, 2011
Grant date	Apr 22, 2014
Priority date	—
Expiry date	Mar 15, 2032

Classification

Technology area (CPC G)Physics
CPC primaryG06F18/24323
WIPO fieldComputer technology
WIPO sectorElectrical engineering

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.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.