Using a neighbourhood graph based on voronoï tessellation with DMOS, a generic method for structured document recognition

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To develop a method for structured document recognition, it is necessary to know the relative position of the graphical elements in a document. In order to deal with this notion, we build a neighbourhood graph based on Voronoï tessellation. We propose to combine the use of this interesting notion of neighbourhood with an existing generic document recognition method, DMOS, which has been used to describe various kinds of documents. This association allows exploiting different aspects of the neighbourhood graph, separating the graph analysis from the knowledge linked to a kind of document, and establishing a bidirectional context-based relation between the analyser and the graph. We apply this method on the analysis of various documents. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Lemaitre, A., Coüasnon, B., & Leplumey, I. (2006). Using a neighbourhood graph based on voronoï tessellation with DMOS, a generic method for structured document recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3926 LNCS, pp. 267–278). Springer Verlag. https://doi.org/10.1007/11767978_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free