A Survey of Recent Advances in Particle Filters and Remaining Challenges for Multitarget Tracking

Improved Particle Filter Algorithm for Multi-Target Detection and Tracking

In modern radar detection systems, the particle filter technique has become one of the core algorithms for real-time target detection and tracking due to its good nonlinear and non-Gaussian system state estimation capability. However, when dealing with complex dynamic scenes, the traditional particle filter algorithm exposes obvious deficiencies. The main expression is that the sample degradation is serious, which leads to a decrease in estimation accuracy. In multi-target states, the algorithm is difficult to effectively distinguish and stably track each target, which increases the difficulty of state estimation. These problems limit the application potential of particle filter technology in multi-target complex environments, and there is an urgent need to develop a more advanced algorithmic framework to enhance its robustness and accuracy in complex scenes. Therefore, this paper proposes an improved particle filter algorithm for multi-target detection and tracking. Firstly, the particles are divided into tracking particles and searching particles. The tracking particles are used to maintain and update the trajectory information of the target, and the searching particles are used to identify and screen out multiple potential targets in the environment, to sufficiently improve the diversity of the particles. Secondly, the density-based spatial clustering of applications with noise is integrated into the resampling phase to improve the efficiency and accuracy of particle replication, so that the algorithm can effectively track multiple targets. Experimental result shows that the proposed algorithm can effectively improve the detection probability, and it has a lower root mean square error (RMSE) and a stronger adaptability to multi-target situation.

A Gated-Recurrent-Unit-Based Interacting Multiple Model Method for Small Bird Tracking on Lidar System

Lidar presents a promising solution for bird surveillance in airport environments. However, the low observation refresh rate of Lidar poses challenges for tracking bird targets. To address this problem, we propose a gated recurrent unit (GRU)-based interacting multiple model (IMM) approach for tracking bird targets at low sampling frequencies. The proposed method constructs various GRU-based motion models to extract different motion patterns and to give different predictions of target trajectory in place of traditional target moving models and uses an interacting multiple model mechanism to dynamically select the most suitable GRU-based motion model for trajectory prediction and tracking. In order to fuse the GRU-based motion model and IMM, the approximation state transfer matrix method is proposed to transform the prediction of GRU-based network into an explicit state transfer model, which enables the calculation of the models' probability. The simulation carried out on an open bird trajectory dataset proves that our method outperforms classical tracking methods at low refresh rates with at least 26% improvement in tracking error. The results show that the proposed method is effective for tracking small bird targets based on Lidar systems, as well as for other low-refresh-rate tracking systems.

Effectively computing transition patterns with privacy-preserved trajectory datasets

Recent advances in positioning techniques, along with the widespread use of mobile devices, make it easier to monitor and collect user trajectory information during their daily activities. An ever-growing abundance of data about trajectories of individual users paves the way for various applications that utilize user mobility information. One of the most common analysis tasks in these new applications is to extract the sequential transition patterns between two consecutive timestamps from a collection of trajectories. Such patterns have been widely exploited in diverse applications to predict and recommend next user locations based on the current position. Thus, in this paper, we explore the computation of the transition patterns, especially with a trajectory dataset collected using differential privacy, which is a de facto standard for privacy-preserving data collection and processing. Specifically, the proposed scheme relies on geo-indistinguishability, which is a variant of the well-known differential privacy, to collect trajectory data from users in a privacy-preserving manner, and exploits the functionality of the expectation-maximization algorithm to precisely estimate hidden transition patterns based on perturbed trajectory datasets collected under geo-indistinguishability. Experimental results using real trajectory datasets confirm that a good estimation of transition pattern can be achieved with the proposed method.

Bayesian Cramér-Rao Lower Bounds for Prediction and Smoothing of Nonlinear TASD Systems

The performance evaluation of state estimators for nonlinear regular systems, in which the current measurement only depends on the current state directly, has been widely studied using the Bayesian Cramér-Rao lower bound (BCRLB). However, in practice, the measurements of many nonlinear systems are two-adjacent-states dependent (TASD) directly, i.e., the current measurement depends on the current state as well as the most recent previous state directly. In this paper, we first develop the recursive BCRLBs for the prediction and smoothing of nonlinear systems with TASD measurements. A comparison between the recursive BCRLBs for TASD systems and nonlinear regular systems is provided. Then, the recursive BCRLBs for the prediction and smoothing of two special types of TASD systems, in which the original measurement noises are autocorrelated or cross-correlated with the process noises at one time step apart, are presented, respectively. Illustrative examples in radar target tracking show the effectiveness of the proposed recursive BCRLBs for the prediction and smoothing of TASD systems.

