A Constraint Satisfaction framework in Document Recognition - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

A Constraint Satisfaction framework in Document Recognition

Résumé

In this paper, the Grammatical inference (GI) is considered as an instance of the Constraint Satisfaction Problem (CSP), and a Constraint Logic Program (CLP) is proposed which instantiates automata in a lattice. In this task, the inference engine takes as input a set of individual positive and negative examples of documents and outputs a set of rules that recognises similar documents. In the theoretical outline, the Pattern Recognition and the GI problems are considered in an algebraic framework in which a set of constraints will define the process of generalisation. The CLP implementation discussed here is used in a document handling project in which (paper) documents are typographically tagged and then recognised. The main aim is to extract the physical and the logical structures of a given set of (paper) documents in order to produce a machine readable form like XML, HTML or TeX format.
Fichier non déposé

Dates et versions

hal-01596242 , version 1 (27-09-2017)

Identifiants

  • HAL Id : hal-01596242 , version 1

Citer

Alexandre Saidi. A Constraint Satisfaction framework in Document Recognition. European Conf on Machine Learning and Principales and Pratctice of Knowledge Discovery, ECML-PKDD'03, Sep 2003, Cavtat-Dubrovnik, Croatia. pp.31-44. ⟨hal-01596242⟩
80 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More