Joint target assignment and power allocation in the netted C-MIMO radar when tracking multi-targets in the presence of self-defense blanket jamming

The netted radar system(NRS)has been proved to possess unique advantages in anti-jamming and improving target tracking performance.Effective resource management can greatly ensure the combat capability of the NRS.In this paper,based on the netted collocated multiple input multiple output(CMIMO)radar,an effective joint target assignment and power allocation(JTAPA)strategy for tracking multi-targets under self-defense blanket jamming is proposed.An architecture based on the distributed fusion is used in the radar network to estimate target state parameters.By deriving the predicted conditional Cramer-Rao lower bound(PC-CRLB)based on the obtained state estimation information,the objective function is formulated.To maximize the worst case tracking accuracy,the proposed JTAPA strategy implements an online target assignment and power allocation of all active nodes,subject to some resource constraints.Since the formulated JTAPA is non-convex,we propose an efficient two-step solution strategy.In terms of the simulation results,the proposed algorithm can effectively improve tracking performance in the worst case.

Multi-Target Tracking of Person Based on Deep Learning

To improve the tracking accuracy of persons in the surveillance video,we proposed an algorithm for multi-target tracking persons based on deep learning.In this paper,we used You Only Look Once v5(YOLOv5)to obtain person targets of each frame in the video and used Simple Online and Realtime Tracking with a Deep Association Metric(DeepSORT)to do cascade matching and Intersection Over Union(IOU)matching of person targets between different frames.To solve the IDSwitch problem caused by the low feature extraction ability of the Re-Identification(ReID)network in the process of cascade matching,we introduced Spatial Relation-aware Global Attention(RGA-S)and Channel Relation-aware Global Attention(RGA-C)attention mechanisms into the network structure.The pre-training weights are loaded for Transfer Learning training on the dataset CUHK03.To enhance the discrimination performance of the network,we proposed a new loss function design method,which introduces the Hard-Negative-Mining way into the benchmark triplet loss.To improve the classification accuracy of the network,we introduced a Label-Smoothing regularization method to the cross-entropy loss.To facilitate the model’s convergence stability and convergence speed at the early training stage and to prevent the model from oscillating around the global optimum due to excessive learning rate at the later stage of training,this paper proposed a learning rate regulation method combining Linear-Warmup and exponential decay.The experimental results on CUHK03 show that the mean Average Precision(mAP)of the improved ReID network is 76.5%.The Top 1 is 42.5%,the Top 5 is 65.4%,and the Top 10 is 74.3%in Cumulative Matching Characteristics(CMC);Compared with the original algorithm,the tracking accuracy of the optimized DeepSORT tracking algorithm is improved by 2.5%,the tracking precision is improved by 3.8%.The number of identity switching is reduced by 25%.The algorithm effectively alleviates the IDSwitch problem,improves the tracking accuracy of persons,and has a high practical value.

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.

Dynamic cluster member selection method for multi-target tracking in wireless sensor network

Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a special cluster member(CM) node selection method is put forward in the scheme.An energy efficiency model was proposed under consideration of both energy consumption and remaining energy balance in the network.A tracking accuracy model based on area-sum principle was also presented through analyzing the localization accuracy of triangulation.Then,the two models mentioned above were combined to establish dynamic cluster member selection model for MTT where a comprehensive performance index function was designed to guide the CM node selection.This selection was fulfilled using genetic algorithm.Simulation results show that this method keeps both energy efficiency and tracking quality in optimal state,and also indicate the validity of genetic algorithm in implementing CM node selection.

Multi-target tracking algorithm based on PHD filter against multi-range-false-target jamming

Multi-range-false-target(MRFT) jamming is particularly challenging for tracking radar due to the dense clutter and the repeated multiple false targets. The conventional association-based multi-target tracking(MTT) methods suffer from high computational complexity and limited usage in the presence of MRFT jamming.In order to solve the above problems, an efficient and adaptable probability hypothesis density(PHD) filter is proposed. Based on the gating strategy, the obtained measurements are firstly classified into the generalized newborn target and the existing target measurements. The two categories of measurements are independently used in the decomposed form of the PHD filter. Meanwhile,an amplitude feature is used to suppress the dense clutter. In addition, an MRFT jamming suppression algorithm is introduced to the filter. Target amplitude information and phase quantization information are jointly used to deal with MRFT jamming and the clutter by modifying the particle weights of the generalized newborn targets. Simulations demonstrate the proposed algorithm can obtain superior correct discrimination rate of MRFT, and high-accuracy tracking performance with high computational efficiency in the presence of MRFT jamming in the dense clutter.

