Authors:
Masami Shishibori
1
;
Samuel Sangkon Lee
2
and
Kenji Kita
1
Affiliations:
1
The University of Tokushima, Japan
;
2
Jeonju University, Korea, Republic of
Keyword(s):
Multimedia retrieval systems, Indexing technique, Vantage point tree, Triangule inequality.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Business Analytics
;
Data Analytics
;
Data Engineering
;
Foundations of Knowledge Discovery in Databases
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Mining High-Dimensional Data
;
Structured Data Analysis and Statistical Methods
;
Symbolic Systems
Abstract:
On multimedia databases, it is one of important techniques to use the efficient indexing method for the fast access. Metric indexing methods can apply for various distance measures other than the Euclidean distance. Then, metric indexing methods have higher flexibility than multi-dimensional indexing methods. We focus on the Vantage Point tree (VP-tree) which is one of the metric indexing methods. VP-tree is an efficient metric space indexing method, however the number of distance calculations at leaf nodes tends to increase. In this paper, we propose an efficient algorithm to reduce the number of distance calculations at leaf nodes of the VPtree. The conventional VP-tree uses the triangle inequality at the leaf node in order to reduce the number of distance calculations. At this point, the vantage point of the VP-tree is used as a reference point of the triangle inequality. The proposed algorithm uses the nearest neighbor (NN) point for the query instead of the vantage point as the
reference point. By using this method, the selection range by the triangle inequality becomes small, and the number of distance calculations at leaf nodes can be cut down. Moreover, it is impossible to specify the NN point in advance. Then, this method regards the nearest point to the query in the result buffer as the temporary NN point. If the nearer point is found on the retrieval process, the temporary NN point is replaced with new one. From evaluation experiments using 10,000 image data, it was found that our proposed method could cut 5%12% of search time of the conventional VP-tree.
(More)