共查询到20条相似文献,搜索用时 630 毫秒
1.
The problem of tracking multiple targets in the presence of clutter is addressed. The joint probabilistic data association (JPDA) algorithm has been previously reported to be suitable for this problem in that it makes few assumptions and can handle many targets as long as the clutter density is not very high. However, the complexity of this algorithm increases rapidly with the number of targets and returns. An approximation of the JPDA that uses an analog computational network to solve the data association problem is suggested. The problem is viewed as that of optimizing a suitably chosen energy function. Simple neural-network structures for the approximate minimization of such functions have been proposed by other researchers. The analog network used offers a significant degree of parallelism and thus can compute the association probabilities more rapidly. Computer simulations indicate the ability of the algorithm to track many targets simultaneously in the presence of moderately dense clutter 相似文献
2.
A class of near optimal JPDA algorithms 总被引:3,自引:0,他引:3
The crucial problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information If an incorrect hit is associated with a track, that track could diverge and prematurely terminate or cause other tracks to also diverge. Most methods for hit-to-track data association fall into two categories: multiple hypothesis tracking (MHT) and joint probabilistic data association (JPDA). Versions of MHT use all or some reasonable hits to update a track and delay the decision on which hit was correct. JPDA uses a weighted sum of the reasonable hits to update a track. These weights are the probability that the hit originated from the target in track. The computational load for the joint probabilities increases exponentially as the number of targets increases and therefore, is not an attractive algorithm when expecting to track many targets. Reviewed here is the JPDA filter and two simple approximations of the joint probabilities which increase linearly in computational load as the number of targets increase. Then a new class of near optimal JPDA algorithms is introduced which run in polynomial time. The power of the polynomial is an input to the algorithm. This algorithm bridges the gap in computational load and accuracy between the very fast simple approximations and the efficient optimal algorithms 相似文献
3.
4.
Suboptimal joint probabilistic data association 总被引:5,自引:0,他引:5
A significant problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information. If an incorrect hit is associated with a track, that track could diverge and terminate. Prior methods for this data association problem include various optimal and suboptimal two-dimensional assignment algorithms which make hit-to-track associations. Another method is to assign a weight for the reasonable hits and use a weighted centroid of those hits to update the track. The method of weighting the hits is known as joint probabilistic data association (JPDA). The authors review the JPDA approach and a simple ad hoc approximation and then introduce a new suboptimal JPDA algorithm. Examples which compare an optimal two-dimensional assignment algorithm with the ad hoc and the new suboptimal JPDA formulation are given 相似文献
5.
STOCHASTICNEURALNETWORKANDITSAPPLICATIONTOMULTI-MANEUVERINGTARGETTRACKINGJingZhongliang;DaiGuanzhong;TongMingan;ZhouHongren(D... 相似文献
6.
Leung H. Zhijian Hu Blanchette M. 《IEEE transactions on aerospace and electronic systems》1999,35(2):663-674
This paper evaluates the performance of multiple target tracking (MTT) algorithms in real-life stressful radar tracking environments. Real closely spaced maneuver radar data, generated by six F-18 fighters and other targets, were collected jointly by the defence departments of Canada and United States to support this practical MTT algorithm evaluation study. A set of performance metrics was defined here to compare the suboptimal nearest neighbor (SNN), global nearest neighbor (GNN), and various variants of the joint probabilistic data association (JPDA) MTT trackers. Results reveal an interesting result that all these MTT algorithms exhibited very close performance. In addition, the weighted sum approach of the PDA/JPDA trackers which are theoretically effective were observed to perform poorly in tracking closely spaced targets. Overall speaking, the GNN filter based on the Munkres algorithm had the best performance in terms of both tracking performance and robustness 相似文献
7.
修正的概率数据互联算法 总被引:4,自引:0,他引:4
阐明了概率数据互联(PDA)算法能很好地解决密集环境下的目标跟踪问题,在该算法基础上,人们又提出了联合概率数据互联(JPDA)算法和一些基于 PDA 的修正算法。在概率数据互联算法中,有一个很重要的参数就是杂波数密度(或波门内虚假量测期望数)。然而在许多实际情况中,这个参数是很难获取的。针对这一问题,文中提出了一种修正的概率数据互联算法,该算法通过实时地调整这一参数来获得对目标较为准确的估计结果。最后,给出了算法的仿真分析。 相似文献
8.
This paper presents a multiple scan or n-scan-back joint probabilistic data association (JPDA) algorithm which addresses the problem of measurement-to-track data association in a multiple target and clutter environment. The standard single scan JPDA algorithm updates a track with weighted sum of the measurements which could have reasonably originated from the target in track. The only information the standard JPDA algorithm uses is the measurements on the present scan and the state vectors and covariance matrices of the present targets. The n-scan-back algorithm presented here uses multiple scans of measurements along with the present target information to produce better weights for data association. The standard JPDA algorithm can utilize a formidable amount of processing power and the n-scan-back version only worsens the problem. Therefore, along with the algorithm presentation, implementations which make this algorithm practical are discussed and referenced. An example is also shown for a few n-scan-back window lengths 相似文献
9.
本文研究密集多回波环境下的机动多目标跟踪起始问题。文中首先提出主跟踪子空间和边缘跟踪子空间的定义与性质,接着修正Bayes轨迹确定方法BTC,并将其与具有残差滤波的修正概率数据关联滤波算法MPDAF-RF有机地结合起来,提出一种适合高密集多回波环境的机动多目环跟踪起始方法——“全邻”Bayes跟踪起始算法ABTI。Monte Carlo仿真表明,本文所给出的算法不仅克服了一类概率数据关联滤波方法没有跟踪起始机理的缺陷,而且辨别目标与虚警的能力很强,不失为解决高密集多回波环境下机动多目标跟踪起始的有效方法。 相似文献
10.
Algorithms are presented for managing sensor information to reduce the effects of bias when tracking interacting targets. When targets are close enough together that their measurement validation gates overlap, the measurement from one target can be confused with another. Data association algorithms such as the joint probabilistic data association (JPDA) algorithm can effectively continue to track targets under these conditions, but the target estimates may become biased. A modification of the covariance control approach for sensor management can reduce this effect. Sensors are chosen based on their ability to reduce the extent of measurement gate overlap as judged by a set of heuristic parameters derived in this work. Monte Carlo simulation results show that these are effective methods of reducing target estimate bias in the JPDA algorithm when targets are close together. An analysis of the computational demands of these algorithms shows that while they are computationally demanding, they are not prohibitively so. 相似文献
11.
Mahalanabis A.K. Zhou B. Bose N.K. 《IEEE transactions on aerospace and electronic systems》1990,26(1):113-121
An algorithm is presented for the recursive tracking of multiple targets in cluttered environment by making use of the joint probabilistic data association fixed-lag smoothing (JPDAS) techniques. It is shown that a significant improvement in the accuracy of track estimation of both nonmaneuvering and maneuvering targets may be achieved by introducing a time lag of one or two sampling periods between the instants of estimation and latest measurement. Results of simulation experiments for a radar tracking problem that demonstrate the effects of fixed-lag smoothing are also presented 相似文献
12.
13.
Joint probabilistic data association for autonomous navigation 总被引:2,自引:0,他引:2
A new autonomous navigation scheme based on the joint probabilistic data association (JPDA) approach that processes landmark detections in the field of view (FOV) of an on-board sensor is developed. These detections-some true, some false-are associated to a set of stored landmarks and used to update the state of the vehicle. The results obtained from Monte Carlo simulations prove the ability of this navigation filter to perform in very high false alarm environments. In the different environmental conditions tested in the simulations, the performance of the JPDA navigation filter (JPDANF) is very close to that of the filter based on perfect data association. The very efficient cluster decomposition algorithm presented for the purpose of the navigation problem can also be used in many multitarget tracking applications 相似文献
14.
针对传统关联波门设计方法在应用于机动目标跟踪时容易引起失跟、以及概率数据关联算法不适于多交叉目标跟踪的问题,提出了一种基于人类视觉选择性注意机制和知觉客体的"特征整合"理论的认知雷达数据关联算法。算法以综合交互式多模型概率数据关联算法为基础,采取假设目标最大机动水平已知的"当前"统计模型和匀速运动模型作为模型集,通过实时交互使关联波门能够随目标机动动态调整,较好地兼顾了雷达计算耗时和跟踪成功率。在利用目标位置特征的基础上,进一步提取、整合目标运动特征,对关联波门交叉区域公共量测进行分类,使多交叉目标跟踪问题转化为多个单目标跟踪问题,优化了传统概率数据关联算法。仿真结果表明:与传统关联波门设计方法相比,算法跟踪失败率和计算耗时明显降低;而且在计算资源增加不大的情况下,杂波环境适应性也得到了显著增强。 相似文献
15.
The probabilistic multiple hypothesis tracker (PMHT) uses the expectation-maximization (EM) algorithm to solve the measurement-origin uncertainty problem. Here, we explore some of its variants for maneuvering targets and in particular discuss the multiple model PMHT. We apply this PMHT to the six "typical" tracking scenarios given in the second benchmark problem from W. D. Blair and G. A. Watson (1998). The manner in which the PMHT is used to track the targets and to manage radar allocation is discussed, and the results compared with those of the interacting multiple model probabilistic data association filter (IMM/PDAF) and IMM/MHT (multiple hypothesis tracker). The PMHT works well: its performance lies between those of the IMM/PDAF and IMM/MHT both in terms of tracking performance and computational load. 相似文献
16.
17.
18.
Popp R.L. Pattipati K.R. Bar-Shalom Y. 《IEEE transactions on aerospace and electronic systems》1999,35(4):1145-1160
In recent years, there has been considerable interest within the tracking community in an approach to data association based on the m-best two-dimensional (2D) assignment algorithm. Much of the interest has been spurred by its ability to provide various efficient data association solutions, including joint probabilistic data association (JPDA) and multiple hypothesis tracking (MHT). The focus of this work is to describe several recent improvements to the m-best 2D assignment algorithm. One improvement is to utilize a nonintrusive 2D assignment algorithm switching mechanism, based on a problem sparsity threshold. Dynamic switching between two different 2D assignment algorithms, highly suited for sparse and dense problems, respectively, enables more efficient solutions to the numerous 2D assignment problems generated in the m-best 2D assignment framework. Another improvement is to utilize a multilevel parallelization enabling many independent and highly parallelizable tasks to be executed concurrently, including 1) solving the multiple 2D assignment problems via a parallelization of the m-best partitioning task, and 2) calculating the numerous gating tests, state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the 2D assignment problem) via a parallelization of the data association interface task. Using both simulated data and an air traffic surveillance (ATS) problem based on data from two Federal Aviation Administration (FAA) air traffic control radars, we demonstrate that efficient solutions to the data association problem are obtainable using our improvements in the m-best 2D assignment algorithm 相似文献
19.
In this paper, an improved implementation of multiple model Gaussian mixture probability hypothesis density (MM-GM-PHD) filter is proposed. For maneuvering target tracking, based on joint distribution, the existing MM-GM-PHD filter is relatively complex. To simplify the filter, model conditioned distribution and model probability are used in the improved MM-GM-PHD filter. In the algorithm, every Gaussian components describing existing, birth and spawned targets are estimated by multiple model method. The final results of the Gaussian components are the fusion of multiple model estimations. The algorithm does not need to compute the joint PHD distribution and has a simpler computation procedure. Compared with single model GM-PHD, the algorithm gives more accurate estimation on the number and state of the targets. Compared with the existing MM-GM-PHD algorithm, it saves computation time by more than 30%. Moreover, it also outperforms the interacting multiple model joint probabilistic data association (IMMJPDA) filter in a relatively dense clutter environment. 相似文献
20.
基于数据关联的故障快速检测 总被引:1,自引:0,他引:1
多数情况下,快速实时地进行故障检测是很重要的。将故障看做是通过多传感器观测的动态模型,进行多传感器多模型概率数据关联,以各个模型的关联结果和设定的阈值为依据,可以有效地实现故障检测。联合概率数据关联(JPDA)算法是解决多传感器多目标跟踪的一个有效方法,文中通过分析概率数据关联算法,对联合概率数据关联算法进行了改进:(1)通过正确地选择阈值,移除小概率事件,进而建立一个近似的确认矩阵;(2)根据被跟踪目标故障跟踪门的相交情况,将跟踪空间进行数学划分,形成若干相互独立的区域;(3)对同一区域内公共有效量测的概率密度值进行衰减,计算出关联概率。仿真对比表明,本文的改进算法能显著减少计算时间,有效提高故障检测的快速性和实时性。 相似文献