{"title":"一种改进的跟踪滤波算法","authors":"Ming-Hui Wang, Zhisheng You, Yingning Peng","doi":"10.1109/ICOSP.2002.1180986","DOIUrl":null,"url":null,"abstract":"Tracking gate is the very important first-step filter of some classical data association algorithms. An improved tracking gate method is presented in this paper, which estimates the gate size by searching the optimal solution of the performance function of data association. This gate method has been compared with some classical methods.","PeriodicalId":159807,"journal":{"name":"6th International Conference on Signal Processing, 2002.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved tracking filter algorithm\",\"authors\":\"Ming-Hui Wang, Zhisheng You, Yingning Peng\",\"doi\":\"10.1109/ICOSP.2002.1180986\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tracking gate is the very important first-step filter of some classical data association algorithms. An improved tracking gate method is presented in this paper, which estimates the gate size by searching the optimal solution of the performance function of data association. This gate method has been compared with some classical methods.\",\"PeriodicalId\":159807,\"journal\":{\"name\":\"6th International Conference on Signal Processing, 2002.\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"6th International Conference on Signal Processing, 2002.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOSP.2002.1180986\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"6th International Conference on Signal Processing, 2002.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSP.2002.1180986","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tracking gate is the very important first-step filter of some classical data association algorithms. An improved tracking gate method is presented in this paper, which estimates the gate size by searching the optimal solution of the performance function of data association. This gate method has been compared with some classical methods.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
