Managing the complexity of match in retrieval by spatial arrangement

Author

Berretti, Stefano ; Del Bimbo, Alberto ; Vicario, Enrico

Author_Institution

Florence Univ., Italy

fYear

1999

fDate

1999

Firstpage

1178

Lastpage

1183

Abstract

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

Keywords

computational complexity; content-based retrieval; image matching; spatial data structures; state-space methods; tree data structures; tree searching; visual databases; complexity; graph-theoretical formulation; heuristic bounding; image database; image retrieval; matching algorithm; spatial arrangement; state-space search algorithms; user query; visual content; Content based retrieval; Content management; Electrical capacitance tomography; Hip; Image databases; Image retrieval; Spatial databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Analysis and Processing, 1999. Proceedings. International Conference on

Conference_Location

Venice

Print_ISBN

0-7695-0040-4

Type

conf

DOI

10.1109/ICIAP.1999.797763

Filename

797763