一种新的用于模糊目标跟踪的多重假设检验(MHT)方案

Kaveh Ahmadi, E. Salari
{"title":"一种新的用于模糊目标跟踪的多重假设检验(MHT)方案","authors":"Kaveh Ahmadi, E. Salari","doi":"10.1109/EIT.2015.7293370","DOIUrl":null,"url":null,"abstract":"Multiple Hypothesis Tracking (MHT) is an active field for the detection and tracking of low-observable small targets. Most of MHT algorithms are based on a search method in a large tree of possible tracks in a digital image sequence. Though, processing a tree structure with a significant number of branches in MHT has been a challenging issue. Tracking high-speed objects with traditional MHT requires some presumptions which limit the capabilities of these methods. This paper presents a novel MHT system in three steps to solve this problem. The process starts with the root of each track in the video sequence followed by a Particle Swarm Optimization (PSO) search to find the optimum tracks. Iterative process of PSO tries to refine each track. In the third step, the proposed algorithm merges all of the refined tracks related to an object. Efficiency of the proposed method is presented through the figures and tables in the simulation results section.","PeriodicalId":415614,"journal":{"name":"2015 IEEE International Conference on Electro/Information Technology (EIT)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A novel Multiple Hypothesis Testing (MHT) scheme for tracking of dim objects\",\"authors\":\"Kaveh Ahmadi, E. Salari\",\"doi\":\"10.1109/EIT.2015.7293370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple Hypothesis Tracking (MHT) is an active field for the detection and tracking of low-observable small targets. Most of MHT algorithms are based on a search method in a large tree of possible tracks in a digital image sequence. Though, processing a tree structure with a significant number of branches in MHT has been a challenging issue. Tracking high-speed objects with traditional MHT requires some presumptions which limit the capabilities of these methods. This paper presents a novel MHT system in three steps to solve this problem. The process starts with the root of each track in the video sequence followed by a Particle Swarm Optimization (PSO) search to find the optimum tracks. Iterative process of PSO tries to refine each track. In the third step, the proposed algorithm merges all of the refined tracks related to an object. Efficiency of the proposed method is presented through the figures and tables in the simulation results section.\",\"PeriodicalId\":415614,\"journal\":{\"name\":\"2015 IEEE International Conference on Electro/Information Technology (EIT)\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Electro/Information Technology (EIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EIT.2015.7293370\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Electro/Information Technology (EIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2015.7293370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

多假设跟踪(MHT)是低可观测小目标检测和跟踪的一个活跃领域。大多数MHT算法都是基于在数字图像序列中可能轨迹的大树中的搜索方法。然而,在MHT中处理具有大量分支的树结构一直是一个具有挑战性的问题。传统的MHT跟踪高速目标需要一些假设,这限制了这些方法的能力。本文分三步提出了一种新的MHT系统来解决这一问题。该过程从视频序列中的每个轨道的根开始,然后进行粒子群优化(PSO)搜索以找到最佳轨道。粒子群算法的迭代过程试图细化每条轨道。在第三步中,该算法将与目标相关的所有精炼轨道合并。仿真结果部分的图表说明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A novel Multiple Hypothesis Testing (MHT) scheme for tracking of dim objects
Multiple Hypothesis Tracking (MHT) is an active field for the detection and tracking of low-observable small targets. Most of MHT algorithms are based on a search method in a large tree of possible tracks in a digital image sequence. Though, processing a tree structure with a significant number of branches in MHT has been a challenging issue. Tracking high-speed objects with traditional MHT requires some presumptions which limit the capabilities of these methods. This paper presents a novel MHT system in three steps to solve this problem. The process starts with the root of each track in the video sequence followed by a Particle Swarm Optimization (PSO) search to find the optimum tracks. Iterative process of PSO tries to refine each track. In the third step, the proposed algorithm merges all of the refined tracks related to an object. Efficiency of the proposed method is presented through the figures and tables in the simulation results section.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Space time block code for four time slots and two transmit antennas Social routing: A novel routing protocol for delay tolerant network based on dynamic connectivity Radiation performance and Specific Absorption Rate (SAR) analysis of a compact dual band balanced antenna Design of half bridge LLC resonant converter using synchronous rectifier Frame distance array algorithm parameter tune-up for TIMIT corpus automatic speech segmentation
×
引用
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