Sökning: "minimal solvers"

Visar resultat 1 - 5 av 16 avhandlingar innehållade orden minimal solvers.

1. 1. Computational Methods for Computer Vision : Minimal Solvers and Convex Relaxations

   Författare :Viktor Larsson; Mathematical Imaging Group; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Vision; Geometric Vision; minimal solvers; Convex relaxation; Pose estimation;

   Sammanfattning : Robust fitting of geometric models is a core problem in computer vision. The most common approach is to use a hypothesize-and-test framework, such as RANSAC. In these frameworks the model is estimated from as few measurements as possible, which minimizes the risk of selecting corrupted measurements. LÄS MER

3. 2. Robust Estimation of Motion Parameters and Scene Geometry : Minimal Solvers and Convexification of Regularisers for Low-Rank Approximation

   Författare :Marcus Valtonen Örnhag; Matematik LTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Vision; Visual Odometry; Simultaneous Localization and Mapping; minimal solvers; Convex relaxations; Structure from motion;

   Sammanfattning : In the dawning age of autonomous driving, accurate and robust tracking of vehicles is a quintessential part. This is inextricably linked with the problem of Simultaneous Localisation and Mapping (SLAM), in which one tries to determine the position of a vehicle relative to its surroundings without prior knowledge of them. LÄS MER

4. 3. Gröbner Basis Methods for Minimal Problems in Computer Vision

   Författare :Henrik Stewenius; Matematik LTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer vision; minimal problems; gröbner basis; Matematik; Teknik; Mathematics; Technological sciences;

   Sammanfattning : A method is presented for building solvers for classes of multivariate polynomial equations. The method is based on solving an analogous template problem over a finite field, and then using the elimination order established for this problem for the original class of problems. LÄS MER

5. 4. 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

7. 5. Numerical Methods for Geometric Vision: From Minimal to Large Scale Problems

   Författare :Martin Byröd; Matematik LTH; []
   Nyckelord :Minimal Problems; Bundle Adjustment; Computer Vision; Polynomial Equations;

   Sammanfattning : This thesis presents a number of results and algorithms for the numerical solution of problems in geometric computer vision. In geometric computer vision one tries to extract geometric information about the world and the observer from a sequence of images. LÄS MER