Real-Time Event-Based Unsupervised Feature Consolidation and Tracking for Space Situational Awareness

Earth orbit is a limited natural resource that hosts a vast range of vital space-based systems that support the international community's national, commercial and defence interests. This resource is rapidly becoming depleted with over-crowding in high demand orbital slots and a growing presence of space debris. We propose the Fast Iterative Extraction of Salient targets for Tracking Asynchronously (FIESTA) algorithm as a robust, real-time and reactive approach to optical Space Situational Awareness (SSA) using Event-Based Cameras (EBCs) to detect, localize, and track Resident Space Objects (RSOs) accurately and timely. We address the challenges of the asynchronous nature and high temporal resolution output of the EBC accurately, unsupervised and with few tune-able parameters using concepts established in the neuromorphic and conventional tracking literature. We show this algorithm is capable of highly accurate in-frame RSO velocity estimation and average sub-pixel localization in a simulated test environment to distinguish the capabilities of the EBC and optical setup from the proposed tracking system. This work is a fundamental step toward accurate end-to-end real-time optical event-based SSA, and developing the foundation for robust closed-form tracking evaluated using standardized tracking metrics.

Design of robust cubature fission particle filter algorithm in multi-source cooperative navigation

As a part of the multi-source cooperative navigation scheme, data fusion has a significant impact on the quality of state estimation. Particle filtering has gradually become the focus of many fusion methods due to its unique theoretical advantages in nonlinear non-Gaussian systems. However, the particle degradation and the resulting sample impoverishment restrict its application in complex engineering scenarios. In this paper, a robust cubature fission particle filter (RCFPF) is proposed to deal with these problems. First, in the framework of cubature rule, Huber function is used to combine the L2 norm and L1 norm to improve the importance density function(IDF), suppress the observation noise. Meanwhile, the proposed distribution(PD) is further optimized by combining the Gaussian distribution with Laplace distribution to alleviate particle degradation. Second, the particle swarm is fissioned before resampling, and the particle weight is reconstructed by fission of high weight particles and covering low weight particles to inhibit sample impoverishment. The vehicle experiments of multi-source cooperative navigation show that the proposed algorithm achieves better test results in accuracy and robustness than extended Kalman filter (EKF), strong tracking particle filter (STPF), and cubature particle filter (CPF).

Cooperative-PHD Tracking Based on Distributed Sensors for Naval Surveillance Area

Brazil has an extensive coastline and Exclusive Economic Zone (EEZ) area, which are of high economic and strategic importance. A Maritime Surveillance System becomes necessary to provide information and data to proper authorities, and target tracking is crucial. This paper focuses on a multitarget tracking application to a large-scale maritime surveillance system. The system is composed of a sensor network distributed over an area of interest. Due to the limited computational capabilities of nodes, the sensors send their tracking data to a central station, which is responsible for gathering and processing information obtained by the distributed components. The local Multitarget Tracking (MTT) algorithm employs a random finite set approach, which adopts a Gaussian mixture Probability Hypothesis Density (PHD) filter. The proposed data fusion scheme, utilized in the central station, consists of an additional step of prune & merge to the original GM PHD filter algorithm, which is the main contribution of this work. Through simulations, this study illustrates the performance of the proposed algorithm with a network composed of two stationary sensors providing the data. This solution yields a better tracking performance when compared to individual trackers, which is attested by the Optimal Subpattern Assignment (OSPA) metric and its location and cardinality components. The presented results illustrate the overall performance improvement attained by the proposed solution. Moreover, they also stress the need to resort to a distributed sensor network to tackle real problems related to extended targets.

Ground Moving Target Tracking Filter Considering Terrain and Kinematics

