An On-Line Handwriting Recognition System Using Fisher Segmental Matching and Hypotheses Propagation Network
Abstract
We propose an on-line handwriting recognition approach that integrates local bottom-up constructs with a global top-down measure into a modular recognition engine. The bottom-up process uses local point features for hypothesizing character segmentations and the top-down part performs shape matching for evaluating the segmentations. The shape comparison, called Fisher segmental matching, is based on Fisher's linear discriminant analysis. Along with an efficient ligature modeling, the segmentations and their matching scores are integrated into a recognition engine termed Hypotheses Propagation Network, which runs a variant of the topological sort algorithm of graph search. The result is a system that is more shape-oriented less dependent on local and temporal features, modular in construction and has a rich range of opportunities for further extensions. Our system currently performs at 95% of recognition rate on cursive scripts with a 460 word dictionary.
Cite
Text
Oh and Geiger. "An On-Line Handwriting Recognition System Using Fisher Segmental Matching and Hypotheses Propagation Network." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000. doi:10.1109/CVPR.2000.854843Markdown
[Oh and Geiger. "An On-Line Handwriting Recognition System Using Fisher Segmental Matching and Hypotheses Propagation Network." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000.](https://mlanthology.org/cvpr/2000/oh2000cvpr-line/) doi:10.1109/CVPR.2000.854843BibTeX
@inproceedings{oh2000cvpr-line,
title = {{An On-Line Handwriting Recognition System Using Fisher Segmental Matching and Hypotheses Propagation Network}},
author = {Oh, Jong and Geiger, Davi},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2000},
pages = {2343-2348},
doi = {10.1109/CVPR.2000.854843},
url = {https://mlanthology.org/cvpr/2000/oh2000cvpr-line/}
}