基于改进SURF和P-KLT算法的特征点实时跟踪方法研究

 针对视频序列中运动目标的实时跟踪问题,提出一种基于改进SURF算法和金字塔KLT算法相结合的特征点跟踪方法。首先人工标定目标区域,利用改进的SURF算法分块快速提取具有高鲁棒性、独特性的特征点;然后在后续帧中应用金字塔KLT匹配算法对特征点进行稳定跟踪,采用基于统计的方法剔除错误匹配对;最后利用Greedy Snake分割算法提取轮廓确定更加精准的位置信息,更新目标区域。为使算法更具鲁棒性,还设计了离散点筛选、自适应更新策略。利用飞行视频数据库进行了大量的仿真,结果表明:该算法适用于多尺度图像序列中位置、姿态发生快速变化且结构简单的飞行器的稳定跟踪。帧平均时间为31.8 ms,比SIFT+P-KLT跟踪算法减少47.1%;帧几何中心、目标轮廓面积平均误差分别为5.03像素、16.3%,分别比GFTT+P-KLT跟踪算法减少27.2%、56.9%,比SIFT跟踪算法减少38.6%、68.4%。     

一种基于二级变维Kalman滤波的跟踪算法

Kalman滤波器是一种高速的目标跟踪器.针对不同阶数的Kalman滤波器具有不同的跟踪能力与跟踪效率之间存在的矛盾,设计了一种自适应Kalman滤波算法.该算法使用两级滤波器,根据目标机动性的变化,适当的调整滤波器的阶数,使跟踪结果快速收敛,很好地解决了矛盾.通过对仿真结果分析表明,算法具有可靠、计算简便、快速等特点,模型滤波精度较高,并可实现实时跟踪预测,具有一定的理论价值和实用价值.     

基于运动信息的视频图像空间目标检测

针对卫星拍摄的以深空为背景的视频图像中空间运动目标的检测问题进行了研究,提出了一种基于运动信息的目标检测算法。首先,通过均值滤波对图像进行降噪处理；然后,采用基于局部统计的可变阈值来分割单帧图像,使用灰度重心法计算像点坐标。当卫星凝视目标区域时,恒星可以认为是静止的,而目标依旧在运动,基于此,可检测出空间运动目标。基于某型卫星在轨拍摄的视频图像验证了算法的有效性。     

Optimization of point target tracking filters

We review a powerful temporal-based algorithm, a triple temporal filter (TTF) with six input parameters, for detecting and tracking point targets in consecutive frame data acquired with staring infrared (IR) cameras. Using an extensive data set of locally acquired real-world data, we used an iterative optimization technique, the Simplex algorithm, to find an optimum set of input parameters for a given data set. Analysis of correlations among the optimum filter parameters based on a representative subset of our database led to two improved versions of the filter: one dedicated to noise-dominated scenes, the other to cloud clutter-dominated scenes. Additional correlations of filter parameters with measures of clutter severity and target velocity as well as simulations of filter responses to idealized targets reveal which features of the data determine the best choice of filter parameters. The performance characteristics of the filter is detailed by a few example scenes and metric plots of signal to clutter gains and signal to noise gains over the total database     

Linear Regression Filtering and Prediction for Tracking Maneuvering Aircraft Targets

A Cartesian coordinate linear regression filter is utilized for tracking maneuvering aircraft targets. Measurements of target position are made in a line-of-sight coordinate frame, but filtering is performed in Cartesian coordinates. Numerical results are given for optimizing the truncation time constant such that a good balance is obtained between the dynamic errors and the standard deviations. Lower bounds on the dynamic errors are established for the Cartesian coordinate linear regression filter and compared with a line-of-sight coordinate Kalman filter.     

Track labeling and PHD filter for multitarget tracking

Multiple target tracking requires data association that operates in conjunction with filtering. When multiple targets are closely spaced, the conventional approaches (as, e.g., MHT/assignment) may not give satisfactory results. This is mainly because of the difficulty in deciding what the number of targets is. Recently, the probability hypothesis density (PHD) filter has been proposed and particle filtering techniques have been developed to implement the PHD filter. In the particle PHD filter, the track labeling problem is not considered, i.e., the PHD is obtained only for a frame at a time, and it is very difficult to perform the multipeak extraction, particularly in high clutter environments. A track labeling method combined with the PHD approach, as well as considering the finite resolution, is proposed here for multitarget tracking, i.e., we keep a separate tracker for each target, use the PHD in the resolution cell to get the estimated number and locations of the targets at each time step, and then perform the track labeling ("peak-to-track" association), whose results can provide information for PHD peak extraction at the next time step. Besides, by keeping a separate tracker for each target, our approach provides more information than the standard particle PHD filter. For example, in group target tracking, if we are interested in the motion of a specific target, we can track this target, which is not possible for the standard particle PHD filter, since the standard particle PHD filter does not keep track labels. Using our approach, multitarget tracking can be performed with automatic track initiation, maintenance, spawning, merging, and termination     