This paper addresses ground target tracking (GTT) for airborne radar. Digital terrain elevation data (DTED) are widely used for GTT as prior information under the premise that ground targets are constrained on terrain. Existing works fuse DTED to a tracking filter in a way that adopts only the assumption that the position of the target is constrained on the terrain. However, by kinematics, it is natural that the velocity of the moving ground target is constrained as well. Furthermore, DTED provides neither continuous nor accurate measurement of terrain elevation. To overcome such limitations, we propose a novel soft terrain constraint and a constraint-aided particle filter. To resolve the difficulties in applying the DTED to the GTT, first, we reconstruct the ground-truth terrain elevation using a Gaussian process and treat DTED as a noisy observation of it. Then, terrain constraint is formulated as joint soft constraints of position and velocity. Finally, we derive a Soft Terrain Constrained Particle Filter (STC-PF) that propagates particles while approximately satisfying the terrain constraint in the prediction step. In the numerical simulations, STC-PF outperforms the Smoothly Constrained Kalman Filter (SCKF) in terms of tracking performance because SCKF can only incorporate hard constraints.

Efficient Reject Options for Particle Filter Object Tracking in Medical Applications

Reliable object tracking that is based on video data constitutes an important challenge in diverse areas, including, among others, assisted surgery. Particle filtering offers a state-of-the-art technology for this challenge. Becaise a particle filter is based on a probabilistic model, it provides explicit likelihood values; in theory, the question of whether an object is reliably tracked can be addressed based on these values, provided that the estimates are correct. In this contribution, we investigate the question of whether these likelihood values are suitable for deciding whether the tracked object has been lost. An immediate strategy uses a simple threshold value to reject settings with a likelihood that is too small. We show in an application from the medical domain-object tracking in assisted surgery in the domain of Robotic Osteotomies-that this simple threshold strategy does not provide a reliable reject option for object tracking, in particular if different settings are considered. However, it is possible to develop reliable and flexible machine learning models that predict a reject based on diverse quantities that are computed by the particle filter. Modeling the task in the form of a regression enables a flexible handling of different demands on the tracking accuracy; modeling the challenge as an ensemble of classification tasks yet surpasses the results, while offering the same flexibility.

Particle Filters: A Hands-On Tutorial

The particle filter was popularized in the early 1990s and has been used for solving estimation problems ever since. The standard algorithm can be understood and implemented with limited effort due to the widespread availability of tutorial material and code examples. Extensive research has advanced the standard particle filter algorithm to improve its performance and applicability in various ways in the years after. As a result, selecting and implementing an advanced version of the particle filter that goes beyond the standard algorithm and fits a specific estimation problem requires either a thorough understanding or reviewing large amounts of the literature. The latter can be heavily time consuming especially for those with limited hands-on experience. Lack of implementation details in theory-oriented papers complicates this task even further. The goal of this tutorial is facilitating the reader to familiarize themselves with the key concepts of advanced particle filter algorithms and to select and implement the right particle filter for the estimation problem at hand. It acts as a single entry point that provides a theoretical overview of the filter, its assumptions and solutions for various challenges encountered when applying particle filters. Besides that, it includes a running example that demonstrates and implements many of the challenges and solutions.

A generative spiking neural-network model of goal-directed behaviour and one-step planning

In mammals, goal-directed and planning processes support flexible behaviour used to face new situations that cannot be tackled through more efficient but rigid habitual behaviours. Within the Bayesian modelling approach of brain and behaviour, models have been proposed to perform planning as probabilistic inference but this approach encounters a crucial problem: explaining how such inference might be implemented in brain spiking networks. Recently, the literature has proposed some models that face this problem through recurrent spiking neural networks able to internally simulate state trajectories, the core function at the basis of planning. However, the proposed models have relevant limitations that make them biologically implausible, namely their world model is trained ‘off-line’ before solving the target tasks, and they are trained with supervised learning procedures that are biologically and ecologically not plausible. Here we propose two novel hypotheses on how brain might overcome these problems, and operationalise them in a novel architecture pivoting on a spiking recurrent neural network. The first hypothesis allows the architecture to learn the world model in parallel with its use for planning: to this purpose, a new arbitration mechanism decides when to explore, for learning the world model, or when to exploit it, for planning, based on the entropy of the world model itself. The second hypothesis allows the architecture to use an unsupervised learning process to learn the world model by observing the effects of actions. The architecture is validated by reproducing and accounting for the learning profiles and reaction times of human participants learning to solve a visuomotor learning task that is new for them. Overall, the architecture represents the first instance of a model bridging probabilistic planning and spiking-processes that has a degree of autonomy analogous to the one of real organisms.

