{"title":"一种改进的多目标跟踪数据关联算法","authors":"Zhangsong Shi, Sheng Xiao, Changfeng Xing","doi":"10.1109/ICCIS.2010.141","DOIUrl":null,"url":null,"abstract":"In tracking a single target in clutter, many algorithms have been developed. In multiple-target tracking, a number of the techniques have been exercised such as the JPDA and the multiple Hypothesis (MHT) schemes. Sub-optimal algorithms, such as the PDA filter, have been used widely since the optimal algorithms have an exponentially increasing computational complexity. An improved data association algorithm was presented considering the association precision and the project practice. At first, the approximate confirmation matrix was obtained through removing the small probability events. Then, the same source observations were classified into the same sets and the relevant confirmation matrix of each area was constructed. Both the distance between echoes and center of validation gates and the number of echoes are considered. The state was estimated in the same way as JPDA at last. The simulation results show that the proposed algorithm can maintain high association precision and tracking success ratio, so it is fitted to engineering.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Improved Data Association Algorithm for Multiple-Target Tracking\",\"authors\":\"Zhangsong Shi, Sheng Xiao, Changfeng Xing\",\"doi\":\"10.1109/ICCIS.2010.141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In tracking a single target in clutter, many algorithms have been developed. In multiple-target tracking, a number of the techniques have been exercised such as the JPDA and the multiple Hypothesis (MHT) schemes. Sub-optimal algorithms, such as the PDA filter, have been used widely since the optimal algorithms have an exponentially increasing computational complexity. An improved data association algorithm was presented considering the association precision and the project practice. At first, the approximate confirmation matrix was obtained through removing the small probability events. Then, the same source observations were classified into the same sets and the relevant confirmation matrix of each area was constructed. Both the distance between echoes and center of validation gates and the number of echoes are considered. The state was estimated in the same way as JPDA at last. The simulation results show that the proposed algorithm can maintain high association precision and tracking success ratio, so it is fitted to engineering.\",\"PeriodicalId\":227848,\"journal\":{\"name\":\"2010 International Conference on Computational and Information Sciences\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational and Information Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS.2010.141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational and Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS.2010.141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Data Association Algorithm for Multiple-Target Tracking
In tracking a single target in clutter, many algorithms have been developed. In multiple-target tracking, a number of the techniques have been exercised such as the JPDA and the multiple Hypothesis (MHT) schemes. Sub-optimal algorithms, such as the PDA filter, have been used widely since the optimal algorithms have an exponentially increasing computational complexity. An improved data association algorithm was presented considering the association precision and the project practice. At first, the approximate confirmation matrix was obtained through removing the small probability events. Then, the same source observations were classified into the same sets and the relevant confirmation matrix of each area was constructed. Both the distance between echoes and center of validation gates and the number of echoes are considered. The state was estimated in the same way as JPDA at last. The simulation results show that the proposed algorithm can maintain high association precision and tracking success ratio, so it is fitted to engineering.