Efficient shape retrieval by parts

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Modern visual information retrieval systems support retrieval by directly addressing image visual features such as color, texture, shape and spatial relationships. However, combining useful representations and similarity models with efficient index structures is a problem that has been largely underestimated. This problem is particularly challenging in the case of retrieval by shape similarity. In this paper we discuss retrieval by shape similarity, using local features and metric indexing. Shape is partitioned into tokens in correspondence with its protrusions, and each token is modeled by a set of perceptually salient attributes. Two distinct distance functions are used to model token similarity and shape similarity. Shape indexing is obtained by ar- ranging tokens into a M-tree index structure. Examples from a prototype system are expounded with considerations about the effectiveness of the approach.

Cite

CITATION STYLE

APA

Berretti, S., Del Bimbo, A., & Pala, P. (1999). Efficient shape retrieval by parts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1689, pp. 57–64). Springer Verlag. https://doi.org/10.1007/3-540-48375-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free