Sciweavers

688 search results - page 129 / 138
» Computing with subspaces
Sort
View
RT
2005
Springer
14 years 26 days ago
Estimation of 3D Faces and Illumination from Single Photographs Using A Bilinear Illumination Model
3D Face modeling is still one of the biggest challenges in computer graphics. In this paper we present a novel framework that acquires the 3D shape, texture, pose and illumination...
Jinho Lee, Hanspeter Pfister, Baback Moghaddam, Ra...
ECCV
2004
Springer
14 years 24 days ago
Pose Invariant Face Recognition Under Arbitrary Unknown Lighting Using Spherical Harmonics
Abstract. We propose a new method for face recognition under arbitrary pose and illumination conditions, which requires only one training image per subject. Furthermore, no limitat...
Lei Zhang 0002, Dimitris Samaras
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CVPR
2012
IEEE
11 years 9 months ago
Geodesic flow kernel for unsupervised domain adaptation
In real-world applications of visual recognition, many factors—such as pose, illumination, or image quality—can cause a significant mismatch between the source domain on whic...
Boqing Gong, Yuan Shi, Fei Sha, Kristen Grauman
DCG
2006
110views more  DCG 2006»
13 years 7 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho