Analysing migrating cells in microscopy time-lapse images has already helped the understanding of many biological processes and may be of importance in the development of new medical treatments. Today’s biological experiments tend to produce a huge amount of dynamic image data and tracking the individual cells by hand has become a bottleneck for the further analysis work. A number of cell tracking methods have therefore been developed over the past decades, but still many of the techniques have a limited performance. The aim of this Master Project is to develop a particle filter algorithm that automatically detects and tracks a large number of individual cells in an image sequence. The solution is based on a Rao-Blackwellized particle filter for multiple object tracking. The report also covers a review of existing automatic cell tracking techniques, a review of well-known filter techniques for single target tracking and how these techniques have been developed to handle multiple target tracking. The designed algorithm has been tested on real microscopy image data of neutrophils with 400 to 500 cells in each frame. The designed algorithm works well in areas of the images where no cells touch and can in these situations also correct for some segmentation mistakes. In areas where cells touch, the algorithm works well if the segmentation is correct, but often makes mistakes when it is not. A target effectiveness of 77 percent and a track purity of 80 percent are then achieved.

Localização e Mapeamento Simultâneos (SLAM) é uma das tarefas mais difíceis em robótica móvel, uma vez que existe uma dependência mútua entre a estimativa da localização do robô e a construção do mapa de ambiente. As estratégias de SLAM mais bem sucedidas focam na construção de um mapa métrico probabilístico empregando técnicas de filtragem Bayesiana. Embora tais métodos permitam a construção de soluções localmente consistentes e coerentes, o SLAM continua sendo um problema crítico em operações em ambientes grandes. Para contornar esta limitação, muitas estratégias dividem o ambiente em pequenas regiões, e formulam o problema de SLAM como uma combinação de múltiplos submapas métricos precisos associados em um mapa topológico. Este trabalho propõe um método de SLAM baseado nos algoritmos DP-SLAM (Distributed Particle SLAM) e SegSlam (Segmented SLAM). SegSLAM é um algoritmo que cria múltiplos submapas para cada região do ambiente, e posteriormente constrói o mapa global selecionando combinações de submapas. Por sua vez, DP-SLAM é um algoritmo de filtro de particulas Rao-Blackwellized que utiliza uma representação distribuída eficiente dos mapas das partículas, juntamente com a árvore de ascendência das partículas. A característica distribuída destas estruturas é favorável para a combinação de diferentes segmentos de mapa localmente precisos, o que aumenta a diversidade de soluções. O algoritmo proposto nesta dissertação, chamado SDP-SLAM, segmenta e combina diferentes hipóteses de trajetórias do robô, a fim de reconstruir o mapa do ambiente. Nossas principais contribuições são o desenvolvimento de novas estratégias para o casamento de submapas e para a estimativa de boas combinações de submapas. O SDP-SLAM foi avaliado através de experimentos realizados por um robô móvel operando em ambientes reais e simulados. / Simultaneous Localization and Mapping (SLAM) is one of the most difficult tasks in mobile robotics, since there is a mutual dependency between the estimation of the robot pose and the construction of the environment map. Most successful strategies in SLAM focus in building a probabilistic metric map employing Bayesian filtering techniques. While these methods allow the construction of consistent and coherent local solutions, the SLAM remains a critical problem in operations within large environments. To circumvent this limitation, many strategies divide the environment in small regions, and formulate the SLAM problem as a combination of multiple precise metric submaps associated in a topological map. This work proposes a SLAM method based on the Distributed Particle SLAM (DPSLAM) and the Segmented SLAM (SegSLAM) algorithms. SegSLAM is an algorithm that generates multiple submaps for every region of the environment, and then build the global map by selecting combinations of submaps. DP-SLAM is a Rao-Blackwellized particle filter algorithm that uses an efficient distributed representation of the particles maps associated with an ancestry tree of the particles. The distributed characteristic of these structures favors the combination of locally accurate map segments, that can increase the diversity of global level solutions. The algorithm proposed in this dissertation, called SDP-SLAM, segments and combines different hypotheses of robot trajectories to reconstruct the environment map. Our main contributions are the development of novel strategies for the matching of submaps and for the estimation of good submaps combinations. SDP-SLAM was evaluated through experiments performed by a mobile robot operating in real and simulated environments.

