Advertisement

An Efficient Indexing Scheme Based on Linked-Node m-Ary Tree Structure

  • The-Anh Pham
  • Sabine Barrat
  • Mathieu Delalandre
  • Jean-Yves Ramel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8156)

Abstract

Fast nearest neighbor search is a crucial need for many recognition systems. Despite the fact that a large number of indexing algorithms have been proposed in the literature, few of them (e.g., randomized KD-trees, hierarchical K-means tree, randomized clustering trees, and LHS-based schemes) have been well validated on extensive experiments to give satisfactory performance on specific benchmarks. In this work, we propose a linked-node m-ary tree (LM-tree) algorithm, which works really well for both exact and approximate nearest neighbor search. The main contribution of the LM-tree is three-fold. First, a new polar-space-based method of data decomposition is presented to construct the LM-tree. Second, a novel pruning rule is proposed to efficiently narrow down the search space. Finally, a bandwidth search method is introduced to explore the nodes of the LM-tree. Our experiments, applied to one million 128-dimensional SIFT features and 250000 960-dimensional GIST features, showed that the proposed algorithm gives the best search performance, compared to the aforementioned algorithms.

Keywords

Image Indexing Locality-Sensitive Hashing Clustering Trees 

References

  1. 1.
    Beis, J.S., Lowe, D.G.: Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition, CVPR 1997, pp. 1000–1006 (1997)Google Scholar
  2. 2.
    Böhm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3), 322–373 (2001)CrossRefGoogle Scholar
  3. 3.
    Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3(3), 209–226 (1977)CrossRefzbMATHGoogle Scholar
  4. 4.
    Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput. 24(7), 750–753 (1975)Google Scholar
  5. 5.
    Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604–613 (1998)Google Scholar
  6. 6.
    Jégou, H., Douze, M., Schmid, C.: Product Quantization for Nearest Neighbor Search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117–128 (2011)CrossRefGoogle Scholar
  7. 7.
    Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing. IEEE Trans. Pattern Anal. Mach. Intell. 34(6), 1092–1104 (2012)CrossRefGoogle Scholar
  8. 8.
    Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 950–961 (2007)Google Scholar
  9. 9.
    McNames, J.: A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Trans. Pattern Anal. Mach. Intell. 23(9), 964–976 (2001)CrossRefGoogle Scholar
  10. 10.
    Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: VISAPP International Conference on Computer Vision Theory and Applications, pp. 331–340 (2009)Google Scholar
  11. 11.
    Muja, M., Lowe, D.G.: Fast matching of binary features. In: Proceedings of the Ninth Conference on Computer and Robot Vision, pp. 404–410 (2012)Google Scholar
  12. 12.
    Silpa-Anan, C., Hartley, R.: Optimised kd-trees for fast image descriptor matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2008), pp. 1–8 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • The-Anh Pham
    • 1
  • Sabine Barrat
    • 1
  • Mathieu Delalandre
    • 1
  • Jean-Yves Ramel
    • 1
  1. 1.PolytechToursToursFrance

Personalised recommendations