FGAs-Based Data Association Algorithm for Multi-sensor Multi-target Tracking

A novel data association algorithm is developed based on fuzzy geneticalgorithms (FGAs). The static part of data association uses one FGA to determine both the lists ofcomposite measurements and the solutions of m-best S-D assignment. In the dynamic part of dataassociation, the results of the m-best S-D assignment are then used in turn, with a Kalman filterstate estimator, in a multi-population FGA-based dynamic 2D assignment algorithm to estimate thestates of the moving targets over time. Such an assignment-based data association algorithm isdemonstrated on a simulated passive sensor track formation and maintenance problem. The simulationresults show its feasibility in multi-sensor multi-target tracking. Moreover, algorithm developmentand real-time problems are briefly discussed.

Maneuvering Multi-target Tracking Algorithm Based on Modified Generalized Probabilistic Data Association

Aiming at the problem of strong nonlinear and effective echo confirm of multi-target tracking system in clutters environment, a novel maneuvering multitarget tracking algorithm based on modified generalized probabilistic data association is proposed in this paper. In view of the advantage of particle filter which can deal with the nonlinear and non-Gaussian system, it is introduced into the framework of generalized probabilistic data association to calculate the residual and residual covariance matrices, and the interconnection probability is further optimized. On that basis, the dynamic combination of particle filter and generalized probabilistic data association method is realized in the new algorithm. The theoretical analysis and experimental results show the filtering precision is obviously improved with respect to the tradition method using suboptimal filter.

Modified joint probabilistic data association with classification-aided for multitarget tracking

Joint probabilistic data association is an effective method for tracking multiple targets in clutter, but only the target kinematic information is used in measure-to-track association. If the kinematic likelihoods are similar for different closely spaced targets, there is ambiguity in using the kinematic information alone; the correct association probability will decrease in conventional joint probabilistic data association algorithm and track coalescence will occur easily. A modified algorithm of joint probabilistic data association with classification-aided is presented, which avoids track coalescence when tracking multiple neighboring targets. Firstly, an identification matrix is defined, which is used to simplify validation matrix to decrease computational complexity. Then, target class information is integrated into the data association process. Performance comparisons with and without the use of class information in JPDA are presented on multiple closely spaced maneuvering targets tracking problem. Simulation results quantify the benefits of classification-aided JPDA for improved multiple targets tracking, especially in the presence of association uncertainty in the kinematic measurement and target maneuvering. Simulation results indicate that the algorithm is valid.

Study on data association algorithm of multi-passive-sensor location system

Aiming at three-passive-sensor location system, a generalized 3-dimension （3-D） assignment model is constructed based on property information, and a multi-target programming model is proposed based on direction-finding and property fusion information. The multi-target programming model is transformed into a single target programming problem to resolve, and its data association result is compared with the results which are solved by using one kind of information only. Simulation experiments show the effectiveness of the multi-target programming algorithm with higher data association accuracy and less calculation.

Tracking a maneuvering target in clutter with out-of-sequence measurements for airborne radar

There are many proposed optimal or suboptimal al- gorithms to update out-of-sequence measurement（s） （OoSM（s）） for linear-Gaussian systems, but few algorithms are dedicated to track a maneuvering target in clutter by using OoSMs. In order to address the nonlinear OoSMs obtained by the airborne radar located on a moving platform from a maneuvering target in clut- ter, an interacting multiple model probabilistic data association （IMMPDA） algorithm with the OoSM is developed. To be practical, the algorithm is based on the Earth-centered Earth-fixed （ECEF） coordinate system where it considers the effect of the platform＇s attitude and the curvature of the Earth. The proposed method is validated through the Monte Carlo test compared with the perfor- mance of the standard IMMPDA algorithm ignoring the OoSM, and the conclusions show that using the OoSM can improve the track- ing performance, and the shorter the lag step is, the greater degree the performance is improved, but when the lag step is large, the performance is not improved any more by using the OoSM, which can provide some references for engineering application.

A new algorithm of bearings-only multi-target tracking of bistatic system

Much research mainly focuses on the batch processing method （e.g. maximum likelihood method） when bearings-only multiple targets tracking of bistatic sonar system is considered. In this paper, the idea of recursive processing method is presented and employed, and corresponding data association algorithms, i.e. a multi-objective ant-colony-based optimization algorithm and an easy fast assignment algorithm are developed to solve the measurements-to-measurements and measurements-to-tracks data association problems of bistatic sonar system, respectively. Monte-Carlo simulations are induced to evaluate the effectiveness of the proposed methods.

