Triangle-inequality-based pruning algorithms with triangle tries

Andrew P. Berman; Linda G. Shapiro

doi:10.1117/12.333855

17 December 1998 Triangle-inequality-based pruning algorithms with triangle tries

Andrew P. Berman, Linda G. Shapiro

Proceedings Volume 3656, Storage and Retrieval for Image and Video Databases VII; (1998) https://doi.org/10.1117/12.333855
Event: Electronic Imaging '99, 1999, San Jose, CA, United States

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.

Citation Download Citation

Andrew P. Berman and Linda G. Shapiro "Triangle-inequality-based pruning algorithms with triangle tries", Proc. SPIE 3656, Storage and Retrieval for Image and Video Databases VII, (17 December 1998); https://doi.org/10.1117/12.333855

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available