Multi-target tracking (MTT) methods estimate the trajectory of targets from noisy measurement; therefore, they can be used to handle the pedestrian-vehicle interaction for a moving vehicle. MTT has an important part in assisting the Automated Driving System and the Advanced Driving Assistance System to avoid pedestrian-vehicle collisions. ADAS and ADS rely on correct estimates of the pedestrians' position and velocity, to avoid collisions or unnecessary emergency breaking of the vehicle. Therefore, to help the risk evaluation in these systems, the MTT needs to provide accurate and robust information of the trajectories (in terms of position and velocity) of the pedestrians in different environments. Several factors can make this problem difficult to handle for instance in crowded environments the pedestrians can suffer from occlusion or missed detection. Classical MTT methods, such as the global nearest neighbour filter, can in crowded environments fail to provide robust and accurate estimates. Therefore, more sophisticated MTT methods should be used to increase the accuracy and robustness and, in general, to improve the tracking of targets close to each other. The aim of this master's thesis is to improve the situational awareness with respect to pedestrians and pedestrian-vehicle interactions. In particular, the task is to investigate if the GM-PHD and the GM-CPHD filter improve pedestrian tracking in urban environments, compared to other methods presented in the literature.  The proposed task can be divided into three parts that deal with different issues. The first part regards the significance of different clustering methods and how the pedestrians are grouped together. The implemented algorithms are the distance partitioning algorithm and the Gaussian mean shift clustering algorithm. The second part regards how modifications of the measurement noise levels and the survival of targets based on the target location, with respect to the vehicle's position, can improve the tracking performance and remove unwanted estimates. Finally, the last part regards the impact the filter estimates have on the tracking performance and how important accurate detections of the pedestrians are to improve the overall tracking. From the result the distance partitioning algorithm is the favourable algorithm, since it does not split larger groups. It is also seen that the proposed filters provide correct estimates of pedestrians in events of occlusion or missed detections but suffer from false estimates close to the ego vehicle due to uncertain detections. For the comparison, regarding the improvements, a classic standard MTT filter applying the global nearest neighbour method for the data association is used as the baseline. To conclude; the GM-CPHD filter proved to be the best out of the two proposed filters in this thesis work and performed better also compared to other methods known in the literature. In particular, its estimates survived for a longer period of time in presence of missed detection or occlusion. The conclusion of this thesis work is that the GM-CPHD filter improves the tracking performance and the situational awareness of the pedestrians.

In this thesis, the Recursive-Random Sample Consensus (R-RANSAC) multiple target tracking (MTT) algorithm is further developed and applied to video taken from static platforms. Development of R-RANSAC is primarily focused in three areas: data association, the ability to track maneuvering objects, and track management. The probabilistic data association (PDA) filter performs very well in the R-RANSAC framework and adds minimal computation cost over less sophisticated methods. The interacting multiple models (IMM) filter as well as higher-order linear models are incorporated into R-RANSAC to improve tracking of highly maneuverable targets. An effective track labeling system, a more intuitive track merging criteria, and other improvements were made to the track management system of R-RANSAC. R-RANSAC is shown to be a modular algorithm capable of incorporating the best features of competing MTT algorithms. A comprehensive comparison with the Gaussian mixture probability hypothesis density (GM-PHD) filter was conducted using pseudo-aerial videos of vehicles and pedestrians. R-RANSAC maintains superior track continuity, especially in cases of interacting and occluded targets, and has fewer missed detections when compared with the GM-PHD filter. The two algorithms perform similarly in terms of the number of false positives and tracking precision. The concept of a feedback loop between the tracker and sensor processing modules is extensively explored; the output tracks from R-RANSAC are used to inform how video processing is performed. We are able to indefinitely detect stationary objects by zeroing out the background update rate of target-associated pixels in a Gaussian mixture models (GMM) foreground detector. False positive foreground detections are eliminated with a minimum blob area threshold, a ghost suppression algorithm, and judicious tuning of the R-RANSAC parameters. The ability to detect stationary targets also allows R-RANSAC to be applied to a class of problems known as stationary object detection. Additionally, moving camera foreground detection techniques are applied to the static camera case in order to produce measurements with a velocity component; this is accomplished by using sequential-RANSAC to cluster optical flow vectors of FAST feature pairs. This further improves R-RANSAC's track continuity, especially with interacting targets. Finally, a hybrid algorithm composed of R-RANSAC and the Sequence Model (SM), a machine learner, is presented. The SM learns sequences of target locations and is able to assist in data association once properly trained. In simulation, we demonstrate the SM's ability to significantly improve tracking performance in situations with infrequent measurement updates and a high proportion of clutter measurements.

