Search for dissertations about: "Grassmann"

Found 5 swedish dissertations containing the word Grassmann.

  2. 1. Algorithms in data mining using matrix and tensor methods

    Author : Berkant Savas; Lars Eldén; Lieven De Lathauwer; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ; Numerical analysis; Numerisk analys;

    Abstract : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. READ MORE

  4. 2. Stochastic Modeling for Video Object Tracking and Online Learning: manifolds and particle filters

    Author : Zulfiqar Hasan Khan; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; anisotropic mean shift; online learning of reference object; covariance tracking; consensus point feature correspondences; Bayesian tracking; Gabor features; Visual object tracking; Grassmann manifold.; Riemannian manifold; particle filters;

    Abstract : Classical visual object tracking techniques provide effective methods when parameters of the underlying process lie in a vector space. However, various parameter spaces commonly occurring in visual tracking violate this assumption. READ MORE

  5. 3. Subspace Computations via Matrix Decompositions and Geometric Optimization

    Author : Lennart Simonsson; Axel Ruhe; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Numerical Analysis; Rank-revealing UTV; Jacobi-Davidson algorithm; Decomposition; Grassmann type algorithms; Numerical analysis; Numerisk analys;

    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

  6. 4. Derivation and BRST Quantization of Models for Spinning Relativistic Particles

    Author : Ulf Mårtensson; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This thesis deals with the construction of models for spinning relativistic particles and their covariant quantization within a BRST framework. In the first part the ideas and methods which constitute the background to the papers are reviewed, and a summary of the main results obtained therein is given. The second part consists of the papers. READ MORE

  7. 5. Projection Techniques for Classification and Identification

    Author : David Lindgren; Lennart Ljung; Linköpings universitet; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Abstract : It is very well understood how to evaluate and find, in different senses, optimal linear projections of measurements on linear systems. The solution to the linear least squares problem, the principal component analysis and partial least squares are all examples of well known techniques that work very well as long as the dependencies in data are fairly linear. READ MORE