{"title":"基于隐马尔可夫模型的多目标跟踪","authors":"X. Xie, R. Evans","doi":"10.1109/RADAR.1990.201100","DOIUrl":null,"url":null,"abstract":"The application of hidden Markov models (HMM) to the problem of tracking multiple targets is discussed. The tracker generates multiple discrete Viterbi tracks and automatically accounts for track iteration, termination, and ambiguous measurements. The tracker is not smoothing-based, as are most existing systems such as Kalman and PDA (probabilistic data association) trackers, but is discrete in the sense of the finite state Viterbi algorithm. Simulation shows that in some cases it is possible to avoid the route of data association and directly compute the maximum likelihood mixed track.<<ETX>>","PeriodicalId":441674,"journal":{"name":"IEEE International Conference on Radar","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Multiple target tracking using hidden Markov models\",\"authors\":\"X. Xie, R. Evans\",\"doi\":\"10.1109/RADAR.1990.201100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The application of hidden Markov models (HMM) to the problem of tracking multiple targets is discussed. The tracker generates multiple discrete Viterbi tracks and automatically accounts for track iteration, termination, and ambiguous measurements. The tracker is not smoothing-based, as are most existing systems such as Kalman and PDA (probabilistic data association) trackers, but is discrete in the sense of the finite state Viterbi algorithm. Simulation shows that in some cases it is possible to avoid the route of data association and directly compute the maximum likelihood mixed track.<<ETX>>\",\"PeriodicalId\":441674,\"journal\":{\"name\":\"IEEE International Conference on Radar\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Radar\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RADAR.1990.201100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Radar","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RADAR.1990.201100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiple target tracking using hidden Markov models
The application of hidden Markov models (HMM) to the problem of tracking multiple targets is discussed. The tracker generates multiple discrete Viterbi tracks and automatically accounts for track iteration, termination, and ambiguous measurements. The tracker is not smoothing-based, as are most existing systems such as Kalman and PDA (probabilistic data association) trackers, but is discrete in the sense of the finite state Viterbi algorithm. Simulation shows that in some cases it is possible to avoid the route of data association and directly compute the maximum likelihood mixed track.<>