Goal-directed behaviour relies on brain processes supporting planning of actions based on their expected consequences before performing them in the environment. An important computational modelling approach proposes that the brain performs goal-directed processes on the basis of probability distributions and computations on them. A key challenge of this approach is to explain how these probabilistic processes can rely on the spiking processes of the brain. The literature has recently proposed some models that do so by ‘thinking ahead’ alternative possible action-outcomes based on low-level neuronal stochastic events. However, these models have a limited autonomy as they require to learn how the environment works (‘world model’) before solving the tasks, and use a biologically implausible learning process requiring an ‘external teacher’ to tell how their internal units should respond. Here we present a novel architecture proposing how organisms might overcome these challenging problems. First, the architecture can decide if exploring, to learn the world model, or planning, using such model, by evaluating how confident it is on the model knowledge. Second, the architecture can autonomously learn the world model based on experience. The architecture represents a first fully autonomous planning model relying on a spiking neural network.

Extended Kalman Filtering Projection Method to Reduce the 3σ Noise Value of Optical Biosensors

Optical biosensors have experienced a rapid growth over the past decade because of their high sensitivity and the fact that they are label-free. Many optical biosensors rely on tracking the change in a resonance signal or an interference pattern caused by the change in refractive index that occurs upon binding to a target biomarker. The most commonly used method for tracking such a signal is based on fitting the data with an appropriate mathematical function, such as a harmonic function or a Fano, Gaussian, or Lorentz function. However, these functions have limited fitting efficiency because of the deformation of data from noise. Here, we introduce an extended Kalman filter projection (EKFP) method to address the problem of resonance tracking and demonstrate that it improves the tolerance to noise, reduces the 3σ noise value, and lowers the limit of detection (LOD). We utilize the method to process the data of experiments for detecting the binding of C-reactive protein in a urine matrix with a chirped guided mode resonance sensor and are able to improve the LOD from 10 to 1 pg/mL. Our method reduces the 3σ noise value of this measurement compared to a simple Fano fit from 1.303 to 0.015 pixels. These results demonstrate the significant advantage of the EKFP method to resolving noisy data of optical biosensors.

A Multi-Static Radar Network with Ultra-Wideband Radio-Equipped Devices

A growing number of devices, from car key fobs to mobile phones to WiFi-routers, are equipped with ultra-wideband radios. In the network formed by these devices, communicating modules often estimate the channel impulse response to employ a matched filter to decode transmitted data or to accurately time stamp incoming messages when estimating the time-of-flight for localization. This paper investigates how such measurements of the channel impulse response can be utilized to augment existing ultra-wideband communication and localization networks to a multi-static radar network. The approach is experimentally evaluated using off-the-shelf hardware and simple, distributed filtering, and shows that a tag-free human walking in the space equipped with ultra-wideband modules can be tracked in real time. This opens the door for various location-based smart home applications, ranging from smart audio and light systems to elderly monitoring and security systems.

A Computationally Efficient Labeled Multi-Bernoulli Smoother for Multi-Target Tracking

A forward–backward labeled multi-Bernoulli (LMB) smoother is proposed for multi-target tracking. The proposed smoother consists of two components corresponding to forward LMB filtering and backward LMB smoothing, respectively. The former is the standard LMB filter and the latter is proved to be closed under LMB prior. It is also shown that the proposed LMB smoother can improve both the cardinality estimation and the state estimation, and the major computational complexity is linear with the number of targets. Implementation based on the Sequential Monte Carlo method in a representative scenario has demonstrated the effectiveness and computational efficiency of the proposed smoother in comparison to existing approaches.

An Efficient Extended Targets Detection Framework Based on Sampling and Spatio-Temporal Detection

Excellent performance, real-time and low memory requirement are three vital requirements for target detection in high resolution marine radar system. Unfortunately, many current state-of-the-art methods merely achieve excellent performance when coping with highly complex scenes. In fact, a common problem is that real-time processing, low memory requirement and remarkable detection ability are difficult to coordinate. To address this issue, we propose a novel detection framework which bases its principle on sampling and spatiotemporal detection. The framework consists of two stages, coarse detection and fine detection. Sampling-based coarse detection is designed to guarantee the real-time processing and low memory requirements by locating the area where targets may exist in advance. Different from former detection methods, multi-scan video data are utilized. In the stage of fine detection, the candidate areas are grouped into three categories: single target, dense targets and sea clutter. Different approaches for processing the different categories are implemented to achieve excellent performance. The superiority of the proposed framework beyond state-of-the-art baselines is well substantiated in this work. Low memory requirement of the proposed framework was verified by theoretical analysis. Real-time processing capability was verified by the video data of two real scenarios. Synthetic data were tested to show the improvement in tracking performance by using the proposed detection framework.

