Results 151 to 160 of about 13,308,039 (193)
Some of the next articles are maybe not open access.

Subspace methods for robot vision

IEEE Transactions on Robotics and Automation, 1996
In contrast to the traditional approach, visual recognition is formulated as one of matching appearance rather than shape. For any given robot vision task, all possible appearance variations define its visual workspace. A set of images is obtained by coarsely sampling the workspace.
Shree K. Nayar   +2 more
openaire   +2 more sources

Nonstationary Consistency of Subspace Methods

IEEE Transactions on Automatic Control, 2007
In this paper, we study ldquononstationary consistencyrdquo of subspace methods for eigenstructure identification, i.e., the ability of subspace algorithms to converge to the true eigenstructure despite nonstationarities in the excitation and measurement noises. Note that such nonstationarities may result in having time-varying zeros for the underlying
Albert Benveniste, Laurent Mevel
openaire   +2 more sources

Subspace methods for computational relighting

SPIE Proceedings, 2013
We propose a vector space approach for relighting a Lambertian convex object with distant light source, whose crucial task is the decomposition of the reflectance function into albedos (or reflection coefficients) and lightings based on a set of images of the same object and its 3-D model.
Ha Q. Nguyen 0001   +2 more
openaire   +2 more sources

From the Subspace Methods to the Mutual Subspace Method

2010
The Subspace Method [25, 21] is a classic method of pattern recognition, and has been applied to various tasks. The Mutual Subspace Method [19] is an extension of the Subspace Methods, in which canonical angles (principal angles) between two subspaces are used to define similarity between two patterns (or two sets of patterns). The method is applied to
openaire   +1 more source

The subspace method in Hilbert space

Systems and Computers in Japan, 2001
AbstractThe subspace method has usually been applied to a multidimensional space (i.e., feature space) which uses features as its basis. A subspace method can also be applied to a functional space, since the subspace can be defined by an arbitrary linear space. This paper proposes the mapping of a feature space onto the Hilbert subspace so that pattern
openaire   +1 more source

On Moment Methods in Krylov Subspaces

Doklady Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Krylov Subspace Method for Information Retrieval

SIAM Journal on Matrix Analysis and Applications, 2004
A new algorithm for information retrieval is described. It is a vector space method with automatic query expansion. The original user query is projected onto a Krylov subspace generated by the query and the term-document matrix. Each dimension of the Krylov space is generated by a simple vector space search, using first the user query and then new ...
Katarina Blom, Axel Ruhe
openaire   +2 more sources

Spectral Variants of Krylov Subspace Methods

Numerical Algorithms, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BrĂ­gida Molina, Marcos Raydan
openaire   +2 more sources

From Subspace to Submanifold Methods

Procedings of the British Machine Vision Conference 2004, 2004
Twenty years ago it was not obvious that subspace approximations would be such a successful representation for faces and other phenomena whose measurement-space manifolds exhibit clear nonlinearities. Now PCA is ubiquitous in computer vision and, although its globally linear view of the data manifold can be a liability as systems scale up, it is not ...
openaire   +1 more source

Admissible subspaces and the subspace iteration method

BIT Numerical Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy