Skip to main content

A Supremum Norm Based Near Neighbor Search in High Dimensional Spaces

  • Conference paper
Computer Vision and Graphics (ICCVG 2012)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7594))

Included in the following conference series:

  • 3561 Accesses

Abstract

This paper presents a new near neighbor search. Feature vectors to be stored do not have to be of equal length. Two feature vectors are getting compared with respect to supremum norm. Time demand to learn a new feature vector does not depend on the number of vectors already learned. A query is formulated not as a single feature vector but as a set of features which overcomes the problem of possible permutation of components in a representation vector. Components of a learned feature vector can be cut out - the algorithm is still capable to recognize the remaining part.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berchtold, S., Keim, D.A., Kriegel, H.-P., Seidl, T.: A new technique for nearest neighbor search in. IEEE TKDE (2000)

    Google Scholar 

  2. Bishop, C.: Neural Networks for Pattern Recognition. Oxford University Press (2007)

    Google Scholar 

  3. Caputo, B., Hornegger, J., Paulus, D., Niemann, H.: A spin-glass markov random field for 3d object recognition. In: NIPS (2000)

    Google Scholar 

  4. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access. In: VLDB (1997)

    Google Scholar 

  5. Guttman, A.: R-trees: A dynamic index structure for spatial. In: SIGMOD (2000)

    Google Scholar 

  6. Gyofri, L., Kohler, M., Krzyzak, A., Walk, H.: A Distribution-Free Theory of Nonparametric Regression. Springer (2002)

    Google Scholar 

  7. Nene, S.A., Nayar, S.K., Murase, H.: Columbia Object Image Library, COIL-100 (1996)

    Google Scholar 

  8. Obdrzalek, S., Matas, J.: Object recognition using local affine frames. In: BMVC (2011)

    Google Scholar 

  9. Pratt, W.: Digital Image Processing. Wiley (2001)

    Google Scholar 

  10. Rosenblatt, F.: Principles of Neurodynamics. Spartan, New York (1962)

    Google Scholar 

  11. Sergeev, N., Palm, G.: A new object recognition system. In: VISAPP (2011)

    Google Scholar 

  12. Shakhnarovish, Darrell, Indyk: Nearest-Neighbor Methods in Learning and Vision. MIT Press (2005)

    Google Scholar 

  13. Vapnik, V.N.: Statistical Learning Theory. Wiley, New York (1998)

    MATH  Google Scholar 

  14. Yang, M.-H., Roth, D., Ahuja, N.: Learning to Recognize 3D Objects with SNoW. In: Vernon, D. (ed.) ECCV 2000. LNCS, vol. 1842, pp. 439–454. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sergeev, N. (2012). A Supremum Norm Based Near Neighbor Search in High Dimensional Spaces. In: Bolc, L., Tadeusiewicz, R., Chmielewski, L.J., Wojciechowski, K. (eds) Computer Vision and Graphics. ICCVG 2012. Lecture Notes in Computer Science, vol 7594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33564-8_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33564-8_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33563-1

  • Online ISBN: 978-3-642-33564-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics