{"title":"基于隐马尔可夫模型的磁性支票字符自动识别","authors":"D. Strydom, J. du Preez, S. Mostert","doi":"10.1109/COMSIG.1993.365866","DOIUrl":null,"url":null,"abstract":"Given a signal with a distinct pattern, one can easily define a model that represents such a signal as a sequence of states each with unique features. The models are hidden Markov models (HMM) configured in the most obvious way dependent only on the segmentation technique suggested. Each segment represents a state in the HMM. Models are proposed for recognition purposes.<<ETX>>","PeriodicalId":398160,"journal":{"name":"1993 IEEE South African Symposium on Communications and Signal Processing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automatic recognition of magnetic cheque characters with hidden Markov models\",\"authors\":\"D. Strydom, J. du Preez, S. Mostert\",\"doi\":\"10.1109/COMSIG.1993.365866\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a signal with a distinct pattern, one can easily define a model that represents such a signal as a sequence of states each with unique features. The models are hidden Markov models (HMM) configured in the most obvious way dependent only on the segmentation technique suggested. Each segment represents a state in the HMM. Models are proposed for recognition purposes.<<ETX>>\",\"PeriodicalId\":398160,\"journal\":{\"name\":\"1993 IEEE South African Symposium on Communications and Signal Processing\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 IEEE South African Symposium on Communications and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSIG.1993.365866\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 IEEE South African Symposium on Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSIG.1993.365866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic recognition of magnetic cheque characters with hidden Markov models
Given a signal with a distinct pattern, one can easily define a model that represents such a signal as a sequence of states each with unique features. The models are hidden Markov models (HMM) configured in the most obvious way dependent only on the segmentation technique suggested. Each segment represents a state in the HMM. Models are proposed for recognition purposes.<>