Inexact Graph Matching for Entity Recognition in OCRed Documents

被引:0
|
作者
Kooli, Nihel [1 ]
Belaid, Abdel [1 ]
机构
[1] Univ Lorraine, LORIA, Campus Sci,BP 239, F-54506 Vandoeuvre Les Nancy, France
关键词
entity recognition; local structure; graph matching; mislabeling correction; structure model; graph clustering; PATTERN-RECOGNITION; ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes an entity recognition system in image documents recognized by OCR. The system is based on a graph matching technique and is guided by a database describing the entities in its records. The input of the system is a document which is labeled by the entity attributes. A first grouping of those labels based on a function score leads to a selected set of candidate entities. The entity labels which are locally close are modeled by a structure graph. This graph is matched with model graphs learned for this purpose. The graph matching technique relies on a specific cost function that integrates the feature dissimilarities. The matching results are exploited to correct the mislabeling errors and then validate the entity recognition task. The system evaluation on three datasets which treat different kind of entities shows a variation between 88.3% and 95% for recall and 94.3% and 95.7% for precision.
引用
收藏
页码:4071 / 4076
页数:6
相关论文
共 50 条
  • [1] An Analysis of the Performance of Named Entity Recognition over OCRed Documents
    Hamdi, Ahmed
    Jean-Caurant, Axel
    Sidere, Nicolas
    Coustaty, Mickael
    Doucet, Antoine
    2019 ACM/IEEE JOINT CONFERENCE ON DIGITAL LIBRARIES (JCDL 2019), 2019, : 333 - 334
  • [2] Inexact graph matching for structural pattern recognition
    Bunke, H.
    Allermann, G.
    PATTERN RECOGNITION LETTERS, 1983, 1 (04) : 245 - 253
  • [3] Inexact graph matching using a genetic algorithm for image recognition
    Auwatanamongkol, Surapong
    PATTERN RECOGNITION LETTERS, 2007, 28 (12) : 1428 - 1437
  • [4] Shape recognition from large image libraries by inexact graph matching
    Huet, B
    Hancock, ER
    PATTERN RECOGNITION LETTERS, 1999, 20 (11-13) : 1259 - 1269
  • [5] Inexact graph matching using stochastic optimization techniques for facial feature recognition
    Cesar, R
    Bengoetxea, E
    Bloch, I
    16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL II, PROCEEDINGS, 2002, : 465 - 468
  • [6] Shape retrieval by inexact graph matching
    Huet, B
    Cross, ADJ
    Hancock, ER
    IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS, PROCEEDINGS VOL 1, 1999, : 772 - 776
  • [7] Shape retrieval by inexact graph matching
    Huet, Benoit
    Cross, Andrew D.J.
    Hancock, Edwin R.
    International Conference on Multimedia Computing and Systems -Proceedings, 1999, 1 : 772 - 776
  • [8] Memetic algorithms for inexact graph matching
    Baerecke, Thomas
    Detyniecki, Marcin
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 4238 - 4245
  • [9] A new algorithm for inexact graph matching
    Hlaoui, A
    Wang, S
    16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITON, VOL IV, PROCEEDINGS, 2002, : 180 - 183
  • [10] Inexact graph matching using a hierarchy of matching processes
    Morrison P.
    Zou J.J.
    Computational Visual Media, 2015, 1 (4) : 291 - 307