An Iterative Pose Estimation Algorithm Based on Epipolar Geometry With Application to Multi-Target Tracking

This paper introduces a new algorithm for estimating the relative pose of a moving camera using consecutive frames of a video sequence. State-of-the-art algorithms for calculating the relative pose between two images use matching features to estimate the essential matrix. The essential matrix is then decomposed into the relative rotation and normalized translation between frames. To be robust to noise and feature match outliers, these methods generate a large number of essential matrix hypotheses from randomly selected minimal subsets of feature pairs, and then score these hypotheses on all feature pairs. Alternatively, the algorithm introduced in this paper calculates relative pose hypotheses by directly optimizing the rotation and normalized translation between frames, rather than calculating the essential matrix and then performing the decomposition. The resulting algorithm improves computation time by an order of magnitude. If an inertial measurement unit(IMU) is available, it is used to seed the optimizer, and in addition, we reuse the best hypothesis at each iteration to seed the optimizer thereby reducing the number of relative pose hypotheses that must be generated and scored. These advantages greatly speed up performance and enable the algorithm to run in real-time on low cost embedded hardware. We show application of our algorithm to visual multi-target tracking(MTT) in the presence of parallax and demonstrate its real-time performance on a 640 × 480 video sequence captured on a UAV. Video results are available at https://youtu.be/Hh K-p2 h XNn U.

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.

METHOD OF MULTI-TARGET TRACKING IN WIDE AREA SURVEILLANCE AIRBORNE RADAR SYSTEM BASING ON CLUSTERING ANALYSIS

This paper proposed a robust method based on the definition of Mahalanobis distance to track ground moving target. The feature and the geometry of airborne ground moving target tracking systems are studied at first. Based on this feature, the assignment relation of time-nearby target is calculated via Mahalanobis distance, and then the corresponding transformation formula is deduced. The simulation results show the correctness and effectiveness of the proposed method.

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.

MULTI-TARGET VISUAL TRACKING AND OCCLUSION DETECTION BY COMBINING BHATTACHARYYA COEFFICIENT AND KALMAN FILTER INNOVATION

This paper introduces an approach for visual tracking of multi-target with occlusion occurrence. Based on the author's previous work in which the Overlap Coefficient (OC) is used to detect the occlusion, in this paper a method of combining Bhattacharyya Coefficient (BC) and Kalman filter innovation term is proposed as the criteria for jointly detecting the occlusion occurrence. Fragmentation of target is introduced in order to closely monitor the occlusion development. In the course of occlusion, the Kalman predictor is applied to determine the location of the occluded target, and the criterion for checking the re-appearance of the occluded target is also presented. The proposed approach is put to test on a standard video sequence, suggesting the satisfactory performance in multi-target tracking.

Adaptive resource management for multi-target tracking in co-located MIMO radar based on time-space joint allocation

Compared with the traditional phased array radar, the co-located multiple-input multiple-output(MIMO) radar is able to transmit orthogonal waveforms to form different illuminating modes, providing a larger freedom degree in radar resource management. In order to implement the effective resource management for the co-located MIMO radar in multi-target tracking,this paper proposes a resource management optimization model,where the system resource consumption and the tracking accuracy requirements are considered comprehensively. An adaptive resource management algorithm for the co-located MIMO radar is obtained based on the proposed model, where the sub-array number, sampling period, transmitting energy, beam direction and working mode are adaptively controlled to realize the time-space resource joint allocation. Simulation results demonstrate the superiority of the proposed algorithm. Furthermore, the co-located MIMO radar using the proposed algorithm can satisfy the predetermined tracking accuracy requirements with less comprehensive cost compared with the phased array radar.

Kernel density estimation and marginalized-particle based probability hypothesis density filter for multi-target tracking

In order to improve the performance of the probability hypothesis density(PHD) algorithm based particle filter(PF) in terms of number estimation and states extraction of multiple targets, a new probability hypothesis density filter algorithm based on marginalized particle and kernel density estimation is proposed, which utilizes the idea of marginalized particle filter to enhance the estimating performance of the PHD. The state variables are decomposed into linear and non-linear parts. The particle filter is adopted to predict and estimate the nonlinear states of multi-target after dimensionality reduction, while the Kalman filter is applied to estimate the linear parts under linear Gaussian condition. Embedding the information of the linear states into the estimated nonlinear states helps to reduce the estimating variance and improve the accuracy of target number estimation. The meanshift kernel density estimation, being of the inherent nature of searching peak value via an adaptive gradient ascent iteration, is introduced to cluster particles and extract target states, which is independent of the target number and can converge to the local peak position of the PHD distribution while avoiding the errors due to the inaccuracy in modeling and parameters estimation. Experiments show that the proposed algorithm can obtain higher tracking accuracy when using fewer sampling particles and is of lower computational complexity compared with the PF-PHD.

