A geometric data structure applicable to image mining and retrieval

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

Abstract

Due to improvements in image acquisition and storage technology, terabyte-sized databases of images are nowadays common. This abundance of data leads us to two basic problems: how to exploit images (image mining)? Or how to make it accessible to human beings (image retrieval)? The specificity of image mining/retrieval among other similar topics (object recognition, machine vision, computer vision, etc.) is precisely that their techniques operate on the whole collection of images, not a single one. Under these circumstances, it is obvious that the time complexity of related algorithms plays an important role. In this paper, we suggest a novel general approach applicable to image mining and retrieval, using only compact geometric structures which can be pre-computed from a database. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Iwaszko, T., Melkemi, M., & Idoumghar, L. (2010). A geometric data structure applicable to image mining and retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6111 LNCS, pp. 364–373). https://doi.org/10.1007/978-3-642-13772-3_37

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