Alzheimer’s disease(AD)poses one of the most urgent medical challenges in the 21st century as it affects millions of people.Unfortunately,the etiopathogenesis of AD is not yet fully understood and the current pharmac...Alzheimer’s disease(AD)poses one of the most urgent medical challenges in the 21st century as it affects millions of people.Unfortunately,the etiopathogenesis of AD is not yet fully understood and the current pharmacotherapy options are somewhat limited.Here,we report a novel inhibitor,Compound 44,for targeting cholinesterases,amyloid-β(Aβ)aggregation,and glycogen synthase kinase 3β(GSK-3β)simultaneously with the aim of achieving symptomatic relief and disease modification in AD therapy.We found that Compound 44 had good inhibitory effects on all intended targets with IC_(50)s of submicromolar or better,significant neuroprotective effects in cell models,and beneficial improvement of cognitive deficits in the triple transgenic AD(3×Tg AD)mouse model.Moreover,we showed that Compound 44 acts as an autophagy regulator by inducing nuclear translocation of transcription factor EB through GSK-3βinhibition,enhancing the biogenesis of lysosomes and elevating autophagic flux,thus ameliorating the amyloid burden and tauopathy,as well as mitigating the disease phenotype.Our results suggest that triple-target inhibition via Compound 44 could be a promising strategy that may lead to the development of effective therapeutic approaches for AD.展开更多
Dear Editor,Through distributed machine learning,multi-UAV systems can achieve global optimization goals without a centralized server,such as optimal target tracking,by leveraging local calculation and communication w...Dear Editor,Through distributed machine learning,multi-UAV systems can achieve global optimization goals without a centralized server,such as optimal target tracking,by leveraging local calculation and communication with neighbors.In this work,we implement the stochastic gradient descent algorithm(SGD)distributedly to optimize tracking errors based on local state and aggregation of the neighbors'estimation.However,Byzantine agents can mislead neighbors,causing deviations from optimal tracking.We prove that the swarm achieves resilient convergence if aggregated results lie within the normal neighbors'convex hull,which can be guaranteed by the introduced centerpoint-based aggregation rule.In the given simulated scenarios,distributed learning using average,geometric median(GM),and coordinate-wise median(CM)based aggregation rules fail to track the target.Compared to solely using the centerpoint aggregation method,our approach,which combines a pre-filter with the centroid aggregation rule,significantly enhances resilience against Byzantine attacks,achieving faster convergence and smaller tracking errors.展开更多
This paper investigates the distributed continuoustime aggregative optimization problem for second-order multiagent systems,where the local cost function is not only related to its own decision variables,but also to t...This paper investigates the distributed continuoustime aggregative optimization problem for second-order multiagent systems,where the local cost function is not only related to its own decision variables,but also to the aggregation of the decision variables of all the agents.By using the gradient descent method,the distributed average tracking(DAT)technique and the time-base generator(TBG)technique,a distributed continuous-time aggregative optimization algorithm is proposed.Subsequently,the optimality of the system's equilibrium point is analyzed,and the convergence of the closed-loop system is proved using the Lyapunov stability theory.Finally,the effectiveness of the proposed algorithm is validated through case studies on multirobot systems and power generation systems.展开更多
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-bes...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.展开更多
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 s...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.展开更多
In this paper, a cardinality compensation method based on Information-weighted Consensus Filter(ICF) using data clustering is proposed in order to accurately estimate the cardinality of the Cardinalized Probability Hy...In this paper, a cardinality compensation method based on Information-weighted Consensus Filter(ICF) using data clustering is proposed in order to accurately estimate the cardinality of the Cardinalized Probability Hypothesis Density(CPHD) filter. Although the joint propagation of the intensity and the cardinality distribution in the CPHD filter process allows for more reliable estimation of the cardinality(target number) than the PHD filter, tracking loss may occur when noise and clutter are high in the measurements in a practical situation. For that reason, the cardinality compensation process is included in the CPHD filter, which is based on information fusion step using estimated cardinality obtained from the CPHD filter and measured cardinality obtained through data clustering. Here, the ICF is used for information fusion. To verify the performance of the proposed method, simulations were carried out and it was confirmed that the tracking performance of the multi-target was improved because the cardinality was estimated more accurately as compared to the existing techniques.展开更多
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) met...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.展开更多
Multi-target tracking is facing the difficulties of modeling uncertain motion and observation noise.Traditional tracking algorithms are limited by specific models and priors that may mismatch a real-world scenario.In ...Multi-target tracking is facing the difficulties of modeling uncertain motion and observation noise.Traditional tracking algorithms are limited by specific models and priors that may mismatch a real-world scenario.In this paper,considering the model-free purpose,we present an online Multi-Target Intelligent Tracking(MTIT)algorithm based on a Deep Long-Short Term Memory(DLSTM)network for complex tracking requirements,named the MTIT-DLSTM algorithm.Firstly,to distinguish trajectories and concatenate the tracking task in a time sequence,we define a target tuple set that is the labeled Random Finite Set(RFS).Then,prediction and update blocks based on the DLSTM network are constructed to predict and estimate the state of targets,respectively.Further,the prediction block can learn the movement trend from the historical state sequence,while the update block can capture the noise characteristic from the historical measurement sequence.Finally,a data association scheme based on Hungarian algorithm and the heuristic track management strategy are employed to assign measurements to targets and adapt births and deaths.Experimental results manifest that,compared with the existing tracking algorithms,our proposed MTIT-DLSTM algorithm can improve effectively the accuracy and robustness in estimating the state of targets appearing at random positions,and be applied to linear and nonlinear multi-target tracking scenarios.展开更多
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 t...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.展开更多
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 ...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.展开更多
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 ...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.展开更多
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. B...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.展开更多
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 deg...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.展开更多
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 fi...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.展开更多
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 pers...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.展开更多
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 p...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.展开更多
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 ...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.展开更多
<div style="text-align:justify;"> In recent years, multi-target tracking technology based on Gaussian Mixture- Probability Hypothesis Density (GM-PHD) filtering has become a hot field of information fu...<div style="text-align:justify;"> 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. </div>展开更多
In the heavy clutter environment, the information capacity is large,the relationships among information are complicated, and track initiationoften has a high false alarm rate or missing alarm rate. Obviously, it is ad...In the heavy clutter environment, the information capacity is large,the relationships among information are complicated, and track initiationoften has a high false alarm rate or missing alarm rate. Obviously, it is adifficult task to get a high-quality track initiation in the limited measurementcycles. This paper studies the multi-target track initiation in heavy clutter.At first, a relaxed logic-based clutter filter algorithm is presented. In thealgorithm, the raw measurement is filtered by using the relaxed logic method.We not only design a kind of incremental and adaptive filtering gate, but alsoadd the angle extrapolation based on polynomial extrapolation. The algorithm eliminates most of the clutter and obtains the environment with highdetection rate and less clutter. Then, we propose a fuzzy sequential Houghtransform-based track initiation algorithm. The algorithm establishes a newmeshing rule according to system noise to balance the relationship between thegrid granularity and the track initiation quality. And a flexible superpositionmatrix based on fuzzy clustering is constructed, which avoids the transformation error caused by 0–1 voting method in traditional Hough transform.In addition, the algorithm allows the superposition matrixes of nonadjacentcycles to be associated to overcome the shortcoming that the track can’t beinitiated in time when the measurements appear in an intermittent way. Anda slope verification method is introduced to detect formation-intensive serialtracks. Last, the sliding window method is employed to feedback the trackinitiation results timely and confirm the track. Simulation results verify thatthe proposed algorithms can initiate the tracks accurately in heavy clutter.展开更多
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...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.展开更多
基金supported by the Science and Technology Development Fund,Macao SAR(File no.0062/2021/A)the University of Macao(MYRG2022-00171-FHS).
文摘Alzheimer’s disease(AD)poses one of the most urgent medical challenges in the 21st century as it affects millions of people.Unfortunately,the etiopathogenesis of AD is not yet fully understood and the current pharmacotherapy options are somewhat limited.Here,we report a novel inhibitor,Compound 44,for targeting cholinesterases,amyloid-β(Aβ)aggregation,and glycogen synthase kinase 3β(GSK-3β)simultaneously with the aim of achieving symptomatic relief and disease modification in AD therapy.We found that Compound 44 had good inhibitory effects on all intended targets with IC_(50)s of submicromolar or better,significant neuroprotective effects in cell models,and beneficial improvement of cognitive deficits in the triple transgenic AD(3×Tg AD)mouse model.Moreover,we showed that Compound 44 acts as an autophagy regulator by inducing nuclear translocation of transcription factor EB through GSK-3βinhibition,enhancing the biogenesis of lysosomes and elevating autophagic flux,thus ameliorating the amyloid burden and tauopathy,as well as mitigating the disease phenotype.Our results suggest that triple-target inhibition via Compound 44 could be a promising strategy that may lead to the development of effective therapeutic approaches for AD.
基金supported By Guangdong Major Project of Basic and Applied Basic Research(2023B0303000009)Guangdong Basic and Applied Basic Research Foundation(2024A1515030153,2025A1515011587)+1 种基金Project of Department of Education of Guangdong Province(2023ZDZX4046)Shen-zhen Natural Science Fund(Stable Support Plan Program 20231122121608001),Ningbo Municipal Science and Technology Bureau(ZX2024000604).
文摘Dear Editor,Through distributed machine learning,multi-UAV systems can achieve global optimization goals without a centralized server,such as optimal target tracking,by leveraging local calculation and communication with neighbors.In this work,we implement the stochastic gradient descent algorithm(SGD)distributedly to optimize tracking errors based on local state and aggregation of the neighbors'estimation.However,Byzantine agents can mislead neighbors,causing deviations from optimal tracking.We prove that the swarm achieves resilient convergence if aggregated results lie within the normal neighbors'convex hull,which can be guaranteed by the introduced centerpoint-based aggregation rule.In the given simulated scenarios,distributed learning using average,geometric median(GM),and coordinate-wise median(CM)based aggregation rules fail to track the target.Compared to solely using the centerpoint aggregation method,our approach,which combines a pre-filter with the centroid aggregation rule,significantly enhances resilience against Byzantine attacks,achieving faster convergence and smaller tracking errors.
基金supported by the National Key Research and Development Program of China(2025YFE0213100)the National Natural Science Foundation of China(62422315,62573348)+1 种基金the Natural Science Basic Research Program of Shaanxi(2025JC-YBMS-667)the“Shuang Yi Liu”Construction Foundation(25GH02010366)。
文摘This paper investigates the distributed continuoustime aggregative optimization problem for second-order multiagent systems,where the local cost function is not only related to its own decision variables,but also to the aggregation of the decision variables of all the agents.By using the gradient descent method,the distributed average tracking(DAT)technique and the time-base generator(TBG)technique,a distributed continuous-time aggregative optimization algorithm is proposed.Subsequently,the optimality of the system's equilibrium point is analyzed,and the convergence of the closed-loop system is proved using the Lyapunov stability theory.Finally,the effectiveness of the proposed algorithm is validated through case studies on multirobot systems and power generation systems.
文摘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.
基金Projects(90820302,60805027)supported by the National Natural Science Foundation of ChinaProject(200805330005)supported by the Research Fund for the Doctoral Program of Higher Education,ChinaProject(2009FJ4030)supported by Academician Foundation of Hunan Province,China
文摘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.
基金supported by the National GNSS Research Center Program of the Defense Acquisition Program Administration and Agency for Defense Developmentthe Ministry of Science and ICT of the Republic of Korea through the Space Core Technology Development Program (No. NRF2018M1A3A3A02065722)
文摘In this paper, a cardinality compensation method based on Information-weighted Consensus Filter(ICF) using data clustering is proposed in order to accurately estimate the cardinality of the Cardinalized Probability Hypothesis Density(CPHD) filter. Although the joint propagation of the intensity and the cardinality distribution in the CPHD filter process allows for more reliable estimation of the cardinality(target number) than the PHD filter, tracking loss may occur when noise and clutter are high in the measurements in a practical situation. For that reason, the cardinality compensation process is included in the CPHD filter, which is based on information fusion step using estimated cardinality obtained from the CPHD filter and measured cardinality obtained through data clustering. Here, the ICF is used for information fusion. To verify the performance of the proposed method, simulations were carried out and it was confirmed that the tracking performance of the multi-target was improved because the cardinality was estimated more accurately as compared to the existing techniques.
基金supported by the National Natural Science Foundation of China (11472214)。
文摘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.
基金supported by the National Natural Science Foundation of China(No.62276204)Open Foundation of Science and Technology on Electronic Information Control Laboratory,Natural Science Basic Research Program of Shanxi,China(Nos.2022JM-340 and 2023-JC-QN-0710)China Postdoctoral Science Foundation(Nos.2020T130494 and 2018M633470).
文摘Multi-target tracking is facing the difficulties of modeling uncertain motion and observation noise.Traditional tracking algorithms are limited by specific models and priors that may mismatch a real-world scenario.In this paper,considering the model-free purpose,we present an online Multi-Target Intelligent Tracking(MTIT)algorithm based on a Deep Long-Short Term Memory(DLSTM)network for complex tracking requirements,named the MTIT-DLSTM algorithm.Firstly,to distinguish trajectories and concatenate the tracking task in a time sequence,we define a target tuple set that is the labeled Random Finite Set(RFS).Then,prediction and update blocks based on the DLSTM network are constructed to predict and estimate the state of targets,respectively.Further,the prediction block can learn the movement trend from the historical state sequence,while the update block can capture the noise characteristic from the historical measurement sequence.Finally,a data association scheme based on Hungarian algorithm and the heuristic track management strategy are employed to assign measurements to targets and adapt births and deaths.Experimental results manifest that,compared with the existing tracking algorithms,our proposed MTIT-DLSTM algorithm can improve effectively the accuracy and robustness in estimating the state of targets appearing at random positions,and be applied to linear and nonlinear multi-target tracking scenarios.
基金National Natural Science Foundation of China(Grant No.62001506)to provide fund for conducting experiments。
文摘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.
基金funded by the Center for Unmanned Aircraft Systems(C-UAS)a National Science Foundation Industry/University Cooperative Research Center(I/UCRC)under NSF award Numbers IIP-1161036 and CNS-1650547along with significant contributions from C-UAS industry members。
文摘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.
基金This paper was supported by the Natural Science Foundation of Jiangsu Province, China (No. BK2004132).
文摘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.
基金Supported by the National Natural Science Foundation of China Youth Science Fund Project(Nos.62101405,61372185)
文摘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.
基金supported by the National Natural Science Fundation of China (61671137)。
文摘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.
基金Supported by the National Natural Science Foundation of China （60634030）, the National Natural Science Foundation of China （60702066, 6097219） and the Natural Science Foundation of Henan Province （092300410158）.
文摘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.
文摘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.
基金Supported by the Program for Technology Innovation Team of Ningbo Government (No. 2011B81002)the Ningbo University Science Research Foundation (No.xkl11075)
文摘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.
基金Project(61101185) supported by the National Natural Science Foundation of ChinaProject(2011AA1221) supported by the National High Technology Research and Development Program of China
文摘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.
文摘<div style="text-align:justify;"> 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. </div>
基金This work is supported in part by the Fundamental Research Funds for the Central Universities,Jilin University under Grant No.93K172021K04.
文摘In the heavy clutter environment, the information capacity is large,the relationships among information are complicated, and track initiationoften has a high false alarm rate or missing alarm rate. Obviously, it is adifficult task to get a high-quality track initiation in the limited measurementcycles. This paper studies the multi-target track initiation in heavy clutter.At first, a relaxed logic-based clutter filter algorithm is presented. In thealgorithm, the raw measurement is filtered by using the relaxed logic method.We not only design a kind of incremental and adaptive filtering gate, but alsoadd the angle extrapolation based on polynomial extrapolation. The algorithm eliminates most of the clutter and obtains the environment with highdetection rate and less clutter. Then, we propose a fuzzy sequential Houghtransform-based track initiation algorithm. The algorithm establishes a newmeshing rule according to system noise to balance the relationship between thegrid granularity and the track initiation quality. And a flexible superpositionmatrix based on fuzzy clustering is constructed, which avoids the transformation error caused by 0–1 voting method in traditional Hough transform.In addition, the algorithm allows the superposition matrixes of nonadjacentcycles to be associated to overcome the shortcoming that the track can’t beinitiated in time when the measurements appear in an intermittent way. Anda slope verification method is introduced to detect formation-intensive serialtracks. Last, the sliding window method is employed to feedback the trackinitiation results timely and confirm the track. Simulation results verify thatthe proposed algorithms can initiate the tracks accurately in heavy clutter.
基金supported by the National Natural Science Foundation of China(No.62276204,No.62306222)the Natural Science Basic Research Program of Shaanxi,China(No.2023-JC-QN-0710)。
文摘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.
