๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximate similarity retrieval with M-trees

โœ Scribed by Pavel Zezula; Pasquale Savino; Giuseppe Amato; Fausto Rabitti

Book ID
106234878
Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
259 KB
Volume
7
Category
Article
ISSN
1066-8888

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Similarity Retrieval by 2D C-Trees Match
Similarity Retrieval by 2D C-Trees Matching in Image Databases
โœ Fang-Jung Hsu; Suh-Yin Lee; Bao-Shuh Lin ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 905 KB

Logical features are abstract representations of images at various levels of detail. Some logical features such as spa- The image retrieval based on spatial content is an attracting task in many image database applications. The 2D strings protial-location and spatial-relation [18] may be synthesize

Video indexing and similarity retrieval
Video indexing and similarity retrieval by largest common subgraph detection using decision trees
โœ Kim Shearer; Horst Bunke; Svetha Venkatesh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 349 KB

While the largest common subgraph (LCSG) between a query and a database of models can provide an elegant and intuitive measure of similarity for many applications, it is computationally expensive to compute. Recently developed algorithms for subgraph isomorphism detection take advantage of prior kno