一般数据关联与可能无法解决的测量使用线性规划

Huimin Chen, K. Pattipati, T. Kirubarajan, Y. Bar-Shalom
{"title":"一般数据关联与可能无法解决的测量使用线性规划","authors":"Huimin Chen, K. Pattipati, T. Kirubarajan, Y. Bar-Shalom","doi":"10.1109/CVPRW.2003.10102","DOIUrl":null,"url":null,"abstract":"In this paper we formulate data association with possibly unresolved measurements as an augmented assignment problem. Unlike conventional measurement-to-track association via assignment, this augmented assignment problem has much greater complexity when each target originated measurement can be of single or multiple origins. The main point is that standard one-to-one assignment algorithms do not work in the case of unresolved measurements because the constraints in the augmented assignment problem are very different. A suboptimal approach is considered for solving the resulting optimization problem via linear programming (LP) by relaxing the integer constraints. A tracker based on probabilistic data association filter (PDAF) using the LP solutions is also discussed. Simulation results show that the percentage of track loss is significantly reduced by solving the augmented assignment rather than the conventional assignment.","PeriodicalId":121249,"journal":{"name":"2003 Conference on Computer Vision and Pattern Recognition Workshop","volume":" 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"General Data Association with Possibly Unresolved Measurements Using Linear Programming\",\"authors\":\"Huimin Chen, K. Pattipati, T. Kirubarajan, Y. Bar-Shalom\",\"doi\":\"10.1109/CVPRW.2003.10102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we formulate data association with possibly unresolved measurements as an augmented assignment problem. Unlike conventional measurement-to-track association via assignment, this augmented assignment problem has much greater complexity when each target originated measurement can be of single or multiple origins. The main point is that standard one-to-one assignment algorithms do not work in the case of unresolved measurements because the constraints in the augmented assignment problem are very different. A suboptimal approach is considered for solving the resulting optimization problem via linear programming (LP) by relaxing the integer constraints. A tracker based on probabilistic data association filter (PDAF) using the LP solutions is also discussed. Simulation results show that the percentage of track loss is significantly reduced by solving the augmented assignment rather than the conventional assignment.\",\"PeriodicalId\":121249,\"journal\":{\"name\":\"2003 Conference on Computer Vision and Pattern Recognition Workshop\",\"volume\":\" 9\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 Conference on Computer Vision and Pattern Recognition Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVPRW.2003.10102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 Conference on Computer Vision and Pattern Recognition Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVPRW.2003.10102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在本文中,我们将数据关联与可能无法解决的测量表述为一个增广赋值问题。与传统的通过分配的测量到跟踪关联不同,当每个目标源测量可以是单个或多个源时,这种增强分配问题具有更大的复杂性。主要的一点是,标准的一对一分配算法在未解决的测量情况下不起作用,因为增广分配问题中的约束非常不同。通过放宽整数约束,考虑了线性规划的次优求解方法。本文还讨论了一种基于概率数据关联滤波器(PDAF)的跟踪器。仿真结果表明,与传统的分配方法相比,解决增广分配方法能显著降低航迹损耗百分比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
General Data Association with Possibly Unresolved Measurements Using Linear Programming
In this paper we formulate data association with possibly unresolved measurements as an augmented assignment problem. Unlike conventional measurement-to-track association via assignment, this augmented assignment problem has much greater complexity when each target originated measurement can be of single or multiple origins. The main point is that standard one-to-one assignment algorithms do not work in the case of unresolved measurements because the constraints in the augmented assignment problem are very different. A suboptimal approach is considered for solving the resulting optimization problem via linear programming (LP) by relaxing the integer constraints. A tracker based on probabilistic data association filter (PDAF) using the LP solutions is also discussed. Simulation results show that the percentage of track loss is significantly reduced by solving the augmented assignment rather than the conventional assignment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Factorization Approach for Activity Recognition Optical flow estimation in omnidirectional images using wavelet approach Reckless motion estimation from omnidirectional image and inertial measurements Statistical Error Propagation in 3D Modeling From Monocular Video Learning and Perceptual Interfaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1