发明名称 |
Optimized KD-Tree for Scalable Search |
摘要 |
Techniques for constructing an optimized kd-tree are described. In an implementation, an optimized kd-tree process receives input of a set of data points applicable for large-scale computer vision applications. The process divides the set of the data points into subsets of data points with nodes while generating hyperplanes (e.g., coordinate axes). The process identifies a partition axis for each node based on the coordinate axes combined in a binary way. The optimized kd-tree process creates an optimized kd-tree that organizes the data points based on the identified partition axis. The organization of the data points in the optimized kd-tree provides efficient indexing and searching for a nearest neighbor. |
申请公布号 |
US2012117122(A1) |
申请公布日期 |
2012.05.10 |
申请号 |
US20100940880 |
申请日期 |
2010.11.05 |
申请人 |
WANG JINGDONG;HUA XIAN-SHENG;LI SHIPENG;JIA YOU;MICROSOFT CORPORATION |
发明人 |
WANG JINGDONG;HUA XIAN-SHENG;LI SHIPENG;JIA YOU |
分类号 |
G06F17/30 |
主分类号 |
G06F17/30 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|