混合线性/非线性模型的准高斯Rao-Blackwellized粒子滤波法

 针对混合线性/非线性模型,提出一种新的递推估计滤波算法,称为准高斯Rao-Blackwellized粒子滤波器（Q-GRBPF）。算法采用Rao-Blackwellized思想,将线性状态与非线性状态进行分离,对非线性状态运用准高斯粒子滤波（Q-GPF）算法进行估计,并将其后验分布近似为单个高斯分布,再利用非线性状态的估计值对线性状态进行卡尔曼滤波（KF）估计。将Q-GRBPF应用于目标跟踪的仿真结果表明,与Rao-Blackwellized粒子滤波器（RBPF）相比,Q-GRBPF在保证估计精度的前提下有效降低了计算复杂度,计算时间约为RBPF的58%;与Q-GPF相比,x坐标与y坐标的估计精度分别提升了45％和30％,而计算时间也节省了约30％。     

一种新的基于机动检测的机动目标跟踪算法

针对Kalman滤波跟踪机动目标发散和目前多数自适应Kalman滤波算法对运动模型适应性不强的问题,提出了一种新的基于机动检测的机动目标跟踪算法,通过实时自适应的改变滤波模型提高对机动目标跟踪精度。对这种方法与Kalman滤波算法进行了计算机仿真比较,结果表明,该方法计算量小,可实时精确地自适应匹配目标的运动模型,可实现对机动目标稳定可靠的跟踪。     

帧差法和Mean shift算法融合的高速无人机目标跟踪

为实时跟踪高速飞行无人机,图像跟踪算法必须满足快速性和准确性要求。文章给出一个融合算法,将帧差法和 Mean shift算法的优势结合起来。2个算法平行运行,差帧法实现快速跟踪,Mean shift算法则用于对帧差法结果进行准确度修正。还利用 Kalman滤波技术对计算周期内的无人机运动位移进行补偿,进一步提高实时跟踪的准确性,并给出 Matlab仿真例子验证本文方法的有效性。     

空间多分辨率模糊目标跟踪

提出了一种新的模糊目标跟踪算法--CPDA算法。这个算法在空间多分辨率框架下应用概率数据互联算法,在粗分辨率上实现模糊目标跟踪。在不同虚警密度的模糊目标环境下,利用仿真实验分析了CPDA算法的跟踪性能,同时将其与单分辨率上的联合概率数据互联方法进行了性能比较。仿真结果表明,CPDA算法的跟踪性能在达到与单分辨率上JPDA算法同样性能的条件下,能够以较小的计算量跟踪模糊目标。     

A Fast Global Node Selection Algorithm for Bearings-only Target Localization

In the target tracking, the nodes aggregate their observations of the directions of arrival of the target. The network then uses an extended Kalman filter （EKF） to combine the measurements from multiple snapshots to track the target. In order to rapidly select the best subset of nodes to localize the target with the minimum mean square position error and low power consumption, this paper proposes a simple algorithm, which uses the location information of the target and the network. The lower botmd of localization error is utilized according to the distances between the target and the selected active nodes. Furthermore, the direction likelihoods of the active nodes is predicted by way of the node/target bearing distributing relationships.     

Efficient Approximation of Kalman Filter for Target Tracking

A Kalman filter in the Cartesian coordinates is described for a maneuvering target when the radar sensor measures range, bearing, and elevation angles in the polar coordinates at high data rates. An approximate gain computation algorithm is developed to determine the filter gains for on-line microprocessor implementation. In this approach, gains are computed for three uncoupled filters and multiplied by a Jacobian transformation determined from the measured target position and orientation. The algorithm is compared with the extended Kalman filter for a typical target trajectory in a naval gun fire control system. The filter gains and the tracking errors for the proposed algorithm are nearly identical to the extended Kalman filter, while the computation requirements are reduced by a factor of four.     

A Self-organizing Bearings-only Target Tracking Algorithm in Wireless Sensor Network

In the bearings-only target tracking, wireless sensor network (WSN) collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient network management is necessary to gain an optimal tradeoff between locating accuracy and energy consumption. This article proposes a self-organizing target tracking algorithm to select the most beneficial subset of nodes to track the target at every snapshot. Compared with traditional methods, this scheme avoids the need for keeping global position information of the network as in greedy selection. Each node judges its future usefulness depending on the knowledge of its own position and using simple mathematics computation. Simulations indicate that this scheme has locating accuracy comparable to the global greedy algorithm. Also, it has good robustness against node failure and autonomous adaptability to the change of the network scale. Furthermore, this algorithm consumes limited energy because only a portion of nodes partakes in the selection at every snapshot.     

