Efficient 2-D MUSIC algorithm for super-resolution moving target tracking based on an FMCW radar

Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal classification(MUSIC)and compressed sensing,etc.,cannot achieve both low complexity and high resolution simultaneously.This paper proposes an efficient 2-D MUSIC algorithm for super-resolution target estimation/tracking based on FMCW radar.Firstly,we enhance the efficiency of 2-D MUSIC azimuth-range spectrum estimation by incorporating 2-D DFT and multi-level resolution searching strategy.Secondly,we apply the gradient descent method to tightly integrate the spatial continuity of object motion into spectrum estimation when processing multi-epoch radar data,which improves the efficiency of continuous target tracking.These two approaches have improved the algorithm efficiency by nearly 2-4 orders of magnitude without losing accuracy and resolution.Simulation experiments are conducted to validate the effectiveness of the algorithm in both single-epoch estimation and multi-epoch tracking scenarios.

WSN Mobile Target Tracking Based on Improved Snake-Extended Kalman Filtering Algorithm

A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.

Target Tracking Algorithm Based on Meanshift and Kalman Filter

Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalman filtering algorithm to determine the position of the target centroid and subsequently adjust the current search window adaptively according to the target centroid position and the previous frame search window boundary.The derived search window is more closely matched to the location of the target,which improves the accuracy and reliability of tracking.The environmental influence and other influencing factors on the algorithm are also reduced.Through comparison and analysis of the experiments,the modified algorithm demonstrates good stability and adaptability,and can effectively solve the problem of large area occlusion and similar interference.

Dynamic alliance target tracking based on genetic algorithms in wireless sensor networks

Dynamic alliance(DA),namely,virtual corporations (VCs),is an enterprise management method. It means a temporary union formed by some independent commercial processes or corporations.Here, genetic algorithms(GA) is applied to the research of nodes DA selection optimization in wireless sensor networks(WSN) target tracking(TT) problem.The detailed optimized selection method is presented in the paper and a typical simulation is conducted to verify the effectiveness of our model.

Track Association for Dynamic Target Tracking System Based on AP Algorithm

Track association of multi-target has been recognized as one of the key technologies in distributed multiple-sensor data fusion system,and its accuracy directly impacts on the performance of the whole tracking system.A multi-sensor data association is proposed based on aftinity propagation(AP)algorithm.The proposed method needs an initial similarity,a distance between any two points,as a parameter,therefore,the similarity matrix is calculated by track position,velocity and azimuth of track data.The approach can automatically obtain the optimal classification of uncertain target based on clustering validity index.Furthermore,the same kind of data are fused based on the variance of measured data and the fusion result can be taken as a new measured data of the target.Finally,the measured data are classified to a certain target based on the nearest neighbor ideas and its characteristics,then filtering and target tracking are conducted.The experimental results show that the proposed method can effectively achieve multi-sensor and multi-target track association.

Moving Target Tracking Based on LogGabor Wavelet and Mean-shift Algorithm

Tracking moving target from image or video sequence is a hot research topic in computer vision. An algorithm based on LogGabor wavelet and Mean-shift has been proposed for moving target tracking under fixed camera setting and complicated environment. Phase coherency of LogGabor wavelet facilitates to extract the edge of moving target and check noise. According to the edge detection,the starting location of Mean-shift can be estimated using the target center coordinate. Eventually,a real-time moving target can be extracted by doing iterative matching pursuit,and experimental results proved the effectiveness of the method proposed.

Tracking Target Identification Model Based on Multiple Algorithms

In view of current situation of bad data synchronization, image blurring and tracking station stability in tracking target identification, a kind of tracking target identification model based on multiple algorithms was put forward, firstly establishing the image degradation model, using the wavelet algorithm for image preprocessing, doing image edge segmentation by using Robert algorithm after pretreatment, then using the maximum variance threshold method for image threshold segmentation, then extracting target features from the segmented image, and finally using the ABS algorithm to finish target tracking. Experiments proved the proposed model practical and effective.

Prediction-based protocol for mobile target tracking in wireless sensor networks

Remote tracking for mobile targets is one of the most important applications in wireless sensor networks （WSNs）. A target tracking protoco–exponential distributed predictive tracking （EDPT） is proposed. To reduce energy waste and response time, an improved predictive algorithm–exponential smoothing predictive algorithm （ESPA） is presented. With the aid of an additive proportion and differential （PD） controller, ESPA decreases the system predictive delay effectively. As a recovery mechanism, an optimal searching radius （OSR） algorithm is applied to calculate the optimal radius of the recovery zone. The simulation results validate that the proposed EDPT protocol performes better in terms of track failed ratio, energy waste ratio and enlarged sensing nodes ratio, respectively.