As the market for unmanned air vehicles (UAVs) rapidly expands, the need for algorithmsthat improve the capabilities of those vehicles is also growing. One valuable capability for UAVsis that of persistent tracking—the ability to find and track another moving object, usually on theground, from an aerial platform. This thesis presents a method for tracking multiple ground targetsfrom an airborne camera. Moving objects on the ground are detected by using frame-to-frameregistration. The detected objects are then tracked using the newly developed recursive RANSACalgorithm. Much video tracking work has focused on using appearance-based processing for tracking,with some approaches using dynamic trackers such as Kalman filters. This work demonstratesa fusion of computer vision and dynamic tracking to increase the ability of an unmanned air platformto identify and robustly track moving targets. With a C++ implementation of the algorithmsrunning on the open source Robot Operating System (ROS) framework, the system developed iscapable of processing 1920x1080 resolution video at over seven frames per second on a desktopcomputer.

In biology, many different kinds of microscopy are used to study cells. There are many different kinds of transmission microscopy, where light is passed through the cells, that can be used without staining or other treatments that can harm the cells. There is also fluorescence microscopy, where fluorescent proteins or dyes are placed in the cells or in parts of the cells, so that they emit light of a specific wavelength when they are illuminated with light of a different wavelength. Many fluorescence microscopes can take images on many different depths in a sample and thereby build a three-dimensional image of the sample. Fluorescence microscopy can also be used to study particles, for example viruses, inside cells. Modern microscopes often have digital cameras or other equipment to take images or record time-lapse video. When biologists perform experiments on cells, they often record image sequences or sequences of three-dimensional volumes to see how the cells behave when they are subjected to different drugs, culture substrates, or other external factors. Previously, the analysis of recorded data has often been done manually, but that is very time-consuming and the results often become subjective and hard to reproduce. Therefore there is a great need for technology for automated analysis of image sequences with cells and particles inside cells. Such technology is needed especially in biological research and drug development. But the technology could also be used clinically, for example to tailor a cancer treatment to an individual patient by evaluating different treatments on cells from a biopsy. This thesis presents algorithms to find cells and particles in images, and to calculate tracks that show how they have moved during an experiment. We have developed a complete system that can find and track cells in all commonly used imaging modalities. We selected and extended a number of existing segmentation algorithms, and thereby created a complete tool to find cell outlines. To link the segmented objects into tracks, we developed a new track linking algorithm. The algorithm adds tracks one by one using dynamic programming, and has many advantages over prior algorithms. Among other things, it is fast, it calculates tracks which are optimal for the entire image sequence, and it can handle situations where multiple cells have been segmented incorrectly as one object. To make it possible to use information about the velocities of the objects in the linking, we developed a method where the positions of the objects are preprocessed using a filter before the linking is performed. This is important for tracking of some particles inside cells and for tracking of cell nuclei in some embryos.       We have developed an open source software which contains all tools that are necessary to analyze image sequences with cells or particles. It has tools for segmentation and tracking of objects, optimization of settings, manual correction, and analysis of outlines and tracks. We developed the software together with biologists who used it in their research. The software has already been used for data analysis in a number of biology publications. Our system has also achieved outstanding performance in three international objective comparisons of systems for tracking of cells. / Inom biologi används många olika typer av mikroskopi för att studera celler. Det finns många typer av genomlysningsmikroskopi, där ljus passerar genom cellerna, som kan användas utan färgning eller andra åtgärder som riskerar att skada cellerna. Det finns också fluorescensmikroskopi där fluorescerande proteiner eller färger förs in i cellerna eller i delar av cellerna, så att de emitterar ljus av en viss våglängd då de belyses med ljus av en annan våglängd. Många fluorescensmikroskop kan ta bilder på flera olika djup i ett prov och på så sätt bygga upp en tre-dimensionell bild av provet. Fluorescensmikroskopi kan även användas för att studera partiklar, som exempelvis virus, inuti celler. Moderna mikroskop har ofta digitala kameror eller liknande utrustning för att ta bilder och spela in bildsekvenser. När biologer gör experiment på celler spelar de ofta in bildsekvenser eller sekvenser av tre-dimensionella volymer för att se hur cellerna beter sig när de utsätts för olika läkemedel, odlingssubstrat, eller andra yttre faktorer. Tidigare har analysen av inspelad data ofta gjorts manuellt, men detta är mycket tidskrävande och resultaten blir ofta subjektiva och svåra att reproducera. Därför finns det ett stort behov av teknik för automatiserad analys av bildsekvenser med celler och partiklar inuti celler. Sådan teknik behövs framförallt inom biologisk forskning och utveckling av läkemedel. Men tekniken skulle också kunna användas kliniskt, exempelvis för att skräddarsy en cancerbehandling till en enskild patient genom att utvärdera olika behandlingar på celler från en biopsi. I denna avhandling presenteras algoritmer för att hitta celler och partiklar i bilder, och för att beräkna trajektorier som visar hur de har förflyttat sig under ett experiment. Vi har utvecklat ett komplett system som kan hitta och följa celler i alla vanligt förekommande typer av mikroskopi. Vi valde ut och vidareutvecklade ett antal existerande segmenteringsalgoritmer, och skapade på så sätt ett heltäckande verktyg för att hitta cellkonturer. För att länka ihop de segmenterade objekten till trajektorier utvecklade vi en ny länkningsalgoritm. Algoritmen lägger till trajektorier en och en med hjälp av dynamisk programmering, och har många fördelar jämfört med tidigare algoritmer. Bland annat är den snabb, den beräknar trajektorier som är optimala över hela bildsekvensen, och den kan hantera fall då flera celler felaktigt segmenterats som ett objekt. För att kunna använda information om objektens hastighet vid länkningen utvecklade vi en metod där objektens positioner förbehandlas med hjälp av ett filter innan länkningen utförs. Detta är betydelsefullt för följning av vissa partiklar inuti celler och för följning av cellkärnor i vissa embryon. Vi har utvecklat en mjukvara med öppen källkod, som innehåller alla verktyg som krävs för att analysera bildsekvenser med celler eller partiklar. Den har verktyg för segmentering och följning av objekt, optimering av inställningar, manuell korrektion, och analys av konturer och trajektorier. Vi utvecklade mjukvaran i samarbete med biologer som använde den i sin forskning. Mjukvaran har redan använts för dataanalys i ett antal biologiska publikationer. Vårt system har även uppnått enastående resultat i tre internationella objektiva jämförelser av system för följning av celler. / <p>QC 20161125</p>