Localização e Mapeamento Simultâneos (SLAM) é uma das tarefas mais difíceis em robótica móvel, uma vez que existe uma dependência mútua entre a estimativa da localização do robô e a construção do mapa de ambiente. As estratégias de SLAM mais bem sucedidas focam na construção de um mapa métrico probabilístico empregando técnicas de filtragem Bayesiana. Embora tais métodos permitam a construção de soluções localmente consistentes e coerentes, o SLAM continua sendo um problema crítico em operações em ambientes grandes. Para contornar esta limitação, muitas estratégias dividem o ambiente em pequenas regiões, e formulam o problema de SLAM como uma combinação de múltiplos submapas métricos precisos associados em um mapa topológico. Este trabalho propõe um método de SLAM baseado nos algoritmos DP-SLAM (Distributed Particle SLAM) e SegSlam (Segmented SLAM). SegSLAM é um algoritmo que cria múltiplos submapas para cada região do ambiente, e posteriormente constrói o mapa global selecionando combinações de submapas. Por sua vez, DP-SLAM é um algoritmo de filtro de particulas Rao-Blackwellized que utiliza uma representação distribuída eficiente dos mapas das partículas, juntamente com a árvore de ascendência das partículas. A característica distribuída destas estruturas é favorável para a combinação de diferentes segmentos de mapa localmente precisos, o que aumenta a diversidade de soluções. O algoritmo proposto nesta dissertação, chamado SDP-SLAM, segmenta e combina diferentes hipóteses de trajetórias do robô, a fim de reconstruir o mapa do ambiente. Nossas principais contribuições são o desenvolvimento de novas estratégias para o casamento de submapas e para a estimativa de boas combinações de submapas. O SDP-SLAM foi avaliado através de experimentos realizados por um robô móvel operando em ambientes reais e simulados. / Simultaneous Localization and Mapping (SLAM) is one of the most difficult tasks in mobile robotics, since there is a mutual dependency between the estimation of the robot pose and the construction of the environment map. Most successful strategies in SLAM focus in building a probabilistic metric map employing Bayesian filtering techniques. While these methods allow the construction of consistent and coherent local solutions, the SLAM remains a critical problem in operations within large environments. To circumvent this limitation, many strategies divide the environment in small regions, and formulate the SLAM problem as a combination of multiple precise metric submaps associated in a topological map. This work proposes a SLAM method based on the Distributed Particle SLAM (DPSLAM) and the Segmented SLAM (SegSLAM) algorithms. SegSLAM is an algorithm that generates multiple submaps for every region of the environment, and then build the global map by selecting combinations of submaps. DP-SLAM is a Rao-Blackwellized particle filter algorithm that uses an efficient distributed representation of the particles maps associated with an ancestry tree of the particles. The distributed characteristic of these structures favors the combination of locally accurate map segments, that can increase the diversity of global level solutions. The algorithm proposed in this dissertation, called SDP-SLAM, segments and combines different hypotheses of robot trajectories to reconstruct the environment map. Our main contributions are the development of novel strategies for the matching of submaps and for the estimation of good submaps combinations. SDP-SLAM was evaluated through experiments performed by a mobile robot operating in real and simulated environments.

Localização e Mapeamento Simultâneos (SLAM) é uma das tarefas mais difíceis em robótica móvel, uma vez que existe uma dependência mútua entre a estimativa da localização do robô e a construção do mapa de ambiente. As estratégias de SLAM mais bem sucedidas focam na construção de um mapa métrico probabilístico empregando técnicas de filtragem Bayesiana. Embora tais métodos permitam a construção de soluções localmente consistentes e coerentes, o SLAM continua sendo um problema crítico em operações em ambientes grandes. Para contornar esta limitação, muitas estratégias dividem o ambiente em pequenas regiões, e formulam o problema de SLAM como uma combinação de múltiplos submapas métricos precisos associados em um mapa topológico. Este trabalho propõe um método de SLAM baseado nos algoritmos DP-SLAM (Distributed Particle SLAM) e SegSlam (Segmented SLAM). SegSLAM é um algoritmo que cria múltiplos submapas para cada região do ambiente, e posteriormente constrói o mapa global selecionando combinações de submapas. Por sua vez, DP-SLAM é um algoritmo de filtro de particulas Rao-Blackwellized que utiliza uma representação distribuída eficiente dos mapas das partículas, juntamente com a árvore de ascendência das partículas. A característica distribuída destas estruturas é favorável para a combinação de diferentes segmentos de mapa localmente precisos, o que aumenta a diversidade de soluções. O algoritmo proposto nesta dissertação, chamado SDP-SLAM, segmenta e combina diferentes hipóteses de trajetórias do robô, a fim de reconstruir o mapa do ambiente. Nossas principais contribuições são o desenvolvimento de novas estratégias para o casamento de submapas e para a estimativa de boas combinações de submapas. O SDP-SLAM foi avaliado através de experimentos realizados por um robô móvel operando em ambientes reais e simulados. / Simultaneous Localization and Mapping (SLAM) is one of the most difficult tasks in mobile robotics, since there is a mutual dependency between the estimation of the robot pose and the construction of the environment map. Most successful strategies in SLAM focus in building a probabilistic metric map employing Bayesian filtering techniques. While these methods allow the construction of consistent and coherent local solutions, the SLAM remains a critical problem in operations within large environments. To circumvent this limitation, many strategies divide the environment in small regions, and formulate the SLAM problem as a combination of multiple precise metric submaps associated in a topological map. This work proposes a SLAM method based on the Distributed Particle SLAM (DPSLAM) and the Segmented SLAM (SegSLAM) algorithms. SegSLAM is an algorithm that generates multiple submaps for every region of the environment, and then build the global map by selecting combinations of submaps. DP-SLAM is a Rao-Blackwellized particle filter algorithm that uses an efficient distributed representation of the particles maps associated with an ancestry tree of the particles. The distributed characteristic of these structures favors the combination of locally accurate map segments, that can increase the diversity of global level solutions. The algorithm proposed in this dissertation, called SDP-SLAM, segments and combines different hypotheses of robot trajectories to reconstruct the environment map. Our main contributions are the development of novel strategies for the matching of submaps and for the estimation of good submaps combinations. SDP-SLAM was evaluated through experiments performed by a mobile robot operating in real and simulated environments.

