Efficient content-based retrieval: experimental results
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Extensive testing has shown that the bare-bones triangle inequality algorithm could be used to sharply reduce the number of images needed to be directly compared to a query image for a given distance measure, and that adding the triangle-trie for a two-stage algorithm can be used to search for matches faster than even the bare-bones triangle inequality algorithm. We have developed a method for using the triangle inequality algorithm for combinations of distance measures, thus allowing for database systems which combine flexibility and speed. There are a number of open problems concerning the various data structures and algorithms we describe: key selection, number of keys, trie depth and bin size. More generally, the statistical behavior of distance measures over different sets of images influences the behavior of all the algorithms, and this needs to be explored Author(s) Berman, A.P. Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA Shapiro, L.G.Keywords
This publication has 8 references indexed in Scilit:
- Selecting good keys for triangle-inequality-based pruning algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A flexible image database system for content-based retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Triangle-inequality-based pruning algorithms with triangle triesPublished by SPIE-Intl Soc Optical Eng ,1998
- Fuzzy queries in multimedia database systemsPublished by Association for Computing Machinery (ACM) ,1998
- Using the triangle inequality to reduce the number of comparisons required for similarity-based retrievalPublished by SPIE-Intl Soc Optical Eng ,1996
- Query by image and video content: the QBIC systemComputer, 1995
- Proximity matching using fixed-queries treesPublished by Springer Nature ,1994
- Some approaches to best-match file searchingCommunications of the ACM, 1973