A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling

In the real-world manufacturing system, various uncertain events can occur and disrupt the normal production activities. This paper addresses the multi-objective job shop scheduling problem with random machine breakdowns. As the key of our approach, the robustness of a schedule is considered jointly with the makespan and is defined as expected makespan delay, for which a meta-model is designed by using a data-driven response surface method. Correspondingly, a multi-objective evolutionary algorithm (MOEA) is proposed based on the meta-model to solve the multi-objective optimization problem. Extensive experiments based on the job shop benchmark problems are conducted. The results demonstrate that the Pareto solution sets of the MOEA are much better in both convergence and diversity than those of the algorithms based on the existing slack-based surrogate measures. The MOEA is also compared with the algorithm based on Monte Carlo approximation, showing that their Pareto solution sets are close to each other while the MOEA is much more computationally efficient.

Joint Design of Transmit Waveforms for Object Tracking in Coexisting Multimodal Sensing Systems

We examine a multiple object tracking problem by jointly optimizing the transmit waveforms used in a multimodal system. Coexisting sensors in this system were assumed to share the same spectrum. Depending on the application, a system can include radars tracking multiple targets or multiuser wireless communications and a radar tracking both multiple messages and a target. The proposed spectral coexistence approach was based on designing all transmit waveforms to have the same time-varying phase function while optimizing desirable performance metrics. Considering the scenario of tracking a target with a pulse–Doppler radar and multiple user messages, two signaling schemes were proposed after selecting the waveform parameters to first minimize multiple access interference. The first scheme is based on system interference minimization, whereas the second scheme explores the multiobjective optimization tradeoff between system interference and object parameter estimation error. Simulations are provided to demonstrate the performance tradeoffs due to different system requirements.

Particle filtering of dynamical networks: Highlighting observability issues

In a network of high-dimensionality, it is not feasible to measure every single node. Thus, an important goal is to define the optimal choice of sensor nodes that provides a reliable state reconstruction of the network system state-space. This is an observability problem. In this paper, we propose a particle filtering (PF) framework as a way to assess observability properties of a dynamical network, where each node is composed of an individual dynamical system. The PF framework is applied to two benchmarks, networks of Kuramoto and Rössler oscillators, to investigate how the interplay between dynamics and topology impacts the network observability. Based on the numerical results, we conjecture that, when the network nodal dynamics are heterogeneous, better observability is conveyed for sets of sensor nodes that share some dynamical affinity to its neighbourhood. Moreover, we also investigate how the choice of an internal measured variable of a multidimensional sensor node affects the PF performance. The PF framework effectiveness as an observability measure is compared with a well-consolidated nonlinear observability metric for a small network case and some chaotic system benchmarks.

Double-Layer Cubature Kalman Filter for Nonlinear Estimation

The cubature Kalman filter (CKF) has poor performance in strongly nonlinear systems while the cubature particle filter has high computational complexity induced by stochastic sampling. To address these problems, a novel CKF named double-Layer cubature Kalman filter (DLCKF) is proposed. In the proposed DLCKF, the prior distribution is represented by a set of weighted deterministic sampling points, and each deterministic sampling point is updated by the inner CKF. Finally, the update mechanism of the outer CKF is used to obtain the state estimations. Simulation results show that the proposed algorithm has not only high estimation accuracy but also low computational complexity, compared with the state-of-the-art filtering algorithms.

A Novel Framework for Parameter and State Estimation of Multicellular Systems Using Gaussian Mixture Approximations

Multicellular systems play an important role in many biotechnological processes. Typically, these exhibit cell-to-cell variability, which has to be monitored closely for process control and optimization. However, some properties may not be measurable due to technical and financial restrictions. To improve the monitoring, model-based online estimators can be designed for their reconstruction. The multicellular dynamics is accounted for in the framework of population balance models (PBMs). These models are based on single cell kinetics, and each cellular state translates directly into an additional dimension of the obtained partial differential equations. As multicellular dynamics often require detailed single cell models and feature a high number of cellular components, the resulting population balance equations are often high-dimensional. Therefore, established state estimation concepts for PBMs based on discrete grids are not recommended due to the large computational effort. In this contribution a novel approach is proposed, which is based on the approximation of the underlying number density functions as the weighted sum of Gaussian distributions. Thus, the distribution is described by the characteristic properties of the individual Gaussians, like the mean and covariance. Thereby, the complex infinite dimensional estimation problem can be reduced to a finite dimension. The characteristic properties are estimated in a recursive approach. The method is evaluated for two academic benchmark examples, and the results indicate its potential for model-based online reconstruction for multicellular systems.

