688 search results - page 31 / 138 » Computing with subspaces |
TIP
2010
14 years 8 months ago
2010
—We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by su...
109
click to vote
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D lin...
111
click to vote
ICPP
2000
IEEE
15 years 2 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
AUTOMATICA
2005
14 years 9 months ago
2005
New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero i...