FAST NEAREST NEIGHBOR SEARCH IN PSEUDOSEMIMETRIC SPACES

Markus Lessmann, Rolf P. Würtz

Abstract

Nearest neighbor search in metric spaces is an important task in pattern recognition because it allows a query pattern to be associated with a known pattern from a learned dataset. In low-dimensional spaces a lot of good solutions exist that minimize the number of comparisons between patterns by partitioning the search space using tree structures. In high-dimensional spaces tree methods become useless because they fail to prevent scanning almost the complete dataset. Locality sensitive hashing methods solve the task approximately by grouping patterns that are nearby in search space into buckets. Therefore an appropriate hash function has to be known that is highly likely to assign a query pattern to the same bucket as its nearest neighbor. This works fine as long as all the patterns are of the same dimensionality and exist in the same vector space with a complete metric. Here, we propose a locality-sensitive hashing-scheme that is able to process patterns which are built up of several possibly missing subpatterns causing the patterns to be in vector spaces of different dimensionality. These patterns can only be compared using a pseudosemimetric.

References

  1. Bentley, J. L. (1975). Multidimensional binary search trees used for associative searching. Commun. ACM, 18:509-517.
  2. Datar, M., Immorlica, N., Indyk, P., and Mirrokni, V. S. (2004). Locality-sensitive hashing scheme based on p-stable distributions. In Proc. SCG 7804, pages 253- 262, ACM.
  3. Dong, W. (2011). LSHKIT: A C++ locality sensitive hashing library. http://lshkit.sourceforge.net/index.html.
  4. Giacinto, G. (2007). A nearest-neighbor approach to relevance feedback in content based image retrieval. In Proc. CIVR 7807, pages 456-463, ACM.
  5. INTEL (2011). Intel math kernel library. http://software. intel.com/en-us/intel-mkl/.
  6. Lades, M., Vorbrüggen, J. C., Buhmann, J., Lange, J., von der Malsburg, C., W ürtz, R. P., and Konen, W. (1993). Distortion invariant object recognition in the dynamic link architecture. IEEE Trans. Comp., 42(3):300-311.
  7. Lv, Q., Josephson, W., Wang, Z., Charikar, M., and Li, K. (2007). Multi-probe lsh: efficient indexing for highdimensional similarity search. In Proc. VLDB 7807, pages 950-961. VLDB Endowment.
  8. Sankar K., P., Jawahar, C. V., and Manmatha, R. (2010). Nearest neighbor based collection OCR. In Proc. DAS 7810, pages 207-214, New York, NY, USA. ACM.
  9. Westphal, G. and W ürtz, R. P. (2009). Combining featureand correspondence-based methods for visual object recognition. Neural Computation, 21(7):1952-1989.
  10. W ürtz, R. P. (1997). Object recognition robust under translations, deformations and changes in background. IEEE Trans. PAMI, 19(7):769-775.
Download


Paper Citation


in Harvard Style

Lessmann M. and P. Würtz R. (2012). FAST NEAREST NEIGHBOR SEARCH IN PSEUDOSEMIMETRIC SPACES . In Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2012) ISBN 978-989-8565-03-7, pages 667-674. DOI: 10.5220/0003809006670674


in Bibtex Style

@conference{visapp12,
author={Markus Lessmann and Rolf P. Würtz},
title={FAST NEAREST NEIGHBOR SEARCH IN PSEUDOSEMIMETRIC SPACES},
booktitle={Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2012)},
year={2012},
pages={667-674},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003809006670674},
isbn={978-989-8565-03-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2012)
TI - FAST NEAREST NEIGHBOR SEARCH IN PSEUDOSEMIMETRIC SPACES
SN - 978-989-8565-03-7
AU - Lessmann M.
AU - P. Würtz R.
PY - 2012
SP - 667
EP - 674
DO - 10.5220/0003809006670674