In this paper, we describe a flexible and efficient system for processing forms of a known class. The model is based on attributed relational graphs and the system performs form registration and location of information fields using algorithms based on the hypothesize-and-verify paradigm. A special emphasis has been placed at the low level, where an autoassociator-based connectionist model has exhibited successful results in finding the instruction fields in very noisy forms. © 1995 IEEE.
Cesarini, F., Gori, M., Marinai, S., Soda, G. (1995). A system for data extraction from forms of known classProceedings of 3rd International Conference on Document Analysis and Recognition. In Proceedings of 3rd International Conference on Document Analysis and Recognition (pp.1136-1140). IEEE [10.1109/ICDAR.1995.602120].
A system for data extraction from forms of known classProceedings of 3rd International Conference on Document Analysis and Recognition
Gori M.;
1995-01-01
Abstract
In this paper, we describe a flexible and efficient system for processing forms of a known class. The model is based on attributed relational graphs and the system performs form registration and location of information fields using algorithms based on the hypothesize-and-verify paradigm. A special emphasis has been placed at the low level, where an autoassociator-based connectionist model has exhibited successful results in finding the instruction fields in very noisy forms. © 1995 IEEE.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/36050
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo