Sökning: "Polygon Detection"

Hittade 4 avhandlingar innehållade orden Polygon Detection.

  1. 1. Applications in Monocular Computer Vision using Geometry and Learning : Map Merging, 3D Reconstruction and Detection of Geometric Primitives

    Författare :David Gillsjö; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Scene Completion; Deep Learning; Bayesian Neural Network; Room Layout Estimation; Line Segment Detection; Polygon Detection; Graph Neural Network; Map Merging; Structure from Motion; Minimal Solvers; Wireframe Estimation;

    Sammanfattning : As the dream of autonomous vehicles moving around in our world comes closer, the problem of robust localization and mapping is essential to solve. In this inherently structured and geometric problem we also want the agents to learn from experience in a data driven fashion. LÄS MER

  3. 2. Adaptive Bounding Volume Hierarchies for Efficient Collision Queries

    Författare :Thomas Larsson; Björn Lisper; Tomas Akenine-Möller; Stefane Redon; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Bounding volume hierarchies; Collision detection; Rigid bodies; Deformable models; Data structures; Simulation; Animation; Three-dimensional graphics and realism; Computer science; Datavetenskap; Datavetenskap;

    Sammanfattning : The need for efficient interference detection frequently arises in computer graphics, robotics, virtual prototyping, surgery simulation, computer games, and visualization. To prevent bodies passing directly through each other, the simulation system must be able to track touching or intersecting geometric primitives. LÄS MER

  4. 3. Efficient Algorithms for Graph-Theoretic and Geometric Problems

    Författare :Peter Floderus; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis studies several different algorithmic problems in graph theory and in geometry. The applications of the problems studied range from circuit design optimization to fast matrix multiplication. First, we study a graph-theoretical model of the so called ''firefighter problem''. LÄS MER

  5. 4. Bit loading and precoding for MIMO communication systems

    Författare :Svante Bergman; Björn Marklund; Tim Davidsson; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Telecommunication; Telekommunikation;

    Sammanfattning : This thesis considers the joint design of bit loading, precoding and receive filters for a multiple-input multiple-output (MIMO) digital communication system. Both the transmitter and the receiver are assumed to know the channel matrix perfectly. It is well known that, for linear MIMO transceivers, orthogonal transmission (i.e. LÄS MER