Research and Application of Multi-Target Tracking Based on GM-PHD Filter

In recent years, multi-target tracking technology based on Gaussian Mixture- Probability Hypothesis Density (GM-PHD) filtering has become a hot field of information fusion research. This article outlines the generation and development of multi-target tracking methods based on GM-PHD filtering, and the principle and implementation method of GM-PHD filtering are explained, and the application status based on GM-PHD filtering is summarized, and the key issues of the development of GM-PHD filtering technology are analyzed.

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.

Robust attitude control for rapid multi-target tracking in spacecraft formation flying

A robust attitude tracking control scheme for spacecraft formation flying is presented. The leader spacecraft with a rapid mobile antenna and a camera is modeled. While the camera is tracking the ground target, the antenna is tracking the follower spacecraft. By an angular velocity constraint and an angular constraint, two methods are proposed to compute the reference attitude profiles of the camera and antenna, respectively. To simplify the control design problem, this paper first derives the desired inverse system （DIS）, which can convert the attitude tracking problem of 3D space into the regulator problem. Based on DIS and sliding mode control （SMC）, a robust attitude tracking controller is developed in the presence of mass parameter uncertainties and external disturbance. By Lyapunov stability theory, the closed loop system stability can be achieved. The numerical simulations show that the proposed robust control scheme exhibits significant advantages for the multi-target attitude tracking of a two-spacecraft formation.

Computer Model for Evaluating Multi-Target Tracking Algorithms

Public benchmark datasets have been widely used to evaluate multi-target tracking algorithms. Ideally, the benchmark datasets should include the video scenes of all scenarios that need to be tested. However, a limited amount of the currently available benchmark datasets does not comprehensively cover all necessary test scenarios. This limits the evaluation of multitarget tracking algorithms with various test scenarios. This paper introduced a computer simulation model that generates benchmark datasets for evaluating multi-target tracking algorithms with the complexity of multitarget tracking scenarios directly controlled by simulation inputs such as target birth and death rates, target movement, the rates of target merges and splits, target appearances, and image noise types and levels. The simulation model generated a simulated video and also provides the ground-truth target tracking for the simulated video, so the evaluation of multitarget tracking algorithms can be easily performed without any manual video annotation process. We demonstrated the use of the proposed simulation model for evaluating tracking-by-detection algorithms and filtering-based tracking algorithms.

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.

Underwater multiple target tracking decision making based on an analytic network process

Underwater multi-target tracking logic and decision （UMTLD） has difficulty resolving multi-target tracking problems for underwater vehicles. Present methods assume factors in UMTLD are uncorrelated, when these are actually in a complex, interdependent relationship. To provide this, an index set of multi-target tracking decision characteristics and an analytic network process （ANP） model of the UMTLD method was -established. This method brings the index set of multi-target tracking decision into the ANP model, and the optimization multitarket tracking decision is achieved via computation of the resulting supermatrix. The rationality and robustness of decision results increase in simulations by 13% and 47% respectively with analytic hierarchy process （AHP）. These results indicate that the ANP method should be the preferred method when UMTLD factors are interdependent.

Performance evaluation for multi-target tracking with temporal dimension specifics

With the great development of Multi-Target Tracking(MTT)technologies,many MTT algorithms have been proposed with their own advantages and disadvantages.Due to the fact that requirements to MTT algorithms vary from the application scenarios,performance evaluation is significant to select an appropriate MTT algorithm for the specific application scenario.In this paper,we propose a performance evaluation method on the sets of trajectories with temporal dimension specifics to compare the estimated trajectories with the true trajectories.The proposed method evaluates the estimate results of an MTT algorithm in terms of tracking accuracy,continuity and clarity.Furthermore,its computation is based on a multi-dimensional assignment problem,which is formulated as a computable form using linear programming.To enhance the influence of recent estimated states of the trajectories in the evaluation,an attention function is used to reweight the trajectory errors at different time steps.Finally,simulation results show that the proposed performance evaluation method is able to evaluate many aspects of the MTT algorithms.These evaluations are worthy for selecting suitable MTT algorithms in different application scenarios.

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.