Firefly algorithm (FA) based particle filter method for visual tracking

Particle filters perform the nonlinear estimation and have been proven to be a powerful tool in solving visual tracking problems. However, the problem of sample impoverishment is still a drawback of particle filter. To solve this problem, a bat-inspired particle filter is proposed in this work. The particles in the particle filter are optimized using a new biologically inspired optimization algorithm, namely bat algorithm before re-sampling. The meaningful particles are increased and they can approximate the true state of the target more accurately. Experiments on visual tracking show that the proposed algorithm outperforms the standard particle filter and it can track targets accurately and robustly in various challenging conditions.

Intelligent Trigonometric Particle Filter for visual tracking

Visual tracking is one of the key tasks in computer vision. The particle filter algorithm has been extensively used to tackle this problem due to its flexibility. However the conventional particle filter uses system transition as the proposal distribution, frequently resulting in poor priors for the filtering step. The main reason is that it is difficult, if not impossible, to accurately model the target's motion. Such a proposal distribution does not take into account the current observations. It is not a trivial task to devise a satisfactory proposal distribution for the particle filter. In this paper we advance a general augmented particle filtering framework for designing the optimal proposal distribution. The essential idea is to augment a second filter's estimate into the proposal distribution design. We then show that several existing improved particle filters can be rationalised within this general framework. Based on this framework we further propose variant algorithms for robust and efficient visual tracking. Experiments indicate that the augmented particle filters are more efficient and robust than the conventional particle filter.

We present the parallel particle filtering (PPF) software library, which enables hybrid shared-memory/distributedmemory parallelization of particle filtering (PF) algorithms combining the Message Passing Interface (MPI) with multithreading for multi-level parallelism. The library is implemented in Java and relies on OpenMPI's Java bindings for inter-process communication. It includes dynamic load balancing, multi-thread balancing, and several algorithmic improvements for PF, such as input-space domain decomposition. The PPF library hides the difficulties of efficient parallel programming of PF algorithms and provides application developers with a tool for parallel implementation of PF methods. We demonstrate the capabilities of the PPF library using two distributed PF algorithms in two scenarios with different numbers of particles. The PPF library runs a 38 million particle problem, corresponding to more than 1.86 TB of particle data, on 192 cores with 67% parallel efficiency.

Most of the countries have paid great attention to flood water level monitoring and tracking because flood may damages people's life and property. Since flood water level fluctuate highly nonlinear, it is very difficult to predict the flood water level. The particle filter algorithm is well known as a very effective solution for handling nonlinear problems. Thus, in this paper, this algorithm is applied to predict the flood water level. There are many variations of particle filter. This paper proposes Sequential Importance Sampling (SIS) particle filter to solve the above mentioned problem. SIS is the basic particle filter. However, the problems with SIS particle filter are the particle degeneration phenomenon, when after a few iterations only a few particles have nonzero weight. So, Sampling Importance Resampling (SIR) particle filter is also introduced as the improved particle filter. From the simulation results using Matlab, SIR particle filter outperforms SIS particle filter by comparing the Root Mean Square Error (RMSE) value.

In this paper, an error-ellipse-resampling-based particle filter (EER-PF) algorithm is proposed for target tracking in wireless sensor networks. In order to improve the effectiveness of the particles, in the process of resampling, the error ellipse of different confidence levels is established according to the error covariance matrix of particles. The particles are divided into different levels based on the geometrical position, and then the particles are screened and optimized. The effectiveness of the proposed method in a cumulative error optimization was verified by comparing with the performance of posterior Cramér-Rao lower bound (PCRLB). Experimental results show that the proposed algorithm can effectively solve the problem of sample degeneracy and impoverishment, and has higher positioning accuracy.

Particle degeneracy and its poor ability to track saltatory states are two main problems when a particle filter is applied to fault prediction.The sequential importance re-sampling particle filter can abate the influence of particle degeneracy but will easily lead to another problem-sample impoverishment.The extended particle filter can resolve the problem of particle degeneracy to a certain extent but can not track the saltatory state.A strong tracking particle filter is put forward by introducing a strong tracking filter into a particle filter to resolve the above problems,in which the strong tracking filter is used to update particles and produce importance densities.As a result, the problems of particle degeneracy and sample impoverishment are ameliorated,and the tracking ability is improved. Simulation results demonstrate that the strong tracking particle filter is feasible and system fault can be predicted in time and correctly.

