53 search results - page 1 / 11 » Maximal Lattice-Free Convex Sets in Linear Subspaces |
MOR
2010
12 years 11 months ago
2010
SIAMDM
2011
12 years 11 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
ICCV
2001
IEEE
14 years 6 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...
ICCV
2009
IEEE
13 years 2 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
TIP
2010
13 years 3 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...