DocumentCode :
2450264
Title :
A look-ahead strategy for graph matching in retrieval by spatial arrangement
Author :
Berretti, S. ; Del Bimbo, A. ; Vicario, Enrico
Author_Institution :
Dipt. Sistemi e Inf., Firenze Univ., Italy
Volume :
3
fYear :
2000
fDate :
2000
Firstpage :
1721
Abstract :
Image retrieval by spatial arrangement underlies a matching problem for the interpretation of entities specified in the user query on the entities appearing in the image of the database, and for the joint comparison of their features and spatial relationships. We provide a graph-theoretical formulation and discuss the size of the problem of spatial matching as encountered in the specific application context of retrieval by visual content. We then expound and evaluate an original state-space search algorithm which supports efficient comparison of models through an heuristic bounding approach
Keywords :
content-based retrieval; database theory; graph theory; image matching; visual databases; graph matching; graph theory; heuristic bounding; image database; image retrieval; look-ahead strategy; retrieval by spatial arrangement; spatial matching; state-space search algorithm; visual content based retrieval; Content based retrieval; Error correction; Image databases; Image retrieval; Image segmentation; Information retrieval; Pixel; Shape; Spatial databases; Visual databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on
Conference_Location :
New York, NY
Print_ISBN :
0-7803-6536-4
Type :
conf
DOI :
10.1109/ICME.2000.871104
Filename :
871104
Link To Document :
بازگشت