Particle filtering is an indispensable method for non-Gaussian state estimation, but it has some problems, such as particle degradation and requiring a large number of particles to ensure accuracy. Biota intelligence algorithms led by Cuckoo (CS) and Firefly (FA) have achieved certain results after introducing particle filtering, respectively. This paper respectively in the two kinds of bionic algorithm convergence factor and adaptive step length and random mobile innovation, seized the cuckoo algorithm (CS) in the construction of the initial value and the firefly algorithm (FA) in the iteration convergence advantages, using the improved after the update mechanism of cuckoo algorithm optimizing the initial population, and will be updated after optimization way of firefly algorithm combined with particle filter. Experimental results show that this method can ensure the diversity of particles and greatly reduce the number of particles needed for prediction while improving the filtering accuracy.

To deal with the problem of ballistic reentry target trajectory tracking, a novel particle filter algorithm is proposed to mitigate the particle degeneracy. It can eliminate the inefficient particles by judging the degree of particle degradation at each time and generates new particles based on the estimation state values and their covariance according to the degeneracy ratio of particles. Compared with Standard Particle Filter (SPF) algorithm and Unscented Particle Filter (UPF) algorithm, simulation results show that the proposed algorithm can achieve better tracking performance with lower computational burden for the trajectory reentry target tracking model. Especially in the case of ballistic target maneuver, the performance stability of the proposed algorithm is even more significant.

Particle filter is commonly used in various indoor positioning schemes, but sample impoverishment and weight degradation generally exist in particle filter. To solve this problem, this article uses the firefly algorithm to optimize particle filter. Using the global optimal value in the particle swarm to guide the remaining particles to update their positions, the particles tend to move to the high likelihood area, which can more accurately describe the true state of the target observation. At the same time, to avoid particles falling into local optimum and oscillating repeatedly at the extreme point, the mathematical model of the firefly algorithm is reconstructed in this article, which is named as adaptive optimization firefly algorithm (AOFA). The experimental results show that the positioning scheme can provide the positioning accuracy with an average error of less than 0.5 m. Compared with the traditional particle filter, the positioning accuracy is improved by 120%.

This study addresses the challenges of selecting a suitable visual tracking method for real-time mobile robot applications, particularly in scenarios where the target is moving on the ground. The primary research problem addressed is the need for a flexible, computationally efficient tracking method that does not rely on pre-existing labelled datasets, as is often required by deep learning approaches. Unsupervised methods can overcome this problem by utilizing object motion information in each image frame without prior training. With many unsupervised tracking methods available, choosing an appropriate algorithm that can perform efficiently under dynamic conditions becomes a critical problem. The study compares the performance of three unsupervised visual tracking methods: particle filter, optical flow, and channel and spatial reliability tracker (CSRT) under various tracking conditions. The dataset used includes challenges such as moving target variations, changes in object scale, viewpoint changes, suboptimal lighting, image blurring, partial occlusions, and abrupt movements. Evaluation criteria include tracking accuracy, resistance to occlusion, and computational efficiency. The particle filter with ORB and a constant velocity model achieves a root mean square error (RMSE) of 36.47 pixels at 13 frames per second (fps). Optical flow performs best with an RMSE of 10.79 pixels at 30 fps, while CSRT shows an RMSE of 252.35 pixels at 4 fps. These findings highlight the effectiveness of optical flow for real-time applications, making it a promising solution for mobile robot visual tracking in challenging situations.

The underwater target tracking environment usually has the characteristics of strong nonlinearity and non-Gaussian. The target tracking problem usually uses the nonlinear filtering algorithm, which combines the nonlinear measurement model with the linear system dynamics. The primary goal of target tracking is to extract accurate information about the real-time state of the target from the noise nonlinear observation obtained by the sensor. A new Gaussian Hermitt Kalman particle filter algorithm (GHKF-PF) is used to improve the tracking accuracy of the particle filter algorithm (PF). GHKF-PF uses the GHKF sampling method to sample particles from the posterior distribution of the target, calculates the mean and covariance for each particle, and uses the mean and variance to guide sampling. In the simulation experiment, the uniform linear motion model of underwater 3D target in the environment of Gaussian mixture noise (GMN) is established, and the application of GHKF-PF algorithm in 3D space is realized, and the accuracy is higher than that of PF. In order to further verify the effectiveness of the algorithm, a six-dimensional uniform acceleration motion model is established and compared with the extended particle filter (EPF) algorithm and the unscented particle filter (UPF) algorithm. The simulation results show that the performance of the GHKF-PF algorithm is similar to that of the UPF algorithm and better than the EPF algorithm.

