14 search results - page 2 / 3 » Biometrics of Cut Tree Faces |
SIAMDM
2008
13 years 4 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
FGR
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper, a novel sparse feature set is introduced into the Adaboost learning framework for multi-view face detection (MVFD), and a learning algorithm based on heuristic sear...
WEA
2010
Springer
13 years 11 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
ICB
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In this paper, we target at face gender classification on consumer images in a multiethnic environment. The consumer images are much more challenging, since the faces cap...
FGR
2006
IEEE
13 years 10 months ago
2006
IEEE
While there has been a great deal of research in face detection and recognition, there has been very limited work on identifying the expression on a face. Many current face detect...