Sensor radiation interception risk control in target tracking

This paper is mainly on the problem of radiation interception risk control in sensor network for target tracking.Firstly,the sensor radiation interception risk is defined as the product of the interception probability and the cost caused by the interception.Secondly,the radiation interception probability model and cost model are established,based on which the calculation method of interception risk can be obtained.Thirdly,a sensor scheduling model of radiation risk control is established,taking the minimum interception risk as the objective function.Then the Hungarian algorithm is proposed to obtain sensor scheduling scheme.Finally,simulation experiments are mad to prove the effectiveness of the methods proposed in this paper,which shows that compared with the sensor radiation interception probability control method,the interception risk control method can keep the sensor scheduling scheme in low risk as well as protect sensors of importance in the sensor network.

Automatic target tracking on multi-resolution terrain

We propose a high-performance path planning algorithm for automatic target tracking in the applications of real-time simulation and visualization of large-scale terrain datasets, with a large number of moving objects （such as vehicles） tracking multiple moving targets. By using a modified Dijkstra＇s algorithm, an optimal path between each vehicle-target pair over a weighted grid-presented terrain is computed and updated to eliminate the problem of local minima and losing of tracking. Then, a dynamic path re-planning strategy using multi-resolution representation of a dynamic updating region is proposed to achieve high-performance by trading-off precision for efficiency, while guaranteeing accuracy. Primary experimental results showed that our algorithm successfully achieved l0 to 96 frames per second interactive path-replanning rates during a terrain simulation scenario with 10 to 100 vehicles and multiple moving targets.

Adaptive tracking algorithm based on 3D variable turn model

Satisfactory results cannot be obtained when three-dimensional (3D) targets with complex maneuvering characteristics are tracked by the commonly used two-dimensional coordinated turn (2DCT) model. To address the problem of 3D target tracking with strong maneuverability, on the basis of the modified three-dimensional variable turn (3DVT) model, an adaptive tracking algorithm is proposed by combining with the cubature Kalman filter (CKF) in this paper. Through ideology of real-time identification, the parameters of the model are changed to adjust the state transition matrix and the state noise covariance matrix. Therefore, states of the target are matched in real-time to achieve the purpose of adaptive tracking. Finally, four simulations are analyzed in different settings by the Monte Carlo method. All results show that the proposed algorithm can update parameters of the model and identify motion characteristics in real-time when targets tracking also has a better tracking accuracy.

A new energy efficient management approach for wireless sensor networks in target tracking

This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly, the analysis of existing energy consuming in the sensing layer and its calculation method were provided to build the energy conserving objective function;What’s more, the other two indicators in target tracking, including target detection probability and tracking accuracy, were combined to be regarded as the constraints of the energy conserving objective function. Fourthly, the three energy conserving approaches, containing optimizing the management scheme, prolonging the time interval between two adjacent observations, and transmitting the observations selectively, were introduced;In addition, the improved lion algorithm combined with the Logistic chaos sequence was proposed to obtain sensor management schemes. Finally, simulations had been made to prove the effectiveness of the proposed methods and algorithm.

Ant colony optimization for bearings-only maneuvering target tracking in sensors network

In this paper, the problem of bearings-only maneuvering target tracking in sensors network is investigated. Two objectives are proposed and optimized by the ant colony optimization （ACO）, then two kinds of node searching strategies of the ACO algorithm are presented. On the basis of the nodes determined by the ACO algorithm, the interacting multiple models extended Kalman filter （IMMEKF） for the multi-sensor bearings-only maneuvering target tracking is introduced. Simulation results indicate that the proposed ACO algorithm performs better than the Closest Nodes method. Furthermore, the Strategy 2 of the two given strategies is preferred in terms of the requirement of real time.

A new improved filter for target tracking: compressed iterative particle filter

Target tracking in video is a hot topic in computer vision field, which has wide applications in surveillance, robot navigation and human-machine interaction etc. Meanshift is widely used algorithm in video target tracking field. The basic mean shift algorithm only considers the color of targets as the tracking characteris- tic feature, so if the appearance of the target changes greatly or there exits other objects whose color is similar to the target, the tracking process will fail. To enhance the stability and robustness of the algorithm, we introduce par- ticle filter into the tracking process. Basic particle filter has some disadvantages such as low accuracy, high computational complexity. In this paper, an improved particle filter GA-UPF was proposed, in which a new re-sampling algorithm was used to predict target centroid position. The target tracking system of binocular stereo vision is designed and implemented. Experi- mental results have shown that our algorithm can tracking object in video with high accuracy and low computational complexity.

