Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
The aim of this paper is to show that the supercover of an m-flat (i.e. a Euclidean affine subspace of dimension m) in Euclidean n-space is a discrete analytical object. The super...
Bayesian subspace analysis has been successfully applied in face recognition. However, it suffers from its operating on a whole face difference and using one global linear subspac...
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...