Search for dissertations about: "Low-rank Matrix Factorization"
Found 3 swedish dissertations containing the words Low-rank Matrix Factorization.
-
1. Low Rank Matrix Factorization and Relative Pose Problems in Computer Vision
Abstract : This thesis is focused on geometric computer vision problems. The first part of the thesis aims at solving one fundamental problem, namely low-rank matrix factorization. We provide several novel insights into the problem. In brief, we characterize, generate, parametrize and solve the minimal problems associated with low-rank matrix factorization. READ MORE
-
2. Bayesian methods for sparse and low-rank matrix problems
Abstract : Many scientific and engineering problems require us to process measurements and data in order to extract information. Since we base decisions on information,it is important to design accurate and efficient processing algorithms. This is often done by modeling the signal of interest and the noise in the problem. READ MORE
-
3. Subspace Computations via Matrix Decompositions and Geometric Optimization
Abstract : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. READ MORE