An improved multiple model GM-PHD filter for maneuvering target tracking

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.     

基于 SURF算法和 Kalman预测的运动目标跟踪

SURF(Speeded Up Robust Feature)特征提取方法是SIFT(Scale Invariant Feature Transform)算法的改进,具有速度快和精度高等特点,但其对于较大尺寸图像的匹配速度仍然有待提高。文章提出了一种将基于SURF特征匹配算法与卡尔曼滤波相融合的目标跟踪算法,该算法用特征点的中心近似目标最佳位置;通过卡尔曼滤波预测出当前的目标位置,建立自适应匹配窗口;最后,应用SURF算法提取窗口内的特征向量进行匹配。实验表明,该算法在目标发生大尺度旋转和缩放、部分遮挡时能够稳定跟踪,其跟踪速度比SURF算法有很大的提高。     

非线性非高斯模型的高斯和PHD滤波算法(英文)

A new multi-target filtering algorithm, termed as the Gaussian sum probability hypothesis density （GSPHD） filter, is proposed for nonlinear non-Gaussian tracking models. Provided that the initial prior intensity of the states is Gaussian or can be identified as a Gaussian sum, the analytical results of the algorithm show that the posterior intensity at any subsequent time step remains a Gaussian sum under the assumption that the state noise, the measurement noise, target spawn intensity, new target birth intensity, target survival probability, and detection probability are all Gaussian sums. The analysis also shows that the existing Gaussian mixture probability hypothesis density （GMPHD） filter, which is unsuitable for handling the non-Gaussian noise cases, is no more than a special case of the proposed algorithm, which fills the shortage of incapability of treating non-Gaussian noise. The multi-target tracking simulation results verify the effectiveness of the proposed GSPHD.     

Mixture Reduction Algorithms for Point and Extended Object Tracking in Clutter

The Bayesian solution to the problem of tracking a target with measurement association uncertainty gives rise to mixture distributions, which are composed of an ever increasing number of components. To produce a practical tracking filter, the growth of components must be controlled by approximating the mixture distribution. Two mixture reduction schemes (a joining algorithm and a clustering algorithm) have been derived for this purpose. If significant well spaced mixture components are present, these techniques can provide a useful improvement over the probabilistic data association filter (PDAF) approach, which reduces the mixture to a single Gaussian component at each time step. For the standard problem of tracking a point target in uniform random clutter, a Monte Carlo simulation study has been employed to identify the region of the problem parameter space where significant performance improvement is obtained over the PDAF. In the second part of this paper, the formal Bayesian filter is derived for an extended target consisting of an array of measurement sources with association uncertainty. A practical multiple hypothesis filter is implemented using mixture reduction and simulation results are presented.     

多坐标系下目标跟踪的联合滤波

针对雷达目标观测和处理在不同的坐标系下完成，本文提出了联合滤波算法来跟踪机动目标。该算法以卡尔曼滤波器为基础，直角坐标系下和极坐标系下的算法相联合，不仅克服了两种坐标系下滤波算法的不足，而且对机动目标有很好的跟踪效果。仿真实验结果表明了该算法的有效性。     

Shifted Rayleigh filter: a new algorithm for bearings-only tracking

A new algorithm, the "shifted Rayleigh filter," is introduced for two- or three-dimensional bearings-only tracking problems. In common with other "moment matching" tracking algorithms such as the extended Kalman filter and its modern refinements, it approximates the prior conditional density of the target state by a normal density; the novel feature is that an exact calculation is then performed to update the conditional density in the light of the new measurement. The paper provides the theoretical justification of the algorithm. It also reports on simulations involving variants on two scenarios, which have been the basis of earlier comparative studies. The first is a "benign" scenario where the measurements are comparatively rich in range-related information; here the shifted Rayleigh filter is competitive with standard algorithms. The second is a more "extreme" scenario, involving multiple sensor platforms, high-dimensional models and noisy measurements; here the performance of the shifted Rayleigh filter matches the performance of a high-order bootstrap particle filter, while reducing the computational overhead by an order of magnitude.     

基于邻帧差分近邻反相特征的红外运动点目标检测算法

基于运动点目标在邻帧差分图像中所具有的近邻反相特征,即运动点目标的两个位置相邻近、灰度值一正一负,提出一种在复杂背景下,基于红外序列图像的运动点目标检测算法.本算法利用该特征在邻帧差分图像中检测反相点对,进而构造反相点对矢量图,最后依据累积反相点对矢量图中多矢量首位相接的连续性检测出运动的点目标.文中给出并证明应用本算法能以概率1检测到运动点目标的收敛性定理.对典型复杂背景下10幅1000帧图像的仿真结果表明,当信噪比大于或等于1.5时,可以有效检测出运动点目标.