Sciweavers

588 search results - page 9 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
CVPR
2004
IEEE
16 years 1 months ago
Inference of Multiple Subspaces from High-Dimensional Data and Application to Multibody Grouping
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...
Zhimin Fan, Jie Zhou, Ying Wu
110
Voted
ECCV
2006
Springer
16 years 1 months ago
A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
Jingyu Yan, Marc Pollefeys
90
Voted
ICML
2010
IEEE
15 years 22 days ago
Projection Penalties: Dimension Reduction without Loss
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...
Yi Zhang 0010, Jeff Schneider
TIT
1998
73views more  TIT 1998»
14 years 11 months ago
Subspace Subcodes of Reed-Solomon Codes
— In this paper we introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed–Solomon (SSRS) codes. An SSRS code is a subset of a par...
Masayuki Hattori, Robert J. McEliece, Gustave Solo...
CVPR
2008
IEEE
15 years 6 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira