Abstract
In this paper, a handwritten character recognition experiment using a monotonic and continuous two-dimensional warping algorithm is reported. This warping algorithm is based on dynamic programming and searches for the optimal pixel-to-pixel mapping between given two images subject to two-dimensional monotonicity and continuity constraints. Experimental comparisons with rigid matching and local perturbation show the performance superiority of the monotonic and continuous warping in character recognition.
Original language | English |
---|---|
Title of host publication | Proceedings of the 5th International Conference on Document Analysis and Recognition, ICDAR 1999 |
Publisher | IEEE Computer Society |
Pages | 503-506 |
Number of pages | 4 |
ISBN (Electronic) | 0769503187 |
DOIs | |
Publication status | Published - Jan 1 1999 |
Event | 5th International Conference on Document Analysis and Recognition, ICDAR 1999 - Bangalore, India Duration: Sep 20 1999 → Sep 22 1999 |
Other
Other | 5th International Conference on Document Analysis and Recognition, ICDAR 1999 |
---|---|
Country | India |
City | Bangalore |
Period | 9/20/99 → 9/22/99 |
All Science Journal Classification (ASJC) codes
- Computer Vision and Pattern Recognition