Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances

Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances The VLDB Journal (2000) 9: 154–173 The VLDB Journal c Springer-Verlag 2000 Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances Ada Wai-chee Fu, Polly Mei-shuen Chan, Yin-Ling Cheung, Yiu Sang Moon Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong; e-mail: adafu@cse.cuhk.edu.hk Edited by T. Ozsu and S. Christodoulakis. Received June 9, 1998 / Accepted January 31, 2000 Abstract. For some multimedia applications, it has been a collection of images, users can use existing images as found that domain objects cannot be represented as feature query templates and ask the system for images similar to vectors in a multidimensional space. Instead, pair-wise dis- the query images. This is the so-called “like-this” query. tances between data objects are the only input. To support Alternatively, the user can sketch a picture that serves as content-based retrieval, one approach maps each object to the query template. a k-dimensional (k-d) point and tries to preserve the dis- To support content-based retrieval, often we have to rely tances among the points. Then, existing spatial access index on feature extraction capabilities to map each domain ob- methods such as the R-trees and KD-trees can support fast ject into http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances

Download PDF
20 pages

Loading next page...
 
/lp/springer_journal/dynamic-vp-tree-indexing-for-n-nearest-neighbor-search-given-pair-wise-VRgdIl768W

References (39)

Publisher
Springer Journals
Copyright
Copyright © 2000 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
DOI
10.1007/PL00010672
Publisher site
See Article on Publisher Site

Abstract

The VLDB Journal (2000) 9: 154–173 The VLDB Journal c Springer-Verlag 2000 Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances Ada Wai-chee Fu, Polly Mei-shuen Chan, Yin-Ling Cheung, Yiu Sang Moon Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong; e-mail: adafu@cse.cuhk.edu.hk Edited by T. Ozsu and S. Christodoulakis. Received June 9, 1998 / Accepted January 31, 2000 Abstract. For some multimedia applications, it has been a collection of images, users can use existing images as found that domain objects cannot be represented as feature query templates and ask the system for images similar to vectors in a multidimensional space. Instead, pair-wise dis- the query images. This is the so-called “like-this” query. tances between data objects are the only input. To support Alternatively, the user can sketch a picture that serves as content-based retrieval, one approach maps each object to the query template. a k-dimensional (k-d) point and tries to preserve the dis- To support content-based retrieval, often we have to rely tances among the points. Then, existing spatial access index on feature extraction capabilities to map each domain ob- methods such as the R-trees and KD-trees can support fast ject into

Journal

The VLDB Journal – Springer Journals

Published: Jul 1, 2000

There are no references for this article.