This article presents a new particle filter algorithm which uses random quasi-Monte-Carlo to propagate particles. The filter can be used generally, but here it is shown that for one-dimensional state-space models, if the number of particles is N, then the rate of convergence of this algorithm is N−1. This compares favorably with the N−1/2 convergence rate of standard particle filters. The computational complexity of the new filter is quadratic in the number of particles, as opposed to the linear computational complexity of standard methods. I demonstrate the new filter on two important financial time series models, an ARCH model and a stochastic volatility model. Simulation studies show that for fixed CPU time, the new filter can be orders of magnitude more accurate than existing particle filters. The new filter is particularly efficient at estimating smooth functions of the states, where empirical rates of convergence are N−3/2; and for performing smoothing, where both the new and existing filters have the same computational complexity.

Particle filter (PF) serves as an effective method applied to the fault diagnosis of nonlinear and non-Gaussian systems. However, the result of state estimation is influenced by the particle impoverishment problem which is common in the typical PF algorithm. Based on the analysis of the PF algorithm, the general particle impoverishment problem is attributed to the deficiency of particle diversity. In this paper a novel intelligent particle filter (NIPF) is designed to deal with the problem of particle impoverishment by means of the genetic and adaptive strategy. The general PF can be regarded as a particular instance of NIPF. The experiment on the vertically falling body model shows that the NIPF can increase the particles diversity and improve the results of state estimation.

liuyujiao2005@126.com Abstract Aiming at a nonlinear/non-Gaussian filter problem, the data processing of a single-yarn strength testing system, a filtering method based on the particle filter algorithm is put forward. This paper expounds the principle, and the working process and the procedures of particle filter. It discusses in detail the application of particle filter in the single-yarn strength testing, the modeling of testing system state equation, and the implementation of this algorithm in a project. It also indicates that particle filter algorithm used to process single-yarn strength test data achieves a good effect and satisfactory filtering precision by simulated tests. Finally, this paper predicts that particle filter will play an important role in general data processing and analyzing. The detection of the yarn quality is very important for cotton production. Yarn strength is the reflection of inner quality of yarn and is the necessary condition of yarn's processing performance and end-use. The unit of single-yarn strength is Newton (N) per centimeter (CN). By stretching testing with a single-yarn strength tester, the yarn's characteristic parameters will be obtained, and the physical index of breaking strength, breaking elongation, fracture strength, fracture time and strength tensile curves can be determined, so the quality of yarn will be ascertained (1) . This paper majors in the research of the parameter of the single-yarn strength of yarn. The strength of yarn will increase with increasing within a certain twist; however the strength of yarn will decrease when the twist exceeds the critical value. The relationship between yarn elongation and tension is often nonlinear. When the yarn quality is tested by single-yarn strength tester, the interference noise of test environment in the industrial field is non-Gaussian. So the processing of single-yarn strength testing data is a typical nonlinear and non-Gaussian filtering problem. The traditional digital filtering methods normally only filter out the caused by single reason and can't achieve satisfactory results for complex noise. In order to solve this problem, a large number of nonlinear recursive filtering algorithm such as extended Kalman filtering (EKF), the modified gain Kalman filter (MGEKF), U Kalman filter (UKF) algorithm come forth in recent years, and these filters are based on particular assumption to ensure the optimality. The actual data is usually very complex, and contains many factors such as non-Gaussian, nonlinear, high dimensional and noise; in this case, the Kalman filter generally can't get the analytical solution. This is a common problem and appears in many different kinds of fields (2-11) . Now, a new sequential Monte Carlo particle filter algorithm based on Bayesian principles has been paid more attention. The particle filter technology realize the recursive Bayesian filter with non- parametric Monte Carlo simulation method, which can fit to any state space model and the nonlinear systems which can't be expressed by traditional Kalman filter, and its accuracy approach the accuracy of optimal estimation (12) . This paper places emphasis on introducing the principle and method of the particle filter, and the application of the nonlinear data processing.