588 search results - page 27 / 118 » Computing the Dimension of Linear Subspaces |
ICIP
2000
IEEE
14 years 11 months ago
2000
IEEE
Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or...
ICCV
2003
IEEE
14 years 12 months ago
2003
IEEE
Previous works have demonstrated that the face recognition performance can be improved significantly in low dimensional linear subspaces. Conventionally, principal component analy...
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
ICPR
2000
IEEE
14 years 11 months ago
2000
IEEE
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap ...