Search for dissertations about: "Convex relaxations"

Showing result 1 - 5 of 11 swedish dissertations containing the words Convex relaxations.

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

    Author : Viktor Larsson; Mathematical Imaging Group; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Vision; Geometric Vision; minimal solvers; Convex relaxation; Pose estimation;

    Abstract : 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. READ MORE

  4. 2. Rank Reduction with Convex Constraints

    Author : Christian Grussler; Institutionen för reglerteknik; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; low-rank approximation; model reduction; non-convex optimization; Douglas-Rachford; matrix completion; overlapping norm; k-support norm; atomic norm;

    Abstract : This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. READ MORE

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

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

    Abstract : 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. READ MORE

  6. 4. Convex Optimization for Assignment and Generalized Linear Regression Problems

    Author : Efthymios Tsakonas; Björn Ottersten; Ami Wiesel; KTH; []
    Keywords : ;

    Abstract : This thesis considers optimization techniques with applications in assignment and generalized linear regression problems. The first part of the thesis investigates the worst-case robust counterparts of combinatorial optimization problems with least squares (LS) cost functions, where the uncertainty lies on the linear transformation of the design variables. READ MORE

  7. 5. Sparse Modeling Heuristics for Parameter Estimation - Applications in Statistical Signal Processing

    Author : Stefan Ingi Adalbjörnsson; Matematisk statistik; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; parameter estimation; sparse models; convex optimization; fundamental frequency; inharmonicity; audio localization; symbolic periodicity; alternating directions method of multipliers; N-dimensional decaying sinusoids.;

    Abstract : This thesis examines sparse statistical modeling on a range of applications in audio modeling, audio localizations, DNA sequencing, and spectroscopy. In the examined cases, the resulting estimation problems are computationally cumbersome, both as one often suffers from a lack of model order knowledge for this form of problems, but also due to the high dimensionality of the parameter spaces, which typically also yield optimization problems with numerous local minima. READ MORE