scholarly journals Unscented Particle Filter Algorithm Based on Divide-and-Conquer Sampling for Target Tracking

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2236
Author(s):  
Sichun Du ◽  
Qing Deng
Keyword(s):  
Particle Filter ◽  
State Space ◽  
Adaptive Filtering ◽  
Divide And Conquer ◽  
Particle Swarm Algorithm ◽  
Tracking Accuracy ◽  
Filtering Algorithm ◽  
Maneuvering Target ◽  
Unscented Particle Filter ◽  
Particle Filter Algorithm

Unscented particle filter (UPF) struggles to completely cover the target state space when handling the maneuvering target tracing problem, and the tracking performance can be affected by the low sample diversity and algorithm redundancy. In order to solve this problem, the method of divide-and-conquer sampling is applied to the UPF tracking algorithm. By decomposing the state space, the descending dimension processing of the target maneuver is realized. When dealing with the maneuvering target, particles are sampled separately in each subspace, which directly prevents particles from degeneracy. Experiments and a comparative analysis were carried out to comprehensively analyze the performance of the divide-and-conquer sampling unscented particle filter (DCS-UPF). The simulation result demonstrates that the proposed algorithm can improve the diversity of particles and obtain higher tracking accuracy in less time than the particle swarm algorithm and intelligent adaptive filtering algorithm. This algorithm can be used in complex maneuvering conditions.

Robust Adaptive Unscented Particle Filter

2013 ◽  
Vol 3 (2) ◽  
pp. 55-66 ◽  
Author(s):  
Li Xue ◽  
Shesheng Gao ◽  
Yongmin Zhong
Keyword(s):  
Particle Filter ◽  
Adaptive Filtering ◽  
Particle Filtering ◽  
Kinematic Model ◽  
Comparison Analysis ◽  
Unscented Transformation ◽  
Filtering Algorithm ◽  
Unscented Particle Filter ◽  
Observation Noise ◽  
Robust Adaptive

This paper presents a new robust adaptive unscented particle filtering algorithm by adopting the concept of robust adaptive filtering to the unscented particle filter. In order to prevent particles from degeneracy, this algorithm adaptively determines the equivalent weight function according to robust estimation and adaptively adjusts the adaptive factor constructed from predicted residuals to resist the disturbances of singular observations and the kinematic model noise. It also uses the unscented transformation to improve the accuracy of particle filtering, thus providing the reliable state estimation for improving the performance of robust adaptive filtering. Experiments and comparison analysis demonstrate that the proposed filtering algorithm can effectively resist disturbances due to system state noise and observation noise, leading to the improved filtering accuracy.

Maneuvering Target Tracking Algorithm Based on Particle PHD Filtering

2014 ◽  
Vol 989-994 ◽  
pp. 2212-2215
Author(s):  
Song Gao ◽  
Chao Bo Chen ◽  
Qian Gong
Keyword(s):  
Particle Filter ◽  
Target Tracking ◽  
Tracking Accuracy ◽  
Maneuvering Target Tracking ◽  
Probability Hypothesis Density ◽  
Filtering Algorithm ◽  
Maneuvering Target ◽  
Maneuvering Targets ◽  
The Status ◽  
Simulation Results

As for the problem of maneuvering target tracking in the clutter environment, this paper combines IMM with PHD and realizes it through approach of particle filter. This algorithm avoids the troublesome problem of data association, and takes advantage of probability hypothesis density (PHD) filter in tracking maneuvering targets and interacting multi-model (IMM) algorithm in the field of model switching effectively, in the clutter environment, the status of the targets can be estimated precisely and steadily. This paper compares the proposed filtering algorithm with the classical IMM algorithm in performance, and the simulation results show that, the improved filtering algorithm has good tracking performance and tracking accuracy.

scholarly journals IMM Iterated Extended Particle Filter Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Yang Wan ◽  
Shouyong Wang ◽  
Xing Qin
Keyword(s):  
Particle Filter ◽  
Density Function ◽  
The State ◽  
Arbitrary Distribution ◽  
Interacting Multiple Model ◽  
Multiple Model ◽  
Maneuvering Target ◽  
Particle Filter Algorithm ◽  
Non Gaussian ◽  
Importance Density Function

In order to solve the tracking problem of radar maneuvering target in nonlinear system model and non-Gaussian noise background, this paper puts forward one interacting multiple model (IMM) iterated extended particle filter algorithm (IMM-IEHPF). The algorithm makes use of multiple modes to model the target motion form to track any maneuvering target and each mode uses iterated extended particle filter (IEHPF) to deal with the state estimation problem of nonlinear non-Gaussian system. IEHPF is an improved particle filter algorithm, which utilizes iterated extended filter (IEHF) to obtain the mean value and covariance of each particle and describes importance density function as a combination of Gaussian distribution. Then according to the function, draw particles to approximate the state posteriori density of each mode. Due to the high filter accuracy of IEHF and the adaptation of system noise with arbitrary distribution as well as strong robustness, the importance density function generated by this method is more approximate to the true sate posteriori density. Finally, a numerical example is included to illustrate the effectiveness of the proposed methods.