The Localization and Map building module is a core building block for designing an autonomous vehicle. It describes the vehicle ability to create an accurate model of its surroundings and maintain its position in the environment at the same time. In this thesis work, we contribute to the autonomous driving research area by providing a proof-of-concept of integrating SLAM solutions into commercial vehicles; improving the robustness of the Localization and Map building module. The proposed system applies Bayesian inference theory within the occupancy grid mapping framework and utilizes Rao-Blackwellized Particle Filter for estimating the vehicle trajectory. The work has been done at Scania CV where a heavy duty vehicle equipped with multiple-Lidar sensory architecture was used. Low level sensor fusion of the different Lidars was performed and a parallelized implementation of the algorithm was achieved using a GPU. When tested on the frequently used datasets in the community, the implemented algorithm outperformed the scan-matching technique and showed acceptable performance in comparison to another state-of-art RBPF implementation that adapts some improvements on the algorithm. The performance of the complete system was evaluated under a designed set of real scenarios. The proposed system showed a significant improvement in terms of the estimated trajectory and provided accurate occupancy representations of the vehicle surroundings. The fusion module was found to build more informative occupancy grids than the grids obtained form individual sensors. / Modulen som har hand om både lokalisering och byggandet av karta är en av huvudorganen i ett system för autonom körning. Den beskriver bilens förmåga att skapa en modell av omgivningen och att hålla en position i förhållande till omgivningen. I detta examensarbete bidrar vi till forskningen inom autonom bilkörning med ett valideringskoncept genom att integrera SLAM-lösningar i kommersiella fordon, vilket förbättrar robustheten hos lokaliserings-kartbyggarmodulen. Det föreslagna systemet använder sig utav Bayesiansk statistik applicerat i ett ramverk som har hand om att skapa en karta, som består av ett rutnät som används för att beskriva ockuperingsgraden. För att estimera den bana som fordonet kommer att färdas använder ramverket RBPF(Rao-Blackwellized particle filter). Examensarbetet har genomförts hos Scania CV, där ett tungt fordon utrustat med flera lidarsensorer har använts. En lägre nivå av sensor fusion applicerades för de olika lidarsensorerna och en parallelliserad implementation av algoritmen implementerades på GPU. När algoritmen kördes mot data som ofta används av ”allmänheten” kan vi konstatera att den implementerade algoritmen ger ett väldigt mycket bättre resultat än ”scan-matchnings”-tekniken och visar på ett acceptabelt resultat i jämförelse med en annan högpresterande RBPFimplementation, vilken tillför några förbättringar på algoritmen. Prestandan av hela systemet utvärderas med ett antal egendesignade realistiska scenarion. Det föreslagna systemet visar på en tydlig förbättring av uppskattningen av körbanan och bidrar även med en exakt representation av omgivningen. Sensor Fusionen visar på en bättre och mer informativ representation än när man endast utgår från de individuella lidarsensorerna.

