Share Email Print
cover

Proceedings Paper

Triangle-inequality-based pruning algorithms with triangle tries
Author(s): Andrew P. Berman; Linda G. Shapiro
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A new class of algorithms, based on triangle inequality, has recently been proposed for use in content-based image retrieval. These algorithms rely on comparing a set of key images to the database images, and storing the computed distance distances. Query images are later compared to the keys, and the triangle inequality is used to speedily compute lower bounds on the distance from the query to each database image. This paper addresses the question of increasing performance of this algorithm, by the addition of a data structure known as the Triangle Trie.

Paper Details

Date Published: 17 December 1998
PDF: 10 pages
Proc. SPIE 3656, Storage and Retrieval for Image and Video Databases VII, (17 December 1998); doi: 10.1117/12.333855
Show Author Affiliations
Andrew P. Berman, Univ. of Washington (United States)
Linda G. Shapiro, Univ. of Washington (United States)


Published in SPIE Proceedings Vol. 3656:
Storage and Retrieval for Image and Video Databases VII
Minerva M. Yeung; Boon-Lock Yeo; Charles A. Bouman, Editor(s)

© SPIE. Terms of Use
Back to Top