Selecting Good Keys for Triangle-Inequality-Based Pruning Algorithms

Authors:
Andrew Berman;Linda G. Shapiro
Affiliations:
-;-
Venue:
CAIVD '98 Proceedings of the 1998 International Workshop on Content-Based Access of Image and Video Databases (CAIVD '98)
Year:
1998

Citing 0
Cited 2

Efficient Content-Based Image Retrieval: Experimental Results

CBAIVL '99 Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries
The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new class of algorithms based on the triangle in-equality has recently been proposed for use in content-based image retrieval. These algorithms rely on com-paring a set of key images to the database images, and storing the computed distances. Query images are later compared to the keys, and the triangle in-equality is used to speedily compute lower bounds on the distance from the query to each of the database images. This paper addresses the question of increasing performance of this algorithm by the selection of appropriate key images. Several algorithms for key selection are proposed and tested.