{"title":"一种ML状态和序列估计的正反向算法","authors":"G. D. Brushe, R. Mahony, J. Moore","doi":"10.1109/ISSPA.1996.615718","DOIUrl":null,"url":null,"abstract":"The classical Viterbi algorithm is used to estimate the maximum likelihood state sequence from a block of observed data. It achieves this by maximising a forward path probability measure. In an analogous manner a backward path probability measure can be generated which leads to the development of a Viterbi forwardbackward algorithm. This algorithm computes an “a posteriori maximum path probability” for each state at a given time. The resulting probability distribution across all possible state at time t can be used as a soft output for further processing. Maximising a posteriori maximum path probability at each time gives the same state sequence as obtained from the classical Viterbi algorithm.","PeriodicalId":359344,"journal":{"name":"Fourth International Symposium on Signal Processing and Its Applications","volume":"217 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Forward Backward Algorithm for ML State and Sequence Estimation\",\"authors\":\"G. D. Brushe, R. Mahony, J. Moore\",\"doi\":\"10.1109/ISSPA.1996.615718\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The classical Viterbi algorithm is used to estimate the maximum likelihood state sequence from a block of observed data. It achieves this by maximising a forward path probability measure. In an analogous manner a backward path probability measure can be generated which leads to the development of a Viterbi forwardbackward algorithm. This algorithm computes an “a posteriori maximum path probability” for each state at a given time. The resulting probability distribution across all possible state at time t can be used as a soft output for further processing. Maximising a posteriori maximum path probability at each time gives the same state sequence as obtained from the classical Viterbi algorithm.\",\"PeriodicalId\":359344,\"journal\":{\"name\":\"Fourth International Symposium on Signal Processing and Its Applications\",\"volume\":\"217 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth International Symposium on Signal Processing and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPA.1996.615718\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Symposium on Signal Processing and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.1996.615718","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Forward Backward Algorithm for ML State and Sequence Estimation
The classical Viterbi algorithm is used to estimate the maximum likelihood state sequence from a block of observed data. It achieves this by maximising a forward path probability measure. In an analogous manner a backward path probability measure can be generated which leads to the development of a Viterbi forwardbackward algorithm. This algorithm computes an “a posteriori maximum path probability” for each state at a given time. The resulting probability distribution across all possible state at time t can be used as a soft output for further processing. Maximising a posteriori maximum path probability at each time gives the same state sequence as obtained from the classical Viterbi algorithm.