Multi-view tracking using Kalman filter and graph cut

Parisa Jahanshahi, Amir Masoud, Eftekhari Moghadam
{"title":"Multi-view tracking using Kalman filter and graph cut","authors":"Parisa Jahanshahi, Amir Masoud, Eftekhari Moghadam","doi":"10.1109/RIOS.2015.7270729","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a multi-view approach to detect and track based on graph-cut and Kalman filter algorithms to solve this problem. The first, object appears in the scene be detected as foreground in each view using a background model and background difference. Next, for related between cameras used homographic constraint. Any pixel inside the foreground object in every view will be related by homographies inducted by the reference view. reference view Images converted to binary images by a graph-cut segmentation. This step separated the position of the intersection points from other parts inside reference images. This added step significantly reduce false positives and missed detections due to points noise or when it cannot be guaranteed that a single reference view image will consistently by scene objects. To track, We measurement the average position of the points. The kakman filter provides an optimal estimate of its position at each time step. The filter kalman, the first one is the prediction of the next state estimate using the previous one; the second is the correction of that estimate using the measurement. Experimental results with detailed qualitative analysis are demonstrated in challenging multiview crowded scenes.","PeriodicalId":437944,"journal":{"name":"2015 AI & Robotics (IRANOPEN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 AI & Robotics (IRANOPEN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIOS.2015.7270729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we propose a multi-view approach to detect and track based on graph-cut and Kalman filter algorithms to solve this problem. The first, object appears in the scene be detected as foreground in each view using a background model and background difference. Next, for related between cameras used homographic constraint. Any pixel inside the foreground object in every view will be related by homographies inducted by the reference view. reference view Images converted to binary images by a graph-cut segmentation. This step separated the position of the intersection points from other parts inside reference images. This added step significantly reduce false positives and missed detections due to points noise or when it cannot be guaranteed that a single reference view image will consistently by scene objects. To track, We measurement the average position of the points. The kakman filter provides an optimal estimate of its position at each time step. The filter kalman, the first one is the prediction of the next state estimate using the previous one; the second is the correction of that estimate using the measurement. Experimental results with detailed qualitative analysis are demonstrated in challenging multiview crowded scenes.
利用卡尔曼滤波和图割进行多视图跟踪
本文提出了一种基于图切和卡尔曼滤波算法的多视图检测和跟踪方法来解决这一问题。首先,使用背景模型和背景差异在每个视图中检测场景中出现的物体作为前景。其次,对于摄像机之间的关联使用了同形约束。在每个视图中,前景对象内部的任何像素都将通过参考视图诱导的同形图相关联。通过图切割分割转换为二值图像的图像。这一步将交点的位置与参考图像内的其他部分分开。这一增加的步骤显著减少了由于点噪声或不能保证单个参考视图图像与场景对象一致而导致的误报和遗漏检测。为了跟踪,我们测量点的平均位置。kakman滤波器在每个时间步提供其位置的最优估计。卡尔曼滤波,第一个是利用前一个状态估计预测下一个状态;第二个是使用测量对估计进行修正。在具有挑战性的多视点拥挤场景中,对实验结果进行了详细的定性分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信