论文信息 - VP-tree: Content-Based Image Indexing

VP-tree: Content-Based Image Indexing

Recently, a lot of indexing methods were developed for multidimensional spaces and for image feature vector spaces in particular. This paper introduces an implementation of a vantage point tree method. The goal is to define dependencies between method's parameters and index efficiency criteria in the context of the content-based image retrieval task.

Ilya Markov

[1] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[2] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[3] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[4] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.

[5] Tzi-cker Chiueh,et al. Content-Based Image Indexing , 1994, VLDB.

[6] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[7] Z. Meral Özsoyoglu,et al. Distance-based indexing for high-dimensional metric spaces , 1997, SIGMOD '97.

[8] Shin'ichi Satoh,et al. The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[9] Ada Wai-Chee Fu,et al. Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances , 2000, The VLDB Journal.

[10] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.