A novel maneuvering multi-target tracking algorithm based on multiple model particle filter in clutters

To solve the problem of strong nonlinear and motion model switching of maneuvering target tracking system in clutter environment, a novel maneuvering multi-target tracking algorithm based on multiple model particle filter is presented in this paper. The algorithm realizes dynamic combination of multiple model particle filter and joint probabilistic data association algorithm. The rapid expan- sion of computational complexity, caused by the simple combination of the interacting multiple model algorithm and particle filter is solved by introducing model information into the sampling process of particle state, and the effective validation and utilization of echo is accomplished by the joint proba- bilistic data association algorithm. The concrete steps of the algorithm are given, and the theory analysis and simulation results show the validity of the method.

VIDEO MULTI-TARGET TRACKING BASED ON PROBABILISTIC GRAPHICAL MODEL

In the technique of video multi-target tracking,the common particle filter can not deal well with uncertain relations among multiple targets.To solve this problem,many researchers use data association method to reduce the multi-target uncertainty.However,the traditional data association method is difficult to track accurately when the target is occluded.To remove the occlusion in the video,combined with the theory of data association,this paper adopts the probabilistic graphical model for multi-target modeling and analysis of the targets relationship in the particle filter framework.Ex-perimental results show that the proposed algorithm can solve the occlusion problem better compared with the traditional algorithm.

利用伯努利滤波的多目标机动雷达误差配准方法

传统的组网雷达多目标误差配准方法通常假设数据关联关系已知,但在平台机动的情况下,系统同时存在雷达测量偏差和平台姿态角偏差,且雷达观测过程中会受到杂波干扰,导致数据关联尤为困难。针对这一问题,该文提出一种基于伯努利滤波的多目标机动雷达误差配准方法。首先建立系统偏差的量测与状态方程,然后将系统偏差建模成伯努利随机有限集,利用公共坐标系下的原始量测可实现系统偏差在伯努利滤波框架下的递推估计,有效避免了数据关联问题。同时,为了充分利用多目标量测信息,提出一种修正的贪婪量测划分方法,在每个滤波时刻挑选出系统偏差对应的最优量测子集,利用量测子集中的多量测信息实现系统偏差的集中式融合估计,提高了系统偏差的估计精度和收敛速度。仿真实验表明,所提方法能够在数据关联未知的多目标多杂波场景下对雷达测量偏差和平台姿态角偏差进行有效估计,在平台姿态角变化率较低时,所提方法具有较强的适应性。

Loopy belief propagation based data association for extended target tracking

The data association problem of multiple extended target tracking is very challenging because each target may generate multiple measurements.Recently,the belief propagation based multiple target tracking algorithms with high efficiency have been a research focus.Different from the belief propagation based Extended Target tracking based on Belief Propagation(ET-BP)algorithm proposed in our previous work,a new graphical model formulation of data association for multiple extended target tracking is proposed in this paper.The proposed formulation can be solved by the Loopy Belief Propagation(LBP)algorithm.Furthermore,the simplified measurement set in the ET-BP algorithm is modified to improve tracking accuracy.Finally,experiment results show that the proposed algorithm has better performance than the ET-BP and joint probabilistic data association based on the simplified measurement set algorithms in terms of accuracy and efficiency.Additionally,the convergence of the proposed algorithm is verified in the simulations.

兴趣度——关联规则的又一个阈值

关联规则的采掘是数据采掘研究的一个重要方面 .分析现有的关联规则采掘算法中所存在的问题 :首先是关联规则在其表达形式上没有考虑各种可能的反面示例的影响 ,因而导致知识表达功能的不够完善 ;其次是有可能一条规则即使可信度和支持度都很高 ,仍没有实际意义 ,甚至是误导性的 .因此对关联规则的形式定义作了修改 ,将运用差异思想引入的兴趣度阈值运用到关联规则中来 ,并给出其形式定义 .在分析了兴趣度的实际意义以后 ,讨论了兴趣度与概念层次的结合 .

基于Apriori的有效关联规则挖掘算法的研究

通过对Apriori算法进行的分析与研究,发现其在实用中存在两个主要问题:生成的关联规则具有相当大的冗余性;有可能挖掘出一条支持度和置信度均很高,但却是无趣的、甚至是虚假的关联规则,且不能产生带有否定项的规则。鉴于此,该文给出了关联规则的两个性质和引入兴趣度的第三个度量———相关支持度,设计了挖掘出有效关联规则算法,较好地解决了上述问题。

