This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Trinary-Projection Trees for Approximate Nearest Neighbor Search
Feb. 2014 (vol. 36 no. 2)
pp. 388-403
Jingdong Wang, Microsoft Research Aisa, Beijing
Naiyan Wang, The Hong Kong University of Science and Technology, Hong Kong
You Jia, Carnegie Mellon University, Pittsburgh
Jian Li, Tsinghua University, Beijing
Gang Zeng, Peking University, Beijing
Hongbin Zha, Peking University, Beijing
Xian-Sheng Hua, Microsoft Corporation, Bellevue
We address the problem of approximate nearest neighbor (ANN) search for visual descriptor indexing. Most spatial partition trees, such as KD trees, VP trees, and so on, follow the hierarchical binary space partitioning framework. The key effort is to design different partition functions (hyperplane or hypersphere) to divide the points so that 1) the data points can be well grouped to support effective NN candidate location and 2) the partition functions can be quickly evaluated to support efficient NN candidate location. We design a trinary-projection direction-based partition function. The trinary-projection direction is defined as a combination of a few coordinate axes with the weights being $(1)$ or $(-1)$. We pursue the projection direction using the widely adopted maximum variance criterion to guarantee good space partitioning and find fewer coordinate axes to guarantee efficient partition function evaluation. We present a coordinate-wise enumeration algorithm to find the principal trinary-projection direction. In addition, we provide an extension using multiple randomized trees for improved performance. We justify our approach on large-scale local patch indexing and similar image search.
Index Terms:
trinary-projection trees,Approximate nearest neighbor search,KD trees
Citation:
Jingdong Wang, Naiyan Wang, You Jia, Jian Li, Gang Zeng, Hongbin Zha, Xian-Sheng Hua, "Trinary-Projection Trees for Approximate Nearest Neighbor Search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 2, pp. 388-403, Feb. 2014, doi:10.1109/TPAMI.2013.125
Usage of this product signifies your acceptance of the Terms of Use.