Sciweavers

400 search results - page 44 / 80
» Subspace evasive sets
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Tighter bounds for random projections of manifolds
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
Kenneth L. Clarkson
ICPR
2006
IEEE
14 years 8 months ago
Adaptive Feature Integration for Segmentation of 3D Data by Unsupervised Density Estimation
In this paper, a novel unsupervised approach for the segmentation of unorganized 3D points sets is proposed. The method derives by the mean shift clustering paradigm devoted to se...
Marco Cristani, Umberto Castellani, Vittorio Murin...
CVPR
2009
IEEE
1351views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Support Vector Machines in Face Recognition with Occlusions
Support Vector Machines (SVM) are one of the most useful techniques in classification problems. One clear example is face recognition. However, SVM cannot be applied when the fe...
Aleix M. Martínez, Hongjun Jia
FGR
2008
IEEE
180views Biometrics» more  FGR 2008»
14 years 2 months ago
Image-set matching using a geodesic distance and cohort normalization
An image-set based face recognition algorithm is proposed that exploits the full geometrical interpretation of Canonical Correlation Analysis (CCA). CCA maximizes the correlation ...
Yui Man Lui, J. Ross Beveridge, Bruce A. Draper, M...
IJCV
2007
163views more  IJCV 2007»
13 years 7 months ago
Appearance Sampling of Real Objects for Variable Illumination
Abstract. The appearance of an object greatly changes under different lighting conditions. Even so, previous studies have demonstrated that the appearance of an object under varyin...
Imari Sato, Takahiro Okabe, Yoichi Sato