大数据关联关系度量研究综述

大数据关联性分析是大数据挖掘的基础,一个好的关联性度量是实施关联分析的关键。本文首先指出大数据时代关联度量面临的挑战和研究现状,从关联关系度量的构造角度出发,对现有的关联关系度量进行整理,归纳总结了这些关联关系的性质和适用条件。在回顾关联度量发展历程的基础上,结合大数据时代关联关系的特点,提出构造关联度量可能满足的条件。最后针对多模态数据关联关系度量的若干问题进行探讨和梳理,从3个角度出发,提出应对多模态数据空间转换的挑战,以引起对该领域更深入的思考与研究工作,从而促进大数据挖掘工作的进展。

一种改进的Apriori算法

针对Apriori算法对数据库的扫描次数过多、系统的I/O负载大和产生大量的无关中间项集等弊端,提出了一种改进的Apriori算法。该算法通过加入用户兴趣项,减少候选项集的产生;打破了传统的算法实现步骤减少了数据库的扫描次数,降低了系统I/O负载;构建了用户兴趣度模型增加了算法生成强关联规则的可读性,提高了算法的效率。实验表明,改进的Apriori算法能有效地提高运行速度和效率。

关联规则兴趣度度量方法的比较研究

关联规则挖掘是数据挖掘中重要的研究课题，已有许多有效的实现算法。然而，这些算法找到的关联规则数目太多，用户无法对其进行分析。为了克服这个问题，出现了一些关联规则衡量标准来分析规则的有趣性，在本文里我们在给出的实例上比较分析了一些关联规则客观兴趣度度量指标，提出了使用关联规则客观兴趣度度量指标的一些建议。

动态关联规则的趋势度挖掘方法

针对规则随着时间变化的特点,在分析原有定义和对支持度向量(SV)和置信度向量分类的基础上,提出了动态关联规则趋势度的挖掘方法。首先,利用趋势度阈值消除无价值的规则,减小候选项集;其次,产生动态关联规则的趋势度元规则,找出具有价值的规则,提高挖掘质量;最后,通过对具有增减和周期趋势的事物数据库分析,证明了所提方法的有效性。

一个新的关联规则兴趣度度量方法

联规则挖掘是数据挖掘和知识发现领域的重要课题,但就判定关联规则是否成立的依据,即兴趣度的度量方法问题,学术界没有一致的标准。既有的兴趣度度量方法包括支持度-置信度方法,提升度方法,卡方分析方法等。这些传统的兴趣度度量方法存在各自的局限,表现为缺乏客观标准,缺少统计依据,只能度量正向关系等方面。为了克服这些问题,本文提出了一种基于统计推断的新的兴趣度度量方法,并对该方法与传统的方法进行了比较,证明了该度量公式的渐进分布形式,指出了新方法的优点,实证了新方法的特征属性。该方法用于关联规则挖掘,在判断规则成立的标准上是客观的,可以判定正负关联两种类型,在实际应用上是方便的,具有可操作性,较之原有方法有一定的优势。

基于相关性度量的关联规则挖掘

传统的关联规则挖掘方法容易生成一些无用规则,甚至生成误导规则,也不能区分正负关联规则.通过相关性度量,建立了基于相关性度量的兴趣度模型,并利用兴趣度模型改进了关联规则算法,最后,通过实例验证了此算法不仅能够避免生成无用规则和误导规则,还能生成一些感兴趣的负关联规则.

基于数据挖掘的课程相关性分析系统的应用研究

本文论证了采用关联规则算法进行数据挖掘,以发现课程之间相关性的可行性。数据挖掘部分采用经典的Apriori算法,并引入了感兴趣度的概念,对挖掘结果进行进一步的清理,从而提高了系统的性能。

相关测度与增量式支持度和信任度的计算

通过相关测度的定义,从理论上探讨了增量式规则发现问题,并把分类规则挖掘和关联规则挖掘联系起来进行研究,为该问题的深入研究奠定了理论基础.相关测度刻画了给定关系和相关集合的数字特征.对相关测度的概念、定义、性质以及与支持度和信任度的关系等方面作了详细的分析和探讨,给出了基于相关集合的支持度和信任度的定义及计算方法.证明了测度增量定理和支持度增量定理,并给出了增量式支持度和信任度的计算公式.另外还详细地分析了数据增量对关联规则和信任度的影响,探讨了基于新支持度的候选项的修剪问题.所提出的相关测度及其思想为研究既能用于分类规则又能用于关联规则的统一数据挖掘方法提供了有价值的新思路.