abstract: Tracking a time-varying number of targets is a challenging dynamic state estimation problem whose complexity is intensified under low signal-to-noise ratio (SNR) or high clutter conditions. This is important, for example, when tracking multiple, closely spaced targets moving in the same direction such as a convoy of low observable vehicles moving through a forest or multiple targets moving in a crisscross pattern. The SNR in these applications is usually low as the reflected signals from the targets are weak or the noise level is very high. An effective approach for detecting and tracking a single target under low SNR conditions is the track-before-detect filter (TBDF) that uses unthresholded measurements. However, the TBDF has only been used to track a small fixed number of targets at low SNR. This work proposes a new multiple target TBDF approach to track a dynamically varying number of targets under the recursive Bayesian framework. For a given maximum number of targets, the state estimates are obtained by estimating the joint multiple target posterior probability density function under all possible target existence combinations. The estimation of the corresponding target existence combination probabilities and the target existence probabilities are also derived. A feasible sequential Monte Carlo (SMC) based implementation algorithm is proposed. The approximation accuracy of the SMC method with a reduced number of particles is improved by an efficient proposal density function that partitions the multiple target space into a single target space. The proposed multiple target TBDF method is extended to track targets in sea clutter using highly time-varying radar measurements. A generalized likelihood function for closely spaced multiple targets in compound Gaussian sea clutter is derived together with the maximum likelihood estimate of the model parameters using an iterative fixed point algorithm. The TBDF performance is improved by proposing a computationally feasible method to estimate the space-time covariance matrix of rapidly-varying sea clutter. The method applies the Kronecker product approximation to the covariance matrix and uses particle filtering to solve the resulting dynamic state space model formulation. / Dissertation/Thesis / Doctoral Dissertation Electrical Engineering 2015

