航迹关联问题的统计方法

A. Pinsky
{"title":"航迹关联问题的统计方法","authors":"A. Pinsky","doi":"10.1109/NAECON.1998.710165","DOIUrl":null,"url":null,"abstract":"We have applied techniques, developed previously (1997), to samples of track measurements and have obtained decision rule that are asymptotically close to decision rule characteristics (probability of false objects generation is not greater than any given significance level, and possibility to omit existing objects decreases with increase of observation time). The recursive computation algorithm that implements the above decision rule is developed, and objects location estimates are also obtained at every time step.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Statistical approach to track-to-track association problem\",\"authors\":\"A. Pinsky\",\"doi\":\"10.1109/NAECON.1998.710165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have applied techniques, developed previously (1997), to samples of track measurements and have obtained decision rule that are asymptotically close to decision rule characteristics (probability of false objects generation is not greater than any given significance level, and possibility to omit existing objects decreases with increase of observation time). The recursive computation algorithm that implements the above decision rule is developed, and objects location estimates are also obtained at every time step.\",\"PeriodicalId\":202280,\"journal\":{\"name\":\"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAECON.1998.710165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAECON.1998.710165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们已经将以前开发的技术(1997年)应用于轨道测量的样本,并获得了渐近接近决策规则特征的决策规则(生成虚假对象的概率不大于任何给定的显著性水平,并且忽略现有对象的可能性随着观察时间的增加而降低)。开发了实现上述决策规则的递归计算算法,并在每个时间步长得到目标位置估计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Statistical approach to track-to-track association problem
We have applied techniques, developed previously (1997), to samples of track measurements and have obtained decision rule that are asymptotically close to decision rule characteristics (probability of false objects generation is not greater than any given significance level, and possibility to omit existing objects decreases with increase of observation time). The recursive computation algorithm that implements the above decision rule is developed, and objects location estimates are also obtained at every time step.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信