A geometric data structure applicable to image mining and retrieval

  • Authors:
  • T. Iwaszko;Mahmoud Melkemi;L. Idoumghar

  • Affiliations:
  • Université de Haute Alsace, lmia-mage, Mulhouse, France;Université de Haute Alsace, lmia-mage, Mulhouse, France;Université de Haute Alsace, lmia-mage, Mulhouse, France

  • Venue:
  • ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.