Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere

  • Kengo Terasawa
  • Yuzuru Tanaka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4619)


LSH (Locality Sensitive Hashing) is one of the best known methods for solving the c-approximate nearest neighbor problem in high dimensional spaces. This paper presents a variant of the LSH algorithm, focusing on the special case of where all points in the dataset lie on the surface of the unit hypersphere in a d-dimensional Euclidean space. The LSH scheme is based on a family of hash functions that preserves locality of points. This paper points out that when all points are constrained to lie on the surface of the unit hypersphere, there exist hash functions that partition the space more efficiently than the previously proposed methods. The design of these hash functions uses randomly rotated regular polytopes and it partitions the surface of the unit hypersphere like a Voronoi diagram. Our new scheme improves the exponent ρ, the main indicator of the performance of the LSH algorithm.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gionis, A., Indyk, P., Motwani, R.: Similarity Search in High Dimensions via Hashing. In: VLDB 1999. Proc. 25th International Conference on Very Large Data Bases, pp. 518–529 (1999)Google Scholar
  2. 2.
    Datar, M., Indyk, P., Immorlica, N., Mirrokni, V.: Locality-Sensitive Hashing Scheme Based on p-Stable Distributions. In: Proc. Symposium on Computational Geometry 2004, pp. 253–262 (2004)Google Scholar
  3. 3.
    Andoni, A., Indyk, P.: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. In: FOCS 2006. Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 459–468 (2006)Google Scholar
  4. 4.
    Lowe, D.G.: Object recognition from local scale-invariant features. In: ICCV 1999. Proc. 7th International Conference on Computer Vision, vol. 2, pp. 1150–1157 (1999)Google Scholar
  5. 5.
    Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)CrossRefGoogle Scholar
  6. 6.
    Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval. McGraw-Hill, New York (1983)zbMATHGoogle Scholar
  7. 7.
    Har-Peled, S.: A Replacement for Voronoi Diagrams of Near Linear Size. In: FOCS 2001. Proc. 42nd Annual Symposium on Foundations of Computer Science, pp. 94–103 (2001)Google Scholar
  8. 8.
    Leech, J.: Notes on sphere packings. Canadian Journal of Mathematics, 251–267 (1967)Google Scholar
  9. 9.
    Darrell, T., Indyk, P., Shakhnarovich, G. (eds.): Nearest Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, Cambridge (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kengo Terasawa
    • 1
  • Yuzuru Tanaka
    • 1
  1. 1.Meme Media Laboratory, Hokkaido University, N-13, W-8, Sapporo, 060–8628Japan

Personalised recommendations