DocumentCode :
285308
Title :
Shortest path segmentation: a method for training a neural network to recognize character strings
Author :
Burges, C.J.C. ; Matan, O. ; Cun, Y. Le ; Denker, J.S. ; Jackel, L.D. ; Stenard, C.E. ; Nohl, C.R. ; Ben, J.I.
Author_Institution :
AT&T Bell Labs., Holmdel, NJ, USA
Volume :
3
fYear :
1992
fDate :
7-11 Jun 1992
Firstpage :
165
Abstract :
The authors describe a method which combines dynamic programming and a neural network recognizer for segmenting and recognizing character strings. The method selects the optimal consistent combination of cuts from a set of candidate cuts generated using heuristics. The optimal segmentation is found by representing the image, the candidate segments, and their scores as a graph in which the shortest path corresponds to the optimal interpretation. The scores are given by neural net outputs for each segment. A significant advantage of the method is that the labor required to segment images manually is eliminated. The system was trained on approximately 7000 unsegmented handwritten zip codes provided by the United States Postal Service. The system has achieved a per-zip-code raw recognition rate of 81% on a 2368 handwritten zip-code test set
Keywords :
dynamic programming; heuristic programming; image segmentation; learning (artificial intelligence); neural nets; optical character recognition; character string recognition; dynamic programming; heuristics; neural network training; optimal segmentation; postcodes; shortest path segmentation; unsegmented handwritten zip codes; Character generation; Character recognition; Computer errors; Computer science; Dynamic programming; Error correction codes; Image segmentation; Neural networks; Postal services; System testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1992. IJCNN., International Joint Conference on
Conference_Location :
Baltimore, MD
Print_ISBN :
0-7803-0559-0
Type :
conf
DOI :
10.1109/IJCNN.1992.227175
Filename :
227175
Link To Document :
بازگشت