DESCRIPTOR STORAGE AND SEARCHES OF K-DIMENSIONAL TREES
摘要
<p>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.</p>
申请公布号
WO2012177410(A1)
申请公布日期
2012.12.27
申请号
WO2012US41324
申请日期
2012.06.07
申请人
QUALCOMM INCORPORATED;VADDADI, SUNDEEP;HAMSICI, ONUR C.;HONG, JOHN H.;REZNIK, YURIY;LEE, CHONG U.
发明人
VADDADI, SUNDEEP;HAMSICI, ONUR C.;HONG, JOHN H.;REZNIK, YURIY;LEE, CHONG U.