Visual tracking is a classical computer vision problem with many important applications in areas such as robotics, surveillance and driver assistance. The task is to follow a target in an image sequence. The target can be any object of interest, for example a human, a car or a football. Humans perform accurate visual tracking with little effort, while it remains a difficult computer vision problem. It imposes major challenges, such as appearance changes, occlusions and background clutter. Visual tracking is thus an open research topic, but significant progress has been made in the last few years. The first part of this thesis explores generic tracking, where nothing is known about the target except for its initial location in the sequence. A specific family of generic trackers that exploit the FFT for faster tracking-by-detection is studied. Among these, the CSK tracker have recently shown obtain competitive performance at extraordinary low computational costs. Three contributions are made to this type of trackers. Firstly, a new method for learning the target appearance is proposed and shown to outperform the original method. Secondly, different color descriptors are investigated for the tracking purpose. Evaluations show that the best descriptor greatly improves the tracking performance. Thirdly, an adaptive dimensionality reduction technique is proposed, which adaptively chooses the most important feature combinations to use. This technique significantly reduces the computational cost of the tracking task. Extensive evaluations show that the proposed tracker outperform state-of-the-art methods in literature, while operating at several times higher frame rate. In the second part of this thesis, the proposed generic tracking method is applied to human tracking in surveillance applications. A causal framework is constructed, that automatically detects and tracks humans in the scene. The system fuses information from generic tracking and state-of-the-art object detection in a Bayesian filtering framework. In addition, the system incorporates the identification and tracking of specific human parts to achieve better robustness and performance. Tracking results are demonstrated on a real-world benchmark sequence.

Terrain referenced navigation is a method of navigation that uses measurements of altitude above ground to infer the position of the vehicle, mainly aerial or underwater. This method provides an alternative to the commonly used satellite-based navigation. Satellite-based navigation methods rely on positional information being sent from an external source, which can be jammed or tampered with, a problem terrain referenced navigation does not have. Both satellite-based and terrain based navigation methods often work in conjunction with inertial navigation systems, which are accurate for short periods of time but suffer from large errors due to accumulation of errors when used for longer missions. In this thesis, several state-of-the-art methods of terrain referenced navigation are studied and evaluated, with the main focus being the different estimation methods employed. Five of the studied estimators were implemented and tested on simulated flight data from a generic aerial vehicle, resulting in improved navigation accuracy compared to using inertial navigation on its own. For the terrain referenced navigation to work well, the ground needs to be relatively unique in order to contain useful information, thus making the estimation more uncertain when flying over flat regions. To deal with this, path planning was used to alter the flight path to increase the expected information gain. Using a grid based planning algorithm together with the original route yielded a modified path with more potential information. When following this new path, the terrain referenced navigation systems are shown to estimate the position more accurately compared to the original path. The study shows that terrain referenced navigation is a viable alternative to satellite based navigation. It also indicates that modifying the path to increase the expected information gain can result in better robustness and precision. / Terrängbaserad navigering är en navigeringsmetod där mätningar av höjd över mark används för att fastställa fordonets position, huvudsakligen från luften eller under vattnet. Denna metod är ett alternativ till den allmänt använda satellitbaserade navigeringen. Satellitbaserad navigering är beroende av att positionsinformation skickas från en extern källa, som kan störas eller manipuleras, vilket är ett problem som terrängbaserad navigering inte har. Både satellitbaserade och terrängbaserade navigeringsmetoder används ofta tillsammans med tröghetsnavigeringssystem, som är noggranna under kortare tid, men som lider av stora fel på grund av ackumulering av fel när de används under längre uppdrag. I denna rapport studeras och utvärderas flera moderna metoder för terrängbaserad navigering, med huvudfokus på de olika skattningsmetoder som används. Fem av de studerade skattningsmetoderna implementerades och testades på simulerade flygdata från ett generiskt flygfarkost, vilket resulterade i förbättrad navigeringsnoggrannhet jämfört med att använda tröghetsnavigering på egen hand. För att den terrängbaserade navigeringen ska fungera bra måste marken vara relativt unik för att innehålla användbar information, vilket gör uppskattningen mer osäker när man flyger över plana områden. För att hantera detta användes banplanering för att välja en flygbana som ger maximalt informations innehåll. Genom att använda en rutnätsbaserad planeringsalgoritm tillsammans med den ursprungliga rutten erhölls en modifierad bana med mer potentiell information. Genom att följa denna nya bana uppskattas positionen bättre av de terrängbaserade navigationssystemen jämfört med den ursprungliga banan. Studien visar att terrängbaserad navigering är ett gångbart alternativ till satellitbaserad navigering. Den visar också att en ändring av banan för att öka den förväntade informationsvinsten kan leda till bättre robusthet och precision.