• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Tracking of Pedestrians Using Multi-Target Tracking Methods with a Group Representation

Jerrelind, Jakob January 2020 (has links)
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.
2

Evaluation de situations dynamiques multicibles par fusion de données spatio-temporelles

Pollard, Evangeline 15 October 2010 (has links) (PDF)
Cette thèse, réalisée en coopération avec l'Onera, s'inscrit dans le domaine de la surveillance du champ de bataille. L'objectif des travaux est d'étudier et de développer une technique qui fusionne différentes sources d'informations, afin d'évaluer la situation tactique sur une large zone d'observation, ceci de manière semi-automatique en temps quasi-réel. Cette évaluation est réalisée en deux étapes. La première réalise une évaluation globale de la situation en utilisant une nouvelle technique de trajectographie (ou pistage) multicible par hybridation du filtre GM-CPHD et du MHT sous contrainte routière à partir des données GMTI (Ground Moving Target Indicator). Ce nouvel algorithme est adapté au pistage de cibles proches. Ensuite, la deuxième étape réalise une évaluation plus fine de la situation en détectant des objets dit d'intérêt tels que des convois par l'intégration d'autres types de données (SAR, vidéo). La détection se base sur l'utilisation des réseaux bayésiens ainsi que leur version crédibiliste.
3

Advanced signal processing techniques for multi-target tracking

Daniyan, Abdullahi January 2018 (has links)
The multi-target tracking problem essentially involves the recursive joint estimation of the state of unknown and time-varying number of targets present in a tracking scene, given a series of observations. This problem becomes more challenging because the sequence of observations is noisy and can become corrupted due to miss-detections and false alarms/clutter. Additionally, the detected observations are indistinguishable from clutter. Furthermore, whether the target(s) of interest are point or extended (in terms of spatial extent) poses even more technical challenges. An approach known as random finite sets provides an elegant and rigorous framework for the handling of the multi-target tracking problem. With a random finite sets formulation, both the multi-target states and multi-target observations are modelled as finite set valued random variables, that is, random variables which are random in both the number of elements and the values of the elements themselves. Furthermore, compared to other approaches, the random finite sets approach possesses a desirable characteristic of being free of explicit data association prior to tracking. In addition, a framework is available for dealing with random finite sets and is known as finite sets statistics. In this thesis, advanced signal processing techniques are employed to provide enhancements to and develop new random finite sets based multi-target tracking algorithms for the tracking of both point and extended targets with the aim to improve tracking performance in cluttered environments. To this end, firstly, a new and efficient Kalman-gain aided sequential Monte Carlo probability hypothesis density (KG-SMC-PHD) filter and a cardinalised particle probability hypothesis density (KG-SMC-CPHD) filter are proposed. These filters employ the Kalman- gain approach during weight update to correct predicted particle states by minimising the mean square error between the estimated measurement and the actual measurement received at a given time in order to arrive at a more accurate posterior. This technique identifies and selects those particles belonging to a particular target from a given PHD for state correction during weight computation. The proposed SMC-CPHD filter provides a better estimate of the number of targets. Besides the improved tracking accuracy, fewer particles are required in the proposed approach. Simulation results confirm the improved tracking performance when evaluated with different measures. Secondly, the KG-SMC-(C)PHD filters are particle filter (PF) based and as with PFs, they require a process known as resampling to avoid the problem of degeneracy. This thesis proposes a new resampling scheme to address a problem with the systematic resampling method which causes a high tendency of resampling very low weight particles especially when a large number of resampled particles are required; which in turn affect state estimation. Thirdly, the KG-SMC-(C)PHD filters proposed in this thesis perform filtering and not tracking , that is, they provide only point estimates of target states but do not provide connected estimates of target trajectories from one time step to the next. A new post processing step using game theory as a solution to this filtering - tracking problem is proposed. This approach was named the GTDA method. This method was employed in the KG-SMC-(C)PHD filter as a post processing technique and was evaluated using both simulated and real data obtained using the NI-USRP software defined radio platform in a passive bi-static radar system. Lastly, a new technique for the joint tracking and labelling of multiple extended targets is proposed. To achieve multiple extended target tracking using this technique, models for the target measurement rate, kinematic component and target extension are defined and jointly propagated in time under the generalised labelled multi-Bernoulli (GLMB) filter framework. The GLMB filter is a random finite sets-based filter. In particular, a Poisson mixture variational Bayesian (PMVB) model is developed to simultaneously estimate the measurement rate of multiple extended targets and extended target extension was modelled using B-splines. The proposed method was evaluated with various performance metrics in order to demonstrate its effectiveness in tracking multiple extended targets.

Page generated in 0.0211 seconds