Vehicle recognition and tracking based on simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm

Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.

A combination algorithm of Chaos optimization and genetic algorithm and its application in maneuvering multiple targets data association

The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to deal with the problem of multi-targets data association separately. Based on the analysis of the limitation of chaos optimization and genetic algorithm, a new chaos genetic optimization combination algorithm was presented. This new algorithm first applied the "rough" search of chaos optimization to initialize the population of GA, then optimized the population by real-coded adaptive GA. In this way, GA can not only jump out of the "trap" of local optimal results easily but also increase the rate of convergence. And the new method can also avoid the complexity and time-consumed limitation of conventional way. The simulation results show that the combination algorithm can obtain higher correct association percent and the effect of association is obviously superior to chaos optimization or genetic algorithm separately. This method has better convergence property as well as time property than the conventional ones.

STUDY ON ALGORITHM OF SENSOR MANAGEMENT BASED ON FUNCTIONS OF EFFICIENCY AND WASTE

Sensor management plays an important role in data fusion system, and this paper presents an algorithm of sensor management that can be used in target detection, identification and tracking. First, the basic concept, rule, range and function of sensor management are introduced. Then, the quantifying problems of target priority and sensor (or combination)-target pairing in multisensor management are discussed and the efficiency and waste functions are established based on the functions of target priority and sensor-target pairing. On this basis, a distribution algorithm of multi-sensor resources is given, which is optimized by the principle of maximum synthesis efficiency in the multisensor system and constrained by sensor maximum tracking power and what target must be scanned. In addition, the waste measure of sensor resources is introduced to improve the algorithm. Finally, a tactical task that includes three sensors and ten targets is set, and the simulation results show that the algorithm is feasible and effective.

Cooperative distributed target tracking algorithm in mobile wireless sensor networks

The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor networks.There are two main components in the algorithm:distributed sensor-target assignment and sensor motion control.In the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking cost.Compared with the centralized algorithm and the noncooperative distributed algorithm,the proposed approach will not only lead to reasonable measuring performance but also benefit system with low computational complexity and communication energy.Also,a sensor motion algorithm based on gradient control is presented in the paper to trace the targets to reduce tracking error.Simulation results show that the cooperative distributed sensor assignment algorithm has advantages over the centralized algorithm without sacrificing much tracking performance.

基于势平衡多伯努利滤波的多传感器纯方位多目标跟踪

被动传感器不主动发射信号,通常仅获得目标的角度量测信息,无法获得径向距离信息,这种仅利用角度量测信息对多目标跟踪的方法称为纯方位多目标跟踪。实际应用中,纯方位多目标跟踪面临三个主要问题:一是由于被动传感器只获取目标的角度量测,导致量测信息不完备;二是量测方程存在高度非线性;三是由于传感器可能接收到杂波等非目标产生的量测,导致量测源不确定。针对上述问题,本文提出一种多传感器贪婪伪线性粒子势平衡多伯努利滤波。首先采用Rao-Blackwell理论将混合目标状态向量分解,将与量测值相关的位置分量视为非线性分量,而与量测值无关的速度分量视为线性分量,并分别采用粒子滤波器(Particle Filter,PF)和卡尔曼滤波器(Kalman Filter,KF)进行处理,从而有效降低粒子滤波采样维度。其次,针对传统粒子采样严重依赖模型的问题,基于伪线性卡尔曼滤波器(Pseudo-linear Kalman Filter,PLKF)设计一种新型粒子采样方法,即利用PLKF和最新量测信息构造重要性密度函数,并对非线性分量进行粒子采样;在更新阶段采用贪婪量测划分策略选取最优量测集合,并利用最优量测集合中量测信息实现多目标状态集中式融合估计。最后,通过仿真结果验证,本文所提滤波器能在杂波环境中仅利用角度量测对目标进行有效稳定的跟踪,相较于对比方法,所提滤波器能够更为准确估计目标数量和状态。

基于SiamFC的海上舰船跟踪实验设计

为了提高海上舰船跟踪准确率,设计了一种基于SAR图像的海上舰船跟踪实验方案。首先利用三组连续的卫星SAR图像构建数据集,然后根据海上舰船尺寸小、全卷积孪生网络(SiamFC)算法网络层数少的特点,提出将SiamFC算法应用于海上舰船跟踪过程。通过调整模型相关参数,并构建数据集,对模型进行了训练及测试。测试结果表明,该模型具有可行性。为了达到更好的跟踪效果,引入伽马算子对SAR图像进行增强,减少了SAR图像的相干斑点噪声。最后,对改进后的模型进行测试的结果表明,该方案的舰船跟踪准确率大大提高。