Title
Best-Match Retrieval for Structured Images
Abstract
This paper propose a new methodology for fast best-match retrieval of structured images. A triangle inequality property for the tree-distance introduced by Oflazer [17] is proven. This property is, in turn, applied to obtain a saturation algorithm of the trie used to store the database of the collection of pictures. The new approach can be considered as a substantial optimization of Oflazer's technique and can be applied to the retrieval of homogeneous hierarchically structured objects of any kind. The new technique inscribes itself in the number of distance-based search strategies and it is of interest for the indexing and maintenance of large collections of historical and pictorial data. We demonstrate the proposed approach on an example and report data about the speed-up that it introduces in query processing. Direct comparison with MVP-trees algorithm is also presented.
Year
DOI
Venue
2001
10.1109/34.935845
IEEE Trans. Pattern Anal. Mach. Intell.
Keywords
Field
DocType
report data,mvp-trees algorithm,structured image,saturation algorithm,fast best-match retrieval,new methodology,structured images,best-match retrieval,pictorial data,new approach,new technique,image retrieval,data structures,indexing,information retrieval,triangle inequality,robustness,memory
Web search query,Data mining,Query language,Information retrieval,Query expansion,Computer science,Image retrieval,Search engine indexing,Trie,Concept search,Visual Word
Journal
Volume
Issue
ISSN
23
7
0162-8828
Citations 
PageRank 
References 
5
0.59
21
Authors
4
Name
Order
Citations
PageRank
A Ferro140626.71
G. Gallo222320.06
Rosalba Giugno381749.45
Alfredo Pulvirenti438823.92