scholarly journals Modeling and Simulation of English Speech Rationality Optimization Recognition Based on Improved Particle Filter Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Hui Dong
Keyword(s):  
Parameter Identification ◽  
Particle Filter ◽  
Particle Filtering ◽  
Topic Model ◽  
Unscented Kalman Filter ◽  
Identification Accuracy ◽  
Filter Method ◽  
Human Beings ◽  
Filtering Algorithm ◽  
Particle Filter Algorithm

As one of the most important communication tools for human beings, English pronunciation not only conveys literal information but also conveys emotion through the change of tone. Based on the standard particle filtering algorithm, an improved auxiliary traceless particle filtering algorithm is proposed. In importance sampling, based on the latest observation information, the unscented Kalman filter method is used to calculate each particle estimate to improve the accuracy of particle nonlinear transformation estimation; during the resampling process, auxiliary factors are introduced to modify the particle weights to enrich the diversity of particles and weaken particle degradation. The improved particle filter algorithm was used for online parameter identification and compared with the standard particle filter algorithm, extended Kalman particle filter algorithm, and traceless particle filter algorithm for parameter identification accuracy and calculation efficiency. The topic model is used to extract the semantic space vector representation of English phonetic text and to sequentially predict the emotional information of different scales at the chapter level, paragraph level, and sentence level. The system has reasonable recognition ability for general speech, and the improved particle filter algorithm evaluation method is further used to optimize the defect of the English speech rationality and high recognition error rate Related experiments have verified the effectiveness of the method.

scholarly journals Improved Interacting Multiple Model Particle Filter Algorithm

2018 ◽  
Vol 36 (1) ◽  
pp. 169-175 ◽  
Author(s):  
Qiaoran Liu ◽  
Xun Yang
Keyword(s):  
Kalman Filter ◽  
Particle Filter ◽  
Target Tracking ◽  
Unscented Kalman Filter ◽  
Multiple Model ◽  
Tracking Accuracy ◽  
Proposal Distribution ◽  
Model Particle ◽  
Interactive Multiple Model ◽  
Particle Filter Algorithm

For the issue of limited filtering accuracy of interactive multiple model particle filter algorithm caused by the resampling particles don't contain the latest observation information, we made improvements on interactive multiple model particle filter algorithm in this paper based on mixed kalman particle filter algorithm. Interactive multiple model particle filter algorithm is proposed. In addition, the composed methods influence to tracking accuracy are discussed. In the new algorithm the system state estimation is generated with unscented kalman filter (UKF) first and then use the extended kalman filter (EKF) to get the proposal distribution of the particles, taking advantage of the measure information to update the particles' state. We compare and analyze the target tracking performance of the proposed algorithm of IMM-MKPF in this paper, IMM-UPF and IMM-EPF through the simulation experiment. The results show that the tracking accuracy of the proposed algorithm is superior to other two algorithms. Thus, the new method in this paper is effective. The method is of important to improve tracking accuracy further for maneuvering target tracking under the non-linear and non-Gaussian circumstances.

A New Adaptive UPF Algorithm through Improved Relative Entropy

2013 ◽  
Vol 658 ◽  
pp. 569-573
Author(s):  
Wen Tao Yu ◽  
Jun Peng ◽  
Xiao Yong Zhang
Keyword(s):  
Particle Filter ◽  
Relative Entropy ◽  
Particle Number ◽  
Time Step ◽  
Unscented Particle Filter ◽  
Posterior Probability Density ◽  
The Difference ◽  
Particle Filter Algorithm ◽  
Non Gaussian ◽  
Number Of Particles

Unscented particle filter (UPF) has high accuracy of state estimation for nonlinear system with non-Gaussian noise. While the computation of traditional unscented particle filter is huge and this depends on the particle number. In this paper we propose a new adaptive unscented particle filter algorithm AUPF through improved relative entropy which can adaptively adjust the particle number during filtering. Firstly the relative entropy is used to measure the distance between the posterior probability density and the importance proposal and the least number of particles for the next time step is decided according to the relative entropy. Then the least number is adjusted to offset the difference between the importance proposal and the true distribution. This algorithm can effectively reduce unnecessary particles meanwhile reduce the computation. The simulation results show the effectiveness of AUPF.

Sign in / Sign up

Export Citation Format

Share Document