Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0031-3203(01)00237-0
DC FieldValue
dc.titleCombination of multiple classifiers using probabilistic dictionary and its application to postcode recognition
dc.contributor.authorLu, Y.
dc.contributor.authorTan, C.L.
dc.date.accessioned2013-07-04T07:29:05Z
dc.date.available2013-07-04T07:29:05Z
dc.date.issued2002
dc.identifier.citationLu, Y., Tan, C.L. (2002). Combination of multiple classifiers using probabilistic dictionary and its application to postcode recognition. Pattern Recognition 35 (12) : 2823-2832. ScholarBank@NUS Repository. https://doi.org/10.1016/S0031-3203(01)00237-0
dc.identifier.issn00313203
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/38885
dc.description.abstractCombination of multiple classifiers is regarded as an effective strategy for achieving a practical system of handwritten character recognition. A great deal of research on the methods of combining multiple classifiers has been reported to improve the recognition performance of single characters. However, in a practical application, the recognition performance of a group of characters (such as a postcode or a word) is more significant and more crucial. With the motivation of optimizing the recognition performance of postcode rather than that of single characters, this paper presents an approach to combine multiple classifiers in such a way that the combination decision is carried out at the postcode level rather than at the single character level, in which a probabilistic postcode dictionary is utilized as well to improve the postcode recognition ability. It can be seen from the experimental results that the proposed approach markedly improves the postcode recognition performance and outperforms the commonly used methods of combining multiple classifiers at the single character level. Furthermore, the sorting performance of some particular bins with respect to the postcodes with low frequency of occurrence can be improved significantly at the same time. © 2002 Pattern Recognition Society, Published by Elsevier Science Ltd. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/S0031-3203(01)00237-0
dc.sourceScopus
dc.subjectCombination of multiple classifiers
dc.subjectNumeral recognition
dc.subjectPostcode level
dc.subjectPostcode recognition
dc.subjectProbabilistic dictionary
dc.subjectSingle character level
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1016/S0031-3203(01)00237-0
dc.description.sourcetitlePattern Recognition
dc.description.volume35
dc.description.issue12
dc.description.page2823-2832
dc.description.codenPTNRA
dc.identifier.isiut000178751600016
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.