A flexible image database system for content-based retrieval
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (10514651) , 894-898
- https://doi.org/10.1109/icpr.1998.711295
Abstract
There is a growing need for the ability to query image databases based on similarity of image content rather than strict keyword search. As distance computations can be expensive, there is a need for indexing systems and algorithms that can eliminate candidate images without performing distance calculations. As user needs may change from session to session, there is also a need for run-time creation of distance measures. In this paper we present FIDS (flexible image database system). FIDS allows the user to query the database based on complex combinations of dozens of pre-defined distance measures. Using an indexing scheme and algorithms based on the triangle inequality, FIDS can often return matches to the query image without directly comparing the query image to more than a small percentage of the database.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
- Efficient image retrieval with multiple distance measuresPublished by SPIE-Intl Soc Optical Eng ,1997
- Locating deciduous treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- 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
- Satisfying general proximity / similarity queries with metric treesInformation Processing Letters, 1991
- Some approaches to best-match file searchingCommunications of the ACM, 1973