Graphic Symbol recognition using flexible matching of attributed relational graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Graphic Symbol recognition using flexible matching of attributed relational graphs

Résumé

Many methods of graphics recognition have been developed throughout the years for the recognition of pre-segmented graphics symbols but very few techniques achieved the objective of symbol spotting and recognition together in a generic case. To go one step forward through this objective, this paper presents an original solution for symbol spotting using a graph representation of graphical documents. The proposed strategy has two main step. In the first step, a graph based representation of a document image is generated that includes selection of description primitives (nodes of the graph) and organisation of these features (edges). In the second step the graph is used to spot interesting parts of the image that potentially correspond to symbols. The sub-graphs associated to selected zones are then submitted to a graph matching algorithm in order to take the final decision and to recognize the class of the symbol. The experimental results obtained on different types of documents demonstrates that the system can handle different types of images without any modification.
Fichier non déposé

Dates et versions

hal-01026315 , version 1 (21-07-2014)

Identifiants

  • HAL Id : hal-01026315 , version 1

Citer

Rashid-Jalal Qureshi, Jean-Yves Ramel, Hubert Cardot. Graphic Symbol recognition using flexible matching of attributed relational graphs. International Conference on Visualization, Imaging, and Image Processing, Aug 2006, Palma De Mallorca, Spain. pp.383-388. ⟨hal-01026315⟩
62 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More