 |
|
|
|
| HAL : hal-00493829, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| ICFHR 2010, Inde (2010) |
|
|
|
|
| Dealing with precise and imprecise decisions with a Dempster-Shafer Theory based algorithm in the context of handwriting recognition |
|
|
Thomas Burger 1Yousri Kessentini 2 |
|
|
| (2010) |
|
|
|
| The classification process in handwriting recognition is designed to provide lists of results rather than single results, so that context models can be used as post-processing. Most of the time, the length of the list is determined once and for all the items to classify. Here, we present a method based on Dempster-Shafer theory that allows a different length list for each item, depending on the precision of the information involved in the decision process. As it is difficult to compare the results of such an algorithm to classical accuracy rates, we also propose a generic evaluation methodology. Finally, this algorithm is evaluated on Latin and Arabic handwritten isolated word datasets. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC) |
|
|
|
CNRS : UMR3192 – Université de Bretagne Occidentale - Brest – Université de Bretagne Sud – Institut Télécom – Télécom Bretagne – Université européenne de Bretagne – Institut Supérieur des Sciences et Technologies de Brest (ISSTB) |
|
|
| 2 : | Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS) |
|
|
|
Institut National des Sciences Appliquées de Rouen – Université du Havre – Université de Rouen : EA4108 |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Traitement du texte et du document |
| hal-00493829, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00493829 | |
| oai:hal.archives-ouvertes.fr:hal-00493829 | |
| Contributeur : Thomas Burger | |
| Soumis le : Lundi 21 Juin 2010, 14:12:21 | |
| Dernière modification le : Lundi 21 Juin 2010, 14:12:21 | |
