1996 · 45 citations · 6 references
ComputingComputer ScienceAlgorithmsComputational GeometryNatural Language ProcessingOptical Character RecognitionPattern RecognitionWord RecognitionCurvatureHandwriting RecognitionHandwritten Character RecognitionSkeletonizationTraveling Salesman ApproximationTraveling Salesman Problem
Off-line handwriting recognition is constrained by the lack of time information. This paper describes an approach to derive sequence information from a written word. The underlying representation of the word used is a graph with nodes and edges resulting from a skeletonization process. The writing path is reconstructed by assuming that the writer has used a path with least curvature, i.e. reconstruction is realized as a global optimization process, which consists of solving a travelling salesman problem.
6
A thinning algorithm by contour generation
P.C.K. Kwok · Communications of the ACM · 1988 · 99 citations · Full text
Recovering dynamic information from static handwriting
Giuseppe Boccignone, A. Chianese, L.P. Cordella et al. · Pattern Recognition · 1993 · 99 citations
Recovery of temporal information from static images of handwriting
D.S. Doermann, A. Rosenfeld · 2003 · 35 citations