Adaptive Fifth-Degree Cubature Information Filter for Multi-Sensor Bearings-Only Tracking

Standard Bayesian filtering algorithms only work well when the statistical properties of system noises are exactly known. However, this assumption is not always plausible in real target tracking applications. In this paper, we present a new estimation approach named adaptive fifth-degree cubature information filter (AFCIF) for multi-sensor bearings-only tracking (BOT) under the condition that the process noise follows zero-mean Gaussian distribution with unknown covariance. The novel algorithm is based on the fifth-degree cubature Kalman filter and it is constructed within the information filtering framework. With a sensor selection strategy developed using observability theory and a recursive process noise covariance estimation procedure derived using the covariance matching principle, the proposed filtering algorithm demonstrates better estimation accuracy and filtering stability. Simulation results validate the superiority of the AFCIF.

Tracking Ground Targets with a Road Constraint Using a GMPHD Filter

The Gaussian mixture probability hypothesis density (GMPHD) filter is applied to the problem of tracking ground moving targets in clutter due to its excellent multitarget tracking performance, such as avoiding measurement-to-track association, and its easy implementation. For the existing GMPHD-based ground target tracking algorithm (the GMPHD filter incorporating map information using a coordinate transforming method, CT-GMPHD), the predicted probability density of its target state is given in road coordinates, while its target state update needs to be performed in Cartesian ground coordinates. Although the algorithm can improve the filtering performance to a certain extent, the coordinate transformation process increases the complexity of the algorithm and reduces its computational efficiency. To address this issue, this paper proposes two non-coordinate transformation roadmap fusion algorithms: directional process noise fusion (DNP-GMPHD) and state constraint fusion (SC-GMPHD). The simulation results show that, compared with the existing algorithms, the two proposed roadmap fusion algorithms are more accurate and efficient for target estimation performance on straight and curved roads in a cluttered environment. The proposed methods are additionally applied using a cardinalized PHD (CPHD) filter and a labeled multi-Bernoulli (LMB) filter. It is found that the PHD filter performs less well than the CPHD and LMB filters, but that it is also computationally cheaper.

Multi-Object Tracking with Correlation Filter for Autonomous Vehicle

Multi-object tracking is a crucial problem for autonomous vehicle. Most state-of-the-art approaches adopt the tracking-by-detection strategy, which is a two-step procedure consisting of the detection module and the tracking module. In this paper, we improve both steps. We improve the detection module by incorporating the temporal information, which is beneficial for detecting small objects. For the tracking module, we propose a novel compressed deep Convolutional Neural Network (CNN) feature based Correlation Filter tracker. By carefully integrating these two modules, the proposed multi-object tracking approach has the ability of re-identification (ReID) once the tracked object gets lost. Extensive experiments were performed on the KITTI and MOT2015 tracking benchmarks. Results indicate that our approach outperforms most state-of-the-art tracking approaches.

Dual Sensor Control Scheme for Multi-Target Tracking

Sensor control is a challenging issue in the field of multi-target tracking. It involves multi-target state estimation and the optimal control of the sensor. To maximize the overall utility of the surveillance system, we propose a dual sensor control scheme. This work is formulated in the framework of partially observed Markov decision processes (POMDPs) with Mahler’s finite set statistics (FISST). To evaluate the performance associated with each control action, a key element is to design an appropriate metric. From a task-driven perspective, we utilize a metric to minimize the posterior distance between the sensor and the target. This distance-related metric promotes the design of a dual sensor control scheme. Moreover, we introduce a metric to maximize the predicted average probability of detection, which will improve the efficiency by avoiding unnecessary update processes. Simulation results indicate that the performance of the proposed algorithm is significantly superior to the existing methods.

Color Feature-Based Object Tracking through Particle Swarm Optimization with Improved Inertia Weight

