Essays about: "distance transform"
Showing result 16 - 20 of 51 essays containing the words distance transform.
-
16. Shape Representation Using a Volume Coverage Model
University essay from Linköpings universitet/InformationskodningAbstract : Geometric shapes can be represented in a variety of different ways. A distancemap is a map from points to distances. This can be used as a shape representationwhich can be created through a process known as a distance transform. This the-sis project tests a method for three-dimensional distance transforms using frac-tional volume coverage. READ MORE
-
17. A Comparison of Parallel Algorithms for Calculating the Anti-Aliased Euclidean Distance Transform
University essay from Linköpings universitet/InformationskodningAbstract : This thesis presents a comparison of three different parallel algorithms, adapted to calculate the anti-aliased euclidean distance transform. They were originally designed to calculate the binary euclidean distance transform. The three algorithms are; SKW, Jump Flooding Algorithm (JFA), and Parallel Banding Algorithm (PBA). READ MORE
-
18. Optimization Methods for Direct Volume Rendering on the Client Side Web
University essay from Linköpings universitet/InformationskodningAbstract : Volume visualization has been made available on the web using the Direct Volume Rendering (DVR) technique, powered by the WebGL 1 API. While the technique produces visually pleasing output, the performance of the prototypes that implement this leave much desired. 2017 saw the release of the next version of WebGL, WebGL 2. READ MORE
-
19. Evaluation of Target Tracking Using Multiple Sensors and Non-Causal Algorithms
University essay from Linköpings universitet/ReglerteknikAbstract : Today, the main research field for the automotive industry is to find solutions for active safety. In order to perceive the surrounding environment, tracking nearby traffic objects plays an important role. READ MORE
-
20. Registration algorithms formatching laser scans in robotics application
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In this study, we compare different variations of the Iterative ClosestPoint (ICP) algorithm for the purpose of matching laser scans generatedby an indoor robot. The study is mainly focused on investigating maxi-mum difference in the viewpoint the algorithms can handle, and if it canbe used for robot-pose estimation by matching laser scan data generatedat different positions in a home. READ MORE