{"title":"Incremental character recognition with feature attribution","authors":"Ré Audouin, L. Shastri","doi":"10.1109/ICDAR.1995.602031","DOIUrl":null,"url":null,"abstract":"The neural network learning algorithm presented in the paper splits the problem of handwritten digit recognition into easy steps by learning character classes incrementally: at each step, the neurons most relevant to the considered class are fixed so that subsequent classes will not disrupt the knowledge already acquired, but will be able to use it. A new relevance measure is also defined, for which a cheap approximation can be computed. The advantage of the attribution scheme starts to show even for small experiments, but should become more obvious as the number of classes increases. Picking only a few relevant features for each class, and sharing them between classes, constrains learning and improves generalization. Experiments were limited to pre-segmented digits, but our use of a spatio-temporal network architecture makes their extension to unsegmented strings straightforward.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd International Conference on Document Analysis and Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.1995.602031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The neural network learning algorithm presented in the paper splits the problem of handwritten digit recognition into easy steps by learning character classes incrementally: at each step, the neurons most relevant to the considered class are fixed so that subsequent classes will not disrupt the knowledge already acquired, but will be able to use it. A new relevance measure is also defined, for which a cheap approximation can be computed. The advantage of the attribution scheme starts to show even for small experiments, but should become more obvious as the number of classes increases. Picking only a few relevant features for each class, and sharing them between classes, constrains learning and improves generalization. Experiments were limited to pre-segmented digits, but our use of a spatio-temporal network architecture makes their extension to unsegmented strings straightforward.