<p>Unmanned aerial systems (UASs) are at the intersection of robotics and aerospace re-<br> search. Their rise in popularity spurred the growth of interest in urban air mobility (UAM)<br> across the world. UAM promises the next generation of transportation and logistics to be<br> handled by UASs that operate closer to where people live and work. Therefore safety and<br> security of UASs are paramount for UAM operations. Monitoring UAS traffic is especially<br> challenging in urban canyon environments where traditional radar systems used for air traffic<br> control (ATC) are limited by their line of sight (LOS).<br> This thesis explores the design and preliminary results of a target tracking system for<br> urban canyon environments based on a network of camera nodes. A network of stationary<br> camera nodes can be deployed on a large scale to overcome the LOS issue in radar systems<br> as well as cover considerable urban airspace. A camera node consists of a camera sensor, a<br> beacon, a real-time kinematic (RTK) global navigation satellite system (GNSS) receiver, and<br> an edge computing device. By leveraging high-precision RTK GNSS receivers and beacons,<br> an automatic calibration process of the proposed system is devised to simplify the time-<br> consuming and tedious calibration of a traditional camera network present in motion capture<br> (MoCap) systems. Through edge computing devices, the tracking system combines machine<br> learning techniques and motion detection as hybrid measurement modes for potential targets.<br> Then particle filters are used to estimate target tracks in real-time within the airspace from<br> measurements obtained by the camera nodes. Simulation in a 40m×40m×15m tracking<br> volume shows an estimation error within 0.5m when tracking multiple targets. Moreover,<br> a scaled down physical test with off-the-shelf camera hardware is able to achieve tracking<br> error within 0.3m on a micro-UAS in real time.</p>

In this thesis, the Recursive-Random Sample Consensus (R-RANSAC) algorithm is applied to a vision-based, cooperative target tracking system. Unlike previous applications, which focused on a single camera platform tracking targets in the image frame, this work uses multiple camera platforms to track targets in the inertial or world frame. The process of tracking targets in the inertial frame is commonly referred to as geolocation.In practical applications sensor biases cause the geolocated target estimates to be biased from truth. The method for cooperative estimation developed in this thesis first estimates the relative rotational and translational biases that exist between tracks from different vehicles. It then accounts for the biases and performs the track-to-track association, which determines if the tracks originate from the same target. The track-to-track association is based on a sliding window approach that accounts for the correlation between tracks sharing common process noise and the correlation in time between individual estimation errors, yielding a chi-squared distribution. Typically, accounting for the correlation in time requires the inversion of a Nnx x Nnx covariance matrix, where N is the length of the window and nx is the number of states. Note that this inversion must occur every time the track-to-track association is to be performed. However, it is shown that by making a steady-state assumption, the inverse has a simple closed-form solution, requiring the inversion of only two nx x nx matrices, and can be calculated offline. Distributed data fusion is performed on tracks where the hypothesis test is satisfied. The proposed method is demonstrated on data collected from an actual vision-based tracking system.A novel method is also developed to cooperatively estimate the location and size of occlusions. This capability is important for future target tracking research involving optimized path planning/gimbal pointing, where a geographical map is unavailable. The method is demonstrated in simulation.

Recently, autonomous vehicles have received worldwide attentions from academic research, automotive industry and the general public. In order to achieve a higher level of automation, one of the most fundamental requirements of autonomous vehicles is the capability to respond to internal and external changes in a safe, timely and appropriate manner. Situational awareness and decision making are two crucial enabling technologies for safe operation of autonomous vehicles. This thesis presents a solution for improving the automation level of autonomous vehicles in both situational awareness and decision making aspects by utilising additional domain knowledge such as constraints and influence on a moving object caused by environment and interaction between different moving objects. This includes two specific sub-systems, model based target tracking in environmental perception module and motion planning in path planning module. In the first part, a rigorous Bayesian framework is developed for pooling road constraint information and sensor measurement data of a ground vehicle to provide better situational awareness. Consequently, a new multiple targets tracking (MTT) strategy is proposed for solving target tracking problems with nonlinear dynamic systems and additional state constraints. Besides road constraint information, a vehicle movement is generally affected by its surrounding environment known as interaction information. A novel dynamic modelling approach is then proposed by considering the interaction information as virtual force which is constructed by involving the target state, desired dynamics and interaction information. The proposed modelling approach is then accommodated in the proposed MTT strategy for incorporating different types of domain knowledge in a comprehensive manner. In the second part, a new path planning strategy for autonomous vehicles operating in partially known dynamic environment is suggested. The proposed MTT technique is utilized to provide accurate on-board tracking information with associated level of uncertainty. Based on the tracking information, a path planning strategy is developed to generate collision free paths by not only predicting the future states of the moving objects but also taking into account the propagation of the associated estimation uncertainty within a given horizon. To cope with a dynamic and uncertain road environment, the strategy is implemented in a receding horizon fashion.

