{"title":"一维和二维Hmm在模式识别中的有效性比较","authors":"J. Bobulski","doi":"10.1515/ipc-2015-0001","DOIUrl":null,"url":null,"abstract":"Abstract Hidden Markov Model (HMM) is a well established technique for image recognition and has also been successfully applied in other domains such as speech recognition, signature verification and gesture recognition. HMM is widely used mechanism for pattern recognition based on 1D data. For images one dimension is not satisfactory, because the conversion of one-dimensional data into a twodimensional lose some information. This paper presents a solution to the problem of 2D data by developing the 2D HMM structure and the necessary algorithms.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Comparison of the Effectiveness of 1D and 2D Hmm in the Pattern Recognition\",\"authors\":\"J. Bobulski\",\"doi\":\"10.1515/ipc-2015-0001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Hidden Markov Model (HMM) is a well established technique for image recognition and has also been successfully applied in other domains such as speech recognition, signature verification and gesture recognition. HMM is widely used mechanism for pattern recognition based on 1D data. For images one dimension is not satisfactory, because the conversion of one-dimensional data into a twodimensional lose some information. This paper presents a solution to the problem of 2D data by developing the 2D HMM structure and the necessary algorithms.\",\"PeriodicalId\":271906,\"journal\":{\"name\":\"Image Processing & Communications\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Image Processing & Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/ipc-2015-0001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Image Processing & Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/ipc-2015-0001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparison of the Effectiveness of 1D and 2D Hmm in the Pattern Recognition
Abstract Hidden Markov Model (HMM) is a well established technique for image recognition and has also been successfully applied in other domains such as speech recognition, signature verification and gesture recognition. HMM is widely used mechanism for pattern recognition based on 1D data. For images one dimension is not satisfactory, because the conversion of one-dimensional data into a twodimensional lose some information. This paper presents a solution to the problem of 2D data by developing the 2D HMM structure and the necessary algorithms.