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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Vision and Pattern Recognition
Cite this
Handwritten character recognition using monotonic and continuous two-dimensional warping. / Uchida, Seiichi; Sakoe, Hiroaki.
Proceedings of the 5th International Conference on Document Analysis and Recognition, ICDAR 1999. IEEE Computer Society, 1999. p. 503-506 791834.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Handwritten character recognition using monotonic and continuous two-dimensional warping
AU - Uchida, Seiichi
AU - Sakoe, Hiroaki
PY - 1999/1/1
Y1 - 1999/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0001872457&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0001872457&partnerID=8YFLogxK
U2 - 10.1109/ICDAR.1999.791834
DO - 10.1109/ICDAR.1999.791834
M3 - Conference contribution
AN - SCOPUS:0001872457
SP - 503
EP - 506
BT - Proceedings of the 5th International Conference on Document Analysis and Recognition, ICDAR 1999
PB - IEEE Computer Society
ER -