TransTrack:通过感知他们的区域转换来跟踪多个目标

Avinash Kalyanaraman, Erin Griffiths, K. Whitehouse
{"title":"TransTrack:通过感知他们的区域转换来跟踪多个目标","authors":"Avinash Kalyanaraman, Erin Griffiths, K. Whitehouse","doi":"10.1109/DCOSS.2016.27","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a variant of the multi-target tracking problem in which the tracking region is divided into zones and targets can only be monitored as they transition between these zones. We call this the transition tracking problem. The key challenge in Transition Tracking is to estimate the number of targets in the tracking region without being able to sense all targets simultaneously. In this paper, we propose an approach to the Transition Tracking problem called TransTrack. Unlike most other tracking algorithms that maximize the likelihood of the sensor data, TransTrack applies penalty functions to find the minimum number of targets that can explain the sensor data. These penalties allow tracks with larger numbers of targets only ifthey have sufficiently fewer errors than other, alternative tracks. To evaluate this approach, we apply TransTrack to a data set containing 3275 transitions between rooms in a home. We observe an average room tracking accuracy of up to 94.5%.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"06 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"TransTrack: Tracking Multiple Targets by Sensing Their Zone Transitions\",\"authors\":\"Avinash Kalyanaraman, Erin Griffiths, K. Whitehouse\",\"doi\":\"10.1109/DCOSS.2016.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a variant of the multi-target tracking problem in which the tracking region is divided into zones and targets can only be monitored as they transition between these zones. We call this the transition tracking problem. The key challenge in Transition Tracking is to estimate the number of targets in the tracking region without being able to sense all targets simultaneously. In this paper, we propose an approach to the Transition Tracking problem called TransTrack. Unlike most other tracking algorithms that maximize the likelihood of the sensor data, TransTrack applies penalty functions to find the minimum number of targets that can explain the sensor data. These penalties allow tracks with larger numbers of targets only ifthey have sufficiently fewer errors than other, alternative tracks. To evaluate this approach, we apply TransTrack to a data set containing 3275 transitions between rooms in a home. We observe an average room tracking accuracy of up to 94.5%.\",\"PeriodicalId\":217448,\"journal\":{\"name\":\"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"volume\":\"06 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCOSS.2016.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2016.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

在本文中,我们考虑了一种多目标跟踪问题的变体,该问题将跟踪区域划分为多个区域,目标只有在这些区域之间过渡时才能被监视。我们称之为过渡跟踪问题。在不能够同时感知所有目标的情况下,如何估计跟踪区域内的目标数量是过渡跟踪的关键问题。在本文中,我们提出了一种称为TransTrack的过渡跟踪问题的方法。与大多数其他最大化传感器数据可能性的跟踪算法不同,TransTrack应用惩罚函数来找到可以解释传感器数据的最小目标数量。这些惩罚允许有更多目标的轨道,只有当它们比其他替代轨道有足够少的错误时。为了评估这种方法,我们将TransTrack应用于一个包含3275个房间间转换的数据集。我们观察到平均房间跟踪准确率高达94.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
TransTrack: Tracking Multiple Targets by Sensing Their Zone Transitions
In this paper, we consider a variant of the multi-target tracking problem in which the tracking region is divided into zones and targets can only be monitored as they transition between these zones. We call this the transition tracking problem. The key challenge in Transition Tracking is to estimate the number of targets in the tracking region without being able to sense all targets simultaneously. In this paper, we propose an approach to the Transition Tracking problem called TransTrack. Unlike most other tracking algorithms that maximize the likelihood of the sensor data, TransTrack applies penalty functions to find the minimum number of targets that can explain the sensor data. These penalties allow tracks with larger numbers of targets only ifthey have sufficiently fewer errors than other, alternative tracks. To evaluate this approach, we apply TransTrack to a data set containing 3275 transitions between rooms in a home. We observe an average room tracking accuracy of up to 94.5%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信