Cette thèse s’intéresse au problème de l’inférence bayésienne dans les modèles probabilistes dynamiques. Plus précisément nous nous focalisons sur les méthodes de Monte Carlo pour l’intégration. Nous revisitons tout d’abord le mécanisme d’échantillonnage d’importance avec rééchantillonnage, puis son extension au cadre dynamique connue sous le nom de filtrage particulaire, pour enfin conclure nos travaux par une application à la poursuite multi-cibles.En premier lieu nous partons du problème de l’estimation d’un moment suivant une loi de probabilité, connue à une constante près, par une méthode de Monte Carlo. Tout d’abord,nous proposons un nouvel estimateur apparenté à l’estimateur d’échantillonnage d’importance normalisé mais utilisant deux lois de proposition différentes au lieu d’une seule. Ensuite,nous revisitons le mécanisme d’échantillonnage d’importance avec rééchantillonnage dans son ensemble afin de produire des tirages Monte Carlo indépendants, contrairement au mécanisme usuel, et nous construisons ainsi deux nouveaux estimateurs.Dans un second temps nous nous intéressons à l’aspect dynamique lié au problème d’inférence bayésienne séquentielle. Nous adaptons alors dans ce contexte notre nouvelle technique de rééchantillonnage indépendant développée précédemment dans un cadre statique.Ceci produit le mécanisme de filtrage particulaire avec rééchantillonnage indépendant, que nous interprétons comme cas particulier de filtrage particulaire auxiliaire. En raison du coût supplémentaire en tirages requis par cette technique, nous proposons ensuite une procédure de rééchantillonnage semi-indépendant permettant de le contrôler.En dernier lieu, nous considérons une application de poursuite multi-cibles dans un réseau de capteurs utilisant un nouveau modèle bayésien, et analysons empiriquement les résultats donnés dans cette application par notre nouvel algorithme de filtrage particulaire ainsi qu’un algorithme de Monte Carlo par Chaînes de Markov séquentiel / This thesis deals with integration calculus in the context of Bayesian inference and Bayesian statistical filtering. More precisely, we focus on Monte Carlo integration methods. We first revisit the importance sampling with resampling mechanism, then its extension to the dynamic setting known as particle filtering, and finally conclude our work with a multi-target tracking application. Firstly, we consider the problem of estimating some moment of a probability density, known up to a constant, via Monte Carlo methodology. We start by proposing a new estimator affiliated with the normalized importance sampling estimator but using two proposition densities rather than a single one. We then revisit the importance sampling with resampling mechanism as a whole in order to produce Monte Carlo samples that are independent, contrary to the classical mechanism, which enables us to develop two new estimators. Secondly, we consider the dynamic aspect in the framework of sequential Bayesian inference. We thus adapt to this framework our new independent resampling technique, previously developed in a static setting. This yields the particle filtering with independent resampling mechanism, which we reinterpret as a special case of auxiliary particle filtering. Because of the increased cost required by this technique, we next propose a semi independent resampling procedure which enables to control this additional cost. Lastly, we consider an application of multi-target tracking within a sensor network using a new Bayesian model, and empirically analyze the results from our new particle filtering algorithm as well as a sequential Markov Chain Monte Carlo algorithm

Tato diplomova prace se zameruje na sledovani pohybu vice objektu. Prace popisuje dve implementace filtru, ktere jsou v podstate zalozeny na principu Kalmanova filtru. Obe implementace jsou zalozeny na principu sledovani vice objektu, na zaklade znalosti pozic vsech objektu v kazdem snimku. Prvni implementace je smisena verze Globalniho a Standardniho filtru nejblizsich sousedu. Druha implementace je postavena na pravde- podobnostnim pristupu k procesu sdruzeni. Posledni kapitola poskytuje srovnani mezi temito filtry a Zakladnim filtrem. Algoritmy byly realizovany v jave.