An Improved Particle Filtering Algorithm Based on Mean Shift Algorithm for Infrared Target Tracking

2014 ◽  
Vol 1079-1080 ◽  
pp. 650-653
Author(s):  
Xi Peng Yin ◽  
Lin Lin Xia ◽  
Min Can He ◽  
Wei Cheng
Keyword(s):  
Particle Filter ◽  
Target Tracking ◽  
Posterior Distribution ◽  
Particle Filtering ◽  
Mean Shift ◽  
Mean Shift Algorithm ◽  
Filtering Algorithm ◽  
Particle Filter Algorithm

Animproved particle filter algorithm which based on mean shift algorithm isintroduced. The algorithm makes the particles move towards the high likelihoodregion in posterior distribution with the effect of mean shift algorithm,increases the efficiency of the particles moving, and reduces the phenomenon ofdegradation and dilution of particles

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.

Research on Target Tracking Algorithm Based on Particle Filter and Mean-Shift

2013 ◽  
Vol 457-458 ◽  
pp. 1050-1053
Author(s):  
Yan Hai Wu ◽  
Xia Min Xie ◽  
Zi Shuo Han
Keyword(s):  
Particle Filter ◽  
Target Tracking ◽  
Real Time ◽  
Mean Shift ◽  
Extreme Value ◽  
Tracking Algorithm ◽  
Real Time Tracking ◽  
The Mean ◽  
Particle Filter Algorithm ◽  
Local Extreme

Since Mean-Shift tracking algorithm always falls into local extreme value when the target was sheltered and the particle filter tracking algorithm has huge calculation and degeneracy phenomenon, a new target tracking algorithm based on Mean-Shift and Particle Filter combination is proposed in this paper. First, this paper introduces the basic theory of Mean-Shift and Particle Filter tracking algorithm, and then presents the new target tracking which the Mean-Shift iteration embeds Particle Filter algorithm. Experiment results show that the algorithm needs less computation, while the real-time tracking has been guaranteed, robustness has been improved and the tracking results has been greatly increased.

scholarly journals A Robot Dynamic Target Grasping Method Based on Affine Group Improved Gaussian Resampling Particle Filter

2021 ◽  
Vol 11 (21) ◽  
pp. 10270
Author(s):  
Yong Tao ◽  
Fan Ren ◽  
He Gao ◽  
Tianmiao Wang ◽  
Shan Jiang ◽  
...  
Keyword(s):  
Particle Filter ◽  
Target Tracking ◽  
Particle Filtering ◽  
Servo Control ◽  
Simulation Environment ◽  
Visual Servo ◽  
Affine Groups ◽  
Actual Environment ◽  
Dynamic Target ◽  
Particle Filter Algorithm

Tracking and grasping a moving target is currently a challenging topic in the field of robotics. The current visual servo grasping method is still inadequate, as the real-time performance and robustness of target tracking both need to be improved. A target tracking method is proposed based on improved geometric particle filtering (IGPF). Following the geometric particle filtering (GPF) tracking framework, affine groups are proposed as state particles. Resampling is improved by incorporating an improved conventional Gaussian resampling algorithm. It addresses the problem of particle diversity loss and improves tracking performance. Additionally, the OTB2015 dataset and typical evaluation indicators in target tracking are adopted. Comparative experiments are performed using PF, GPF and the proposed IGPF algorithm. A dynamic target tracking and grasping method for the robot is proposed. It combines an improved Gaussian resampling particle filter algorithm based on affine groups and the positional visual servo control of the robot. Finally, the robot conducts simulation and experiments on capturing dynamic targets in the simulation environment and actual environment. It verifies the effectiveness of the method proposed in this paper.

The Particle Filter Algorithm Research for Target Tracking Based on Information Fusion

2012 ◽  
Vol 628 ◽  
pp. 440-444 ◽  
Author(s):  
Juan Li ◽  
Hui Juan Hao ◽  
Mao Li Wang
Keyword(s):  
Particle Filter ◽  
Target Tracking ◽  
Information Fusion ◽  
Particle Filtering ◽  
Tracking System ◽  
Distributed Sensor ◽  
Multi Target Tracking ◽  
Particle Filter Algorithm ◽  
Gaussian System ◽  
Non Gaussian

This paper researches the particle filters Algorithms for target tracking based on Information Fusion, it combines the traditional Kalman filter with the particle filter. For multi-sensor and multi-target tracking system with complex application background, which is nonlinear and non-gaussian system, the paper proposes an effective particle filtering algorithm based on information fusion for distributed sensor, this algorithm contributes to the solution of particle degradation problems and the phenomenon of particle lack, and achieve high precision for target tracking.

Compressed Iterative Particle Filter for Target Tracking

2011 ◽  
Vol 55-57 ◽  
pp. 91-94
Author(s):  
Hong Bo Zhu ◽  
Hai Zhao ◽  
Dan Liu ◽  
Chun He Song
Keyword(s):  
Particle Filter ◽  
Target Tracking ◽  
Kalman Filtering ◽  
Particle Filtering ◽  
Filtering Algorithms ◽  
Filtering Algorithm ◽  
Ga Algorithm ◽  
Non Linear

Particle filtering has been widely used in the non-linear n-Gaussian target tracking problems. The main problem of particle filtering is the lacking and exhausting of particles, and choosing effective proposed distribution is the key point to overcome it. In this paper, a new mixed particle filtering algorithm was proposed. Firstly, the unscented kalman filtering is used to generate the proposed distribution, and in the resample step, a new certain resample method is used to choose the particles with ordered larger weights. GA algorithm is introduced into the certain resample method to keep the variety of the particles. Simuational results have shown that the proposed algorithm has better performances than other three typical filtering algorithms.

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.

Sign in / Sign up

Export Citation Format

Share Document