Writer Adaptation for Online Handwriting Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Kernel-Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
The Effect of Large Training Set Sizes on Online Japanese Kanji and English Cursive Recognizers
IWFHR '02 Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02)
Comparing Adaptation Techniques for On-Line Handwriting Recognition
ICDAR '01 Proceedings of the Sixth International Conference on Document Analysis and Recognition
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
LIBSVM: A library for support vector machines
ACM Transactions on Intelligent Systems and Technology (TIST)
A comparison of methods for multiclass support vector machines
IEEE Transactions on Neural Networks
Modeling Transfer Relationships Between Learning Tasks for Improved Inductive Transfer
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Unsupervised writer adaptation of whole-word HMMs with application to word-spotting
Pattern Recognition Letters
Transfer metric learning by learning task relationships
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Transfer Metric Learning with Semi-Supervised Extension
ACM Transactions on Intelligent Systems and Technology (TIST)
| Hi-index | 0.00 |
We present a new approach to personalized handwriting recognition. The problem, also known as writer adaptation, consists of converting a generic (user-independent) recognizer into a personalized (user-dependent) one, which has an improved recognition rate for a particular user. The adaptation step usually involves user-specific samples, which leads to the fundamental question of how to fuse this new information with that captured by the generic recognizer. We propose adapting the recognizer by minimizing a regularized risk functional (a modified SVM) where the prior knowledge from the generic recognizer enters through a modified regularization term. The result is a simple personalization framework with very good practical properties. Experiments on a 100 class real-world data set show that the number of errors can be reduced by over 40% with as few as five user samples per character.