SEGMENTATION OF MERGED CHARACTERS BY NEURAL NETWORKS AND SHORTEST-PATH

Authors
Citation
J. Wang et J. Jean, SEGMENTATION OF MERGED CHARACTERS BY NEURAL NETWORKS AND SHORTEST-PATH, Pattern recognition, 27(5), 1994, pp. 649-658
Citations number
22
Categorie Soggetti
Computer Sciences, Special Topics","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence
Journal title
ISSN journal
00313203
Volume
27
Issue
5
Year of publication
1994
Pages
649 - 658
Database
ISI
SICI code
0031-3203(1994)27:5<649:SOMCBN>2.0.ZU;2-9
Abstract
A major problem with a neural network-based approach to printed charac ter recognition is the segmentation of merged characters. A hybrid met hod is proposed which combines a neural network-based deferred segment ation scheme with conventional immediate segmentation techniques. In t he deferred segmentation, a neural network is employed to distinguish single characters from composites. To find a proper vertical cut that separates a composite, a shortest-path algorithm seeking minimal-penal ty curved cuts is used. Integrating those components with a multiresol ution neural network OCR and an efficient spelling checker, the result ing system significantly improves its ability to read omnifont documen t text.