2009 10th International Conference on Document Analysis and Recognition 2009
DOI: 10.1109/icdar.2009.212
|View full text |Cite
|
Sign up to set email alerts
|

Learning and Adaptation for Improving Handwritten Character Recognizers

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…where Gðx; iÞ can be either (15) or (19), which can be viewed as a distance metric between x and class i. The top-1 output is then defined as the distance between x and its predicted classŷ, while the top-2 output is the distance from the most competing class:…”
Section: Confidence Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…where Gðx; iÞ can be either (15) or (19), which can be viewed as a distance metric between x and class i. The top-1 output is then defined as the distance between x and its predicted classŷ, while the top-2 output is the distance from the most competing class:…”
Section: Confidence Setupmentioning
confidence: 99%
“…For SVM adaptation, Kienzle and Chellapilla applied a biased regularization (a tradeoff between the new classifier and the original one) to retrain the classifier using the new writer-specific data [14]. Tewari and Namboodiri proposed an SVM-based multiple kernel learning method where the support vectors were adapted to better model the decision boundary of a specific writer [15]. For prototype classifier adaptation, Vuori and Korkeakoulu proposed three methods: adding new prototypes, reshaping existing prototypes, and inactivating poorly performing prototypes [16].…”
Section: Introductionmentioning
confidence: 99%
“…Also, we mention those which are based on HMM [18] and support vector machines like the system described in [19] where an adaptation was realized by re-learning the different SVMs using virtual examples. Add to that, the system in [20] applied an SVM based multiple kernel learning where support vectors were adapted to better model the decision boundary of a specific writer. Furthermore, we hold up systems which use adaptation methods without modifying the writer-independent system.…”
Section: Introductionmentioning
confidence: 99%
“…There have been great researches on the field of writer adaptation which can be classified in three groups: systems reorganizing the prototypes of the database (addition, modification and deletion) [10], [11], [12], systems updating the parameters of the recognition system [15], [14], [13], [16], [6] and systems adapting without modifying the classifier's parameters [7], [8], [1], [5].…”
Section: Introductionmentioning
confidence: 99%