DocumentCode
2641828
Title
Similarity queries in image databases
Author
Santini, Simone ; Jain, Ramesh
Author_Institution
Dept. of Comput. Sci., California Univ., San Diego, La Jolla, CA, USA
fYear
1996
fDate
18-20 Jun 1996
Firstpage
646
Lastpage
651
Abstract
Query-by-content image database will be based on similarity, rather than on matching, where similarity is a measure that is defined and meaningful for every pair of images in the image space. Since it is the human user that, in the end, has to be satisfied with the results of the query, it is natural to base the similarity measure that we will use on the characteristics of human similarity assessment. In the first part of this paper, we review some of these characteristics and define a similarity measure based on them. Another problem that similarity-based databases will have to face is how to combine different queries into a single complex query. We present a solution based on three operators that are the analogous of the and, or, and not operators one uses in traditional databases. These operators are powerful enough to express queries of unlimited complexity, yet have a very intuitive behavior, making easy for the user to specify a query tailored to a particular need
Keywords
image matching; query formulation; query processing; visual databases; complex query; human similarity assessment; image database; query-by-content; similarity measure; unlimited complexity; Accidents; Computer science; Humans; Image databases; Information retrieval; Multimedia databases; Painting; Robustness; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 1996. Proceedings CVPR '96, 1996 IEEE Computer Society Conference on
Conference_Location
San Francisco, CA
ISSN
1063-6919
Print_ISBN
0-8186-7259-5
Type
conf
DOI
10.1109/CVPR.1996.517141
Filename
517141
Link To Document