3543 articles – 5276 Notices  [english version]

hal-00662559, version 1

Vers l'utilisation d'un Treillis de Galois Fréquent pour la Reconnaissance de Symboles Graphiques

Ameni Boumaiza (, http://qgar.loria.fr?) a1, Salvatore Tabbone () 1

Colloque International Francophone sur l'Écrit et le Document 2012 (CIFED) (2012)

Résumé : The design of a graphics recognition method is a complex task due the multiplity of symbols and its configurations in real applications. In this paper, we propose a new approach based on a new concept called the Galois lattice which is often used for supervised recognition of graphical symbols. The originality of this paper is to build a concept lattice not in terms of all the features of symbols, but in terms of the most frequent or the most relevant ones. Our approach consists firstly, to build a visual vocabulary containing the frequent visual words from descriptors calculted on the symbols learning set. These visual vectors are calculated at the stable neighborhood of random points chosen from a given symbol. Secondly, we propose a new approach for symbol recognition based on a frequent Galois lattice. The concept lattice obtained based on frequent patterns is trained and used as a supervised classifier for symbols. The experimental results show recognition capabilities of our method and its robustness to noise.

  • a –  LORIA
  • 1 :  QGAR (LORIA)
  • INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL) – CNRS : UMR7503
  • Collaboration : BARCELONE, ESPAGNE
  • Domaine : Sciences de l'ingénieur/Traitement du signal et de l'image
    Informatique/Traitement du signal et de l'image
  • Mots-clés : Classification – Reconnaissance – Symbole – Descripteur – Vocabulaire visuel – Treillis de Galois – Treillis de concepts – Apprentissage – Vote majoritaire – Extension – Intention
 
  • hal-00662559, version 1
  • oai:hal.inria.fr:hal-00662559
  • Contributeur : 
  • Soumis le : Mardi 24 Janvier 2012, 14:31:54
  • Dernière modification le : Mardi 24 Janvier 2012, 14:35:28