Coding and comparison of DAG's as a novel neural structure with applications to on-line handwriting recognition

This paper applies directed acyclic graphs (DAGs) to a large class of (temporal) pattern recognition problems and other recognition problems where the data has a linear ordering. The data streams are coded (DAG-coded) into DAGs for robust segmentation. The similarity of two streams can be manifested...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1997-11, Vol.45 (11), p.2701-2708
Main Authors: Lin, I-Jong, Kung, Sun-Yuan
Format: Article
Language:English
Subjects:
Character recognition
Dynamic programming
Handwriting recognition
Heuristic algorithms
Hidden Markov models
Information processing
Pattern recognition
Robustness
Signal processing algorithms
Speech recognition
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper applies directed acyclic graphs (DAGs) to a large class of (temporal) pattern recognition problems and other recognition problems where the data has a linear ordering. The data streams are coded (DAG-coded) into DAGs for robust segmentation. The similarity of two streams can be manifested as the path matching score of the two corresponding DAGs. This paper also presents an efficient and robust dynamic programming algorithm for their comparisons (DAG-compare). Since the DAG-coding methodology directly provides a robust segmentation process, it can be applied recursively to create a novel system architecture. The DAG structure also allows adaptive restructuring, leading to a novel approach to neural information processing. By using these elementary operations on DAGs, we can recognize on average 94.0% (writer-dependent) of the isolated handwritten cursive characters. DAG-coding may also be applied to speech recognition or any other continuous streams where a robust multipath segmentation aids the recognition process.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.650096