{"title":"Automatic track formation in clutter with a recursive algorithm","authors":"Y. Bar-Shalom, Kuo-Chu Chang, H. Blom","doi":"10.1109/CDC.1989.70372","DOIUrl":null,"url":null,"abstract":"A recursive algorithm for forming tracks in a cluttered environment is presented. The approach combines the interacting multiple model algorithm with the probabilistic data association filter. The track formation is accomplished by considering two models: one is the true target, with a certain probability of detection P/sub D/; the other is an unobservable target (or no target) with the same model as the former except that P/sub D/=0. The latter represents either a true target outside the sensor coverage or an erroneously hypothesized target. Assuming that the clutter measurements are uniformly distributed, the algorithm yields the true target probability of a track; i.e. it can be called intelligent, since it has a quantitative assessment of whether it has a target in track. The algorithm is useful for low signal-to-noise-ratio situations where the detection threshold has to be set low in order to detect the target, leading to a high rate of false alarms.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"108","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th IEEE Conference on Decision and Control,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1989.70372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 108
Abstract
A recursive algorithm for forming tracks in a cluttered environment is presented. The approach combines the interacting multiple model algorithm with the probabilistic data association filter. The track formation is accomplished by considering two models: one is the true target, with a certain probability of detection P/sub D/; the other is an unobservable target (or no target) with the same model as the former except that P/sub D/=0. The latter represents either a true target outside the sensor coverage or an erroneously hypothesized target. Assuming that the clutter measurements are uniformly distributed, the algorithm yields the true target probability of a track; i.e. it can be called intelligent, since it has a quantitative assessment of whether it has a target in track. The algorithm is useful for low signal-to-noise-ratio situations where the detection threshold has to be set low in order to detect the target, leading to a high rate of false alarms.<>