loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th International Conference on Image Analysis and Processing (ICIAP'99)
Managing the Complexity of Match in Retrieval by Spatial Arrangement
Venice, Italy
September 27-September 29
ISBN: 0-7695-0040-4
Image retrieval by spatial arrangement underlies a matching algorithm, which ``interprets'' entities specified in the user query on the entities appearing in the image of the database, and which jointly compares their features and their spatial relationships.In this paper, we provide a graph-theoretical formulation and we discuss the size for the problem of spatial matching as encountered in the specific application context of retrieval by visual content. We then expound and evaluate three state-space search algorithms which support efficient comparison of models through a heuristic bounding approach.
Citation:
S. Berretti, A. Del Bimbo, E. Vicario, "Managing the Complexity of Match in Retrieval by Spatial Arrangement," iciap, pp.1178, 10th International Conference on Image Analysis and Processing (ICIAP'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.