Semantic identification: balancing between complexity and validity

  • Authors:
  • M. Falelakis;C. Diou;A. Delopoulos

  • Affiliations:
  • Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece

  • Venue:
  • EURASIP Journal on Applied Signal Processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

An efficient scheme for identifying semantic entities within data sets such as multimedia documents, scenes, signals, and so forth, is proposed in this work. Expression of semantic entities in terms of syntactic properties is modelled with appropriately defined finite automata, which also model the identification procedure. Based on the structure and properties of these automata, formal definitions of attained validity and certainty and also required complexity are defined as metrics of identification efficiency. The main contribution of the paper relies on organizing the identification and search procedure in a way that maximizes its validity for bounded complexity budgets and reversely minimizes computational complexity for a given required validity threshold. The associated optimization problem is solved by using dynamic programming. Finally, a set of experiments provides insight to the introduced theoretical framework.