Sökning: "low-rank approximation"
Visar resultat 11 - 13 av 13 avhandlingar innehållade orden low-rank approximation.
11. Learning Multidimensional Signal Processing
Sammanfattning : The subject of this dissertation is to show how learning can be used for multidimensional signal processing, in particular computer vision. Learning is a wide concept, but it can generally be defined as a system’s change of behaviour in order to improve its performance in some sense. LÄS MER
12. Subspace Computations via Matrix Decompositions and Geometric Optimization
Sammanfattning : 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. LÄS MER
13. Parameter Estimation for Multisensor Signal Processing : Reduced Rank Regression, Array Processing and MIMO Communications
Sammanfattning : This thesis deals with three estimation problems motivated by spatial signal processing using arrays of sensors. All three problems are approached using tools from estimation theory, including asymptotical analysis of performance and Cramér-Rao lower bound; Monte Carlo methods are used to evaluate small sample performance. LÄS MER