Sciweavers

588 search results - page 34 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
CVPR
2008
IEEE
15 years 1 days ago
Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories
We examine the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this motion segmentation pr...
René Vidal, Roberto Tron, Shankar Rao, Yi M...
ACII
2005
Springer
14 years 12 hour ago
A Novel Regularized Fisher Discriminant Method for Face Recognition Based on Subspace and Rank Lifting Scheme
The null space N(St) of total scatter matrix St contains no useful information for pattern classification. So, discarding the null space N(St) results in dimensionality reduction ...
Wen-Sheng Chen, Pong Chi Yuen, Jian Huang, Jian-Hu...
ICANN
2001
Springer
14 years 2 months ago
Product Unit Neural Networks with Constant Depth and Superlinear VC Dimension
Abstract. It has remained an open question whether there exist product unit networks with constant depth that have superlinear VC dimension. In this paper we give an answer by cons...
Michael Schmitt
SIAMMAX
2011
157views more  SIAMMAX 2011»
13 years 25 days ago
Deflated Restarting for Matrix Functions
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...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
IWPEC
2009
Springer
14 years 4 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
Panos Giannopoulos, Christian Knauer, Günter ...