35 research outputs found

    De l'appariement de graphes symboliques à l'appariement de graphes numériques : Application à la reconnaissance de symboles

    Get PDF
    Les reprĂ©sentations sous forme de graphes structurels ont Ă©tĂ© appliquĂ©es dans un grand nombre de problĂšmes en vision par ordinateur et en reconnaissance de formes. NĂ©anmoins, lors de l'Ă©tape d'appariement de graphes, les algorithmes classiques d'isomorphisme de graphes sont peu performants quand l'image est dĂ©gradĂ©e par du bruit ou des distorsions vectorielles. Cet article traite de la reconnaissance de symboles graphiques grĂące Ă  la formulation d'une nouvelle mesure de similaritĂ© entre leur reprĂ©sentation sous forme de graphes Ă©tiquetĂ©s. Dans l'approche proposĂ©e, les symboles sont d'abord dĂ©composĂ©s en primitives structurelles et un graphe attribuĂ© est alors gĂ©nĂ©rĂ© pour dĂ©crire chaque symbole. Les nƓuds du graphe reprĂ©sentent les primitives structurelles tandis que les arcs dĂ©crivent les relations topologiques entre les primitives. L'utilisation d'attributs numĂ©riques pour caractĂ©riser les primitives et leurs relations permet d'allier prĂ©cision et, invariance Ă  la rotation et au changement d'Ă©chelle. Nous proposons Ă©galement une nouvelle technique d'appariement de graphes basĂ©e sur notre fonction de similaritĂ© qui utilise les valeurs numĂ©riques des attributs pour produire un score de similaritĂ©. Cette mesure de similaritĂ© a de nombreuses propriĂ©tĂ©s intĂ©ressantes comme un fort pouvoir de discrimination, une invariance aux transformations affines et une faible sensibilitĂ© au bruit

    Pattern recognition and complex graphic symbols recognition in documents images

    No full text
    Ce travail de thĂšse se situe Ă  la croisĂ©e de trois thĂ©matiques de recherche : la mise en place de reprĂ©sentations structurelles pour dĂ©crire le contenu d’images de documents, la reconnaissance structurelle des formes et graphiques complexes et la localisation des symboles dans les images de documents. Pour rĂ©pondre aux problĂ©matiques de l’analyse d’images de documents, nous avons choisi d’utiliser les graphes comme outils de reprĂ©sentation des contenus des images. La nouvelle reprĂ©sentation obtenue exploite un graphe multi-primitive et multi-attribut amĂ©liorant Ă  la fois la tĂąche de localisation mais aussi la tĂąche de reconnaissance de formes graphiques contenues dans les documents. Une nouvelle approche gĂ©nĂ©rique et automatique est Ă©galement prĂ©sentĂ©e pour la localisation des symboles graphiques dans les images de documents. Notre approche de localisation des symboles nĂ©cessite un minimum de connaissances a priori sur les domaines ou sur le type de symboles prĂ©sents dans les images. Concernant l’étape de reconnaissance, nous prĂ©sentons trois stratĂ©gies originales pour la mise en correspondance de graphes, combinant les approches structurelle et statistique. Elles aident Ă  la rĂ©solution du problĂšme de complexitĂ© et Ă©vitent un temps de calcul exponentiel intolĂ©rable. Les nouvelles techniques d’appariement de graphes que nous proposons sont basĂ©es sur des fonctions de similaritĂ© qui tilisent aussi bien des valeurs numĂ©riques que symboliques pour produire un score. Ces mesures de similaritĂ© ont de nombreuses propriĂ©tĂ©s intĂ©ressantes comme un fort pouvoir discriminant, une invariance aux transformations affines et une faible sensibilitĂ© au bruit.This thesis presents our contributions related to three major research areas in the field of document image analysis i.e., structural representation of documents images, spotting symbols in graphical documents and symbols recognition. We proposed to represent the contents of the document images using multi-attributed graphs, which not only improves the task of symbols spotting, but also the task of symbols recognition. We present a new generic and automatic approach for the purpose of spotting symbols in graphical documents. Our approach to locate symbols requires minimum priori knowledge about the type of document or the type of symbols found in these documents. Concerning symbol recognition we present three new strategies combining structural and statistical approaches. The proposed approaches helped to solve the problem of time and space complexity and offers robustness against noise and distortion present in images. The new graph matching techniques that we are proposing are based on similarity function that uses both numerical and symbolic values of the nodes and edges attributes of the graphs to produce a score of similarity between two graphs. These similarity measures have many interesting properties such as a strong discriminating power, nvariance to affine transformations, and low sensitivity to noise

    Graphic Symbol recognition using flexible matching of attributed relational graphs

    No full text
    International audienceMany 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

    Graph Based Shapes Representation and Recognition

    No full text
    International audienceIn this paper, we propose to represent shapes by graphs. Based on graphic primitives extracted from the binary images, attributed relational graphs were generated. Thus, the nodes of the graph represent shape primitives like vectors and quadrilaterals while arcs describing the mutual primitives relations. To be invariant to transformations such as rotation and scaling, relative geometric features extracted from primitives are associated to nodes and edges as attributes. Concerning graph matching, due to the fact of NP-completeness of graph-subgraph isomorphism, a considerable attention is given to different strategies of inexact graph matching. We also present a new scoring function to compute a similarity score between two graphs, using the numerical values associated to the nodes and edges of the graphs. The adaptation of a greedy graph matching algorithm with the new scoring function demonstrates significant performance improvements over traditional exhaustive searches of graph matching

    Combination of Symbolic and Statistical Features for Symbols Recognition

    No full text
    International audienceIn this article, we have tried to explore a new hybrid approach which well integrates the advantages of structural and statistical approaches and avoids their weaknesses. In the proposed approach, the graphic symbols are first segmented into high-level primitive like quadrilaterals. Then, a graph is built by utilizing these quadrilaterals as nodes and their spatial relationships as edges. Additional information like relative length of the quadrilaterals and their relative angles with neighbouring quadrilaterals are associated as attributes to the nodes and edges of the graph respectively. However, the observed graphs are subject to deformations due to noise and/or vectorial distortion (in case of hand-drawn images) hence differs somewhat from their ideal models by either missing or extra nodes and edges appearance. Therefore, we propose a method that computes a measure of similarity between two given graphs instead of looking for exact isomorphism. The approach is based on comparing feature vectors extracted from the graphs. The idea is to use features that can be quickly computed from a graph on the one hand, but are, on the other hand, effective in discriminating between the various graphs in the database. The nearest neighbour rule is used as a classifier due to its simplicity and good behaviou
    corecore