FI-Quadtree: A new data structure for content-oriented retrieval and fuzzy search

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

Abstract

In this paper, we focus on the problem of content-oriented retrieval in an image database. This problem can be interpreted as the search and the selection of images containing whichever pattern introduced beforehand by the user. We propose a data structure valid for this kind of manipulation, the Full Inverted Quadtree (FI-Quadtree). The structure represents a set of images within a single quadtree. We analyze the distribution of the data in the base, the operations of insertion, selection and we report some experimental results.

Cite

CITATION STYLE

APA

Cheiney, J. P., & Touir, A. (1991). FI-Quadtree: A new data structure for content-oriented retrieval and fuzzy search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 525 LNCS, pp. 23–32). Springer Verlag. https://doi.org/10.1007/3-540-54414-3_29

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