相邻车辆建模跟踪跨非重叠摄像机

E. Shabaninia, S. Kasaei
{"title":"相邻车辆建模跟踪跨非重叠摄像机","authors":"E. Shabaninia, S. Kasaei","doi":"10.1109/IRANIANCEE.2010.5507012","DOIUrl":null,"url":null,"abstract":"Tracking vehicles across nonoverlapping cameras is required by video-based intelligent transportation systems (ITS) to efficiently calculate traffic parameters; such as link travel times and origin/destination counts. In traffic monitoring applications, cameras are usually mounted far from each other to cover wide areas. As such, object features (i.e., color information, shape, and direction) change significantly from one camera to another. These space-time differences raise serious challenges on efficient tracking. In this paper, we have presented a probabilistic model to solve the multicamera tracking task in a network of disjoint view cameras, with attention paid on estimating the density function of different features such as space-time, appearance, and especially neighboring vehicles' relationships. As in highways each group of vehicles usually tend to keep their distances, using the similarity of neighboring vehicles plays an important role in finding the correspondent vehicles. A graph-based approach is used to solve the assignment problem. Experimental results show the efficiency of the proposed tracking method.","PeriodicalId":282587,"journal":{"name":"2010 18th Iranian Conference on Electrical Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Neighboring vehicles modeling for tracking across nonoverlapping cameras\",\"authors\":\"E. Shabaninia, S. Kasaei\",\"doi\":\"10.1109/IRANIANCEE.2010.5507012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tracking vehicles across nonoverlapping cameras is required by video-based intelligent transportation systems (ITS) to efficiently calculate traffic parameters; such as link travel times and origin/destination counts. In traffic monitoring applications, cameras are usually mounted far from each other to cover wide areas. As such, object features (i.e., color information, shape, and direction) change significantly from one camera to another. These space-time differences raise serious challenges on efficient tracking. In this paper, we have presented a probabilistic model to solve the multicamera tracking task in a network of disjoint view cameras, with attention paid on estimating the density function of different features such as space-time, appearance, and especially neighboring vehicles' relationships. As in highways each group of vehicles usually tend to keep their distances, using the similarity of neighboring vehicles plays an important role in finding the correspondent vehicles. A graph-based approach is used to solve the assignment problem. Experimental results show the efficiency of the proposed tracking method.\",\"PeriodicalId\":282587,\"journal\":{\"name\":\"2010 18th Iranian Conference on Electrical Engineering\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 18th Iranian Conference on Electrical Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IRANIANCEE.2010.5507012\",\"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 18th Iranian Conference on Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRANIANCEE.2010.5507012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于视频的智能交通系统(ITS)需要在不重叠的摄像机之间跟踪车辆,以有效地计算交通参数;例如链路旅行时间和起点/目的地计数。在交通监控应用中,摄像机通常安装在距离较远的地方,以覆盖较广的区域。因此,物体特征(即颜色信息、形状和方向)在不同相机之间会发生显著变化。这些时空差异对有效跟踪提出了严峻的挑战。在本文中,我们提出了一个概率模型来解决在不相交的视图摄像机网络中的多摄像机跟踪任务,注意估计不同特征的密度函数,如时空,外观,特别是相邻车辆的关系。由于在高速公路上,每组车辆往往保持一定的距离,利用相邻车辆的相似性在寻找对应车辆方面起着重要的作用。使用基于图的方法来解决分配问题。实验结果表明了所提跟踪方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Neighboring vehicles modeling for tracking across nonoverlapping cameras
Tracking vehicles across nonoverlapping cameras is required by video-based intelligent transportation systems (ITS) to efficiently calculate traffic parameters; such as link travel times and origin/destination counts. In traffic monitoring applications, cameras are usually mounted far from each other to cover wide areas. As such, object features (i.e., color information, shape, and direction) change significantly from one camera to another. These space-time differences raise serious challenges on efficient tracking. In this paper, we have presented a probabilistic model to solve the multicamera tracking task in a network of disjoint view cameras, with attention paid on estimating the density function of different features such as space-time, appearance, and especially neighboring vehicles' relationships. As in highways each group of vehicles usually tend to keep their distances, using the similarity of neighboring vehicles plays an important role in finding the correspondent vehicles. A graph-based approach is used to solve the assignment problem. Experimental results show the efficiency of the proposed tracking method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信