This paper presents a particle swarm tracking algorithm with improved inertia weight based on color features. The weighted color histogram is used as the target feature to reduce the contribution of target edge pixels in the target feature, which makes the algorithm insensitive to the target non-rigid deformation, scale variation, and rotation. Meanwhile, the influence of partial obstruction on the description of target features is reduced. The particle swarm optimization algorithm can complete the multi-peak search, which can cope well with the object occlusion tracking problem. This means that the target is located precisely where the similarity function appears multi-peak. When the particle swarm optimization algorithm is applied to the object tracking, the inertia weight adjustment mechanism has some limitations. This paper presents an improved method. The concept of particle maturity is introduced to improve the inertia weight adjustment mechanism, which could adjust the inertia weight in time according to the different states of each particle in each generation. Experimental results show that our algorithm achieves state-of-the-art performance in a wide range of scenarios.

A Novel Hard Decision Based Simultaneous Target Tracking and Classification Approach

Methods dealing with the problem of Joint Tracking and Classification (JTC) are abundant, among which Simultaneous Tracking and Classification (STC) provides a modularized scheme solving tracking and classification subproblems simultaneously. However, there is no explicit hard decision on the class label but only soft decision (class probability) is provided. This does not fit many practical cases, in which a hard decision is urgently needed. To solve this problem, this paper proposes a Hard decision-based STC (HSTC) method. HSTC takes all the decision error rate, timeliness, and estimation error into account. Specifically, for decision, the sequential probability ratio test is adopted due to its nice properties and also the adaptability to our situation. For estimation, by utilizing the two-way information exchange between the tracker and the classifier, we propose flexible three tracking schemes related to decision. The HSTC tracking result is divided into three parts according to the time of making the hard decision. In general, the proposed HSTC method takes advantage of both SPRT and STC. Finally, two illustrative JTC examples with hard decision verify the effectiveness of the the proposed HSTC method. They show that HSTC can meet the demand of the problem, and also has the performance superiority in both decision and estimation.

Error Modelling for Multi-Sensor Measurements in Infrastructure-Free Indoor Navigation

The long-term objective of our research is to develop a method for infrastructure-free simultaneous localization and mapping (SLAM) and context recognition for tactical situational awareness. Localization will be realized by propagating motion measurements obtained using a monocular camera, a foot-mounted Inertial Measurement Unit (IMU), sonar, and a barometer. Due to the size and weight requirements set by tactical applications, Micro-Electro-Mechanical (MEMS) sensors will be used. However, MEMS sensors suffer from biases and drift errors that may substantially decrease the position accuracy. Therefore, sophisticated error modelling and implementation of integration algorithms are key for providing a viable result. Algorithms used for multi-sensor fusion have traditionally been different versions of Kalman filters. However, Kalman filters are based on the assumptions that the state propagation and measurement models are linear with additive Gaussian noise. Neither of the assumptions is correct for tactical applications, especially for dismounted soldiers, or rescue personnel. Therefore, error modelling and implementation of advanced fusion algorithms are essential for providing a viable result. Our approach is to use particle filtering (PF), which is a sophisticated option for integrating measurements emerging from pedestrian motion having non-Gaussian error characteristics. This paper discusses the statistical modelling of the measurement errors from inertial sensors and vision based heading and translation measurements to include the correct error probability density functions (pdf) in the particle filter implementation. Then, model fitting is used to verify the pdfs of the measurement errors. Based on the deduced error models of the measurements, particle filtering method is developed to fuse all this information, where the weights of each particle are computed based on the specific models derived. The performance of the developed method is tested via two experiments, one at a university's premises and another in realistic tactical conditions. The results show significant improvement on the horizontal localization when the measurement errors are carefully modelled and their inclusion into the particle filtering implementation correctly realized.

Fully Adaptive Particle Filtering Algorithm for Damage Diagnosis and Prognosis

A fully adaptive particle filtering algorithm is proposed in this paper which is capable of updating both state process models and measurement models separately and simultaneously. The approach is a significant step toward more realistic online monitoring or tracking damage. The majority of the existing methods for Bayes filtering are based on predefined and fixed state process and measurement models. Simultaneous estimation of both state and model parameters has gained attention in recent literature. Some works have been done on updating the state process model. However, not many studies exist regarding an update of the measurement model. In most of the real-world applications, the correlation between measurements and the hidden state of damage is not defined in advance and, therefore, presuming an offline fixed measurement model is not promising. The proposed approach is based on optimizing relative entropy or Kullback-Leibler divergence through a particle filtering algorithm. The proposed algorithm is successfully applied to a case study of online fatigue damage estimation in composite materials.