Sökning: "minimal problems"

Visar resultat 6 - 10 av 165 avhandlingar innehållade orden minimal problems.

  1. 6. Minimal Problems and Applications in TOA and TDOA Localization

    Författare :Simon Burgess; Mathematical Imaging Group; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Calibration-Free Localization; TOA; TDOA; RSSI Localization;

    Sammanfattning : The central problem of this thesis is locating several sources and simultaneously locating the positions of the sensors. The measurements captured by the sensors are time of arrival (TOA), time difference of arrival (TDOA), unsynchronized TDOA, or received signal strength indication (RSSI), all a variation of distance measurement between sensors and sources. LÄS MER

  3. 7. Approximation of topology optimization problems using sizing optimization problems

    Författare :Anton Evgrafov; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; structural optimization; bilevel programming; approximation; topology optimization; control in coefficients; optimal design; fictitious domain; control in coefficients;

    Sammanfattning : The present work is devoted to approximation techniques for singular extremal problems arising from optimal design problems in structural and fluid mechanics. The thesis consists of an introductory part and four independent papers, which however are united by the common idea of approximation and the related application areas. LÄS MER

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

  5. 9. Mathematical Methods for Image Based Localization

    Författare :Klas Josephson; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Multiple View Geometry; Image Based Localization; Computer Vision; Gröbner Basis; Minimal Problems;

    Sammanfattning : The underlying question in localization is, where am I? In this thesis a purely image based approach is proposed to solve this problem. In order to create a complete image based system, there are many subproblems that have to be addressed. The localization problem can also be solved in other ways, for example, with a GPS. LÄS MER

  7. 10. Planning for a Class of Sequential Control Problems

    Författare :Inger Klein; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Sequential control problems;

    Sammanfattning : Sequential control is probably the most common control problem in industry. Despite its importance, fairly little theoretical research has been devoted to this problem, and practical problems are typically solved by ad hoc methods, sometimes quite time-consuming.Sequential control is really a planning problem. LÄS MER