Efficient image concept indexing by harmonic & arithmetic profiles entropy

  • Authors:
  • Herve Glotin;Zhong-Qiu Zhao;Stephane Ayache

  • Affiliations:
  • Systems and Information Sciences Lab., UMR, CNRS and Univ. Sud-Toulon Var, France;Systems and Information Sciences Lab., UMR, CNRS and Univ. Sud-Toulon Var, France and Computer and Information School, Hefei Univ. of Technology, China;Fundamental Computer Science Lab., UMR, CNRS and Univ. Marseille, France

  • Venue:
  • ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose new efficient visual features called Profile Entropy Features (PEF), giving information on the structure of the image content, and defined as the entropy of the distribution of a projection of the pixels. We analyse two simple projection operators (arithmetic or harmonic mean), and two orientations (horizontal and vertical). PEF are fast to compute (10 images per sec. on a PentiumIV) and of small dimension. Moreover, we show on High Level Feature task in TrecVid2008 that PEF performs in average better than the features of the state of the art (usual color features, edge direction, Gabor, and Local Binary Pattern). Moreover, we show on another international image retrieval campaign, the Visual Concept Detection of ImageCLEF2008, that the arithmetic and harmonic projections give complementary informations, yielding to the third best rank system in the official run of this campaign. Other properties of the PEF are discussed.