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

Loading next page...
 
/lp/springer_journal/dynamic-vp-tree-indexing-for-n-nearest-neighbor-search-given-pair-wise-VRgdIl768W
Publisher
Springer-Verlag
Copyright
Copyright © 2000 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
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 JournalSpringer Journals

Published: Jul 1, 2000

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off