Abstract:
A method for accurately estimating a pose of the human head in natural scenes utilizing positions of the prominent facial features relative to the position of the head. A high-dimensional, randomly sparse representation of a human face, using a simplified facial feature model transforms a raw face image into sets of vectors representing the fits of the face to a random, sparse set of model configurations. The transformation collects salient features of the face image which are useful to estimate the pose, while suppressing irrelevant variations of face appearance. The relation between the sparse representation of the pose is learned using Support Vector Regression (SVR). The sparse representation, combined with the SVR learning is then used to estimate a pose of facial images.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS  
       [0001]     This application claims the benefit of U.S. Provisional Application No. 60/543,963 filed Feb. 12, 2004. 
     
    
     FIELD OF THE INVENTION  
       [0002]     This invention relates generally to the field of personal identification and in particular to a method of determining facial poses of the human head in natural scenes.  
       BACKGROUND OF THE INVENTION  
       [0003]     A hurdle encountered in human face recognition problems is how to deal with variations in facial images due to facial pose changes. Consequently, while limited desirable facial recognition results have been obtained with frontal facial images, recognition performance degrades quickly with variations in facial pose. Accordingly, accurate measurements of facial pose may facilitate facial recognition if some form of the measurement data, such as 3D models of the face or sampled facial images across pose(s)—which may generate the facial image—is available.  
         [0004]     Intuitively, the pose of an object can be estimated by comparing the positions of salient features of the object. For a human face, the positions, for example, of the eyes, eyebrows and mouth are usually visible and prominent. And while a global shape of the human face is highly variable from person to person according to age, gender, hairstyle, the size and shape of these facial features generally vary within predictable ranges. As a result, these and other features may be used to render distinct gradient signatures in images that are distinguishable from one another.  
         [0005]     Prior art methods of determining head pose estimation, while advantageously employing learning approaches, have met with limited success. In particular, a method disclosed by N. Kruger, M. Patzsch, and C. Van der Malsberg, in an article entitled “Determination of face position and pose with a learned representation based on labeled graphs”, which appeared in Image and Vision Computing, Vol. 15, pp. 665-673, 1997, performs the estimation of position and pose by matching the facial image to the learned representation of bunch graphs. In addition, a method disclosed by Y. Li, S. Gong, and H. Liddell in an article entitled “Support vector regression and classification based on multi-view face detection and recognition”, which was presented at FG2000, also employed Support Vector Regression (SVR) learning on the PCA subspace of the outputs from directional Sobel filters. Lastly, S. Li, J. Yan, X. W. Hou, Z. Y. Li and H. Zhang disclose a method utilizing two stages of the support vector learning, by first training an array of SVR&#39;s to produce desired output signatures, then training the mapping between the signatures and the facial poses, in “Learning Low Dimensional Invarient Signatures of 3-D Object under Varying View and Illumination from 2-D Appearances,” which appeared in ICCV 2001.  
         [0006]     Despite such progress, more efficient, expedient approaches are required. It is therefore the object of the present invention to provide a method of determining the pose of a human head in natural scenes such that our method may facilitate the development of human recognition systems.  
       SUMMARY OF THE INVENTION  
       [0007]     We have invented a sparse representation of the human face, which captures unique signatures of the human face while facilitating the estimation of head position and pose. The representation is a collection of projections to a number of randomly generated possible configurations of the face.  
         [0008]     According to an aspect of our invention, a projection corresponds to a pose of the head along with facial features&#39; configuration, which responds to changes in pose and feature configuration, while not responding to other variations such as lighting, hair and background. In a preferred embodiment, a representation includes two parts: 1) parameter vectors which encode both the position and pose of the head, along with shape and size of facial features and their “fits” to the facial image; and 2) a large number of randomly generated set (1)&#39;s. Weighting(s) of a given parameter vector are computed by first, predicting 2D signatures of the facial features corresponding to a given parameter; and second, computing a match between the 2D signature and the facial image.  
         [0009]     Advantageously, our inventive method includes particular attributes of well-understood particle filter approaches, which are known to efficiently solve tracking and motion estimation problems. The randomly generated motion parameter vectors along with the weights computed from image measurements permit the estimation and propagation of the probability density of the motion vector efficiently, even when state space is extremely high-dimensional. And while generating samples that uniformly cover the entire parameter range is not presently feasible—due to the dimensionality (28 dimensional space for the problem at hand)—we have found that only 500 samples were sufficient to represent the head shape for the pose estimation determination, when a reasonably good initial prediction (or a good initial density) is determined to estimate subsequent densities.  
         [0010]     Advantageously, the type and/or kind of filters that we use for picking up gradient responses from facial features, will correctly estimate the pose of the head when the random samples are generated in a region that is close to the true state in the parameter space. 
     
    
     BRIEF DESCRIPTION OF THE DRAWING  
       [0011]      FIG. 1  is a schematic representation of a rotational model of a head;  
         [0012]      FIG. 2  is a schematic representation of an ellipsoidal head model and parameterization of facial features;  
         [0013]      FIG. 3  is a graph showing a shape filter in which the shape is matched to a circular arc to detect eye outline and the cross-section is designed to detect the intensity change along the boundary;  
         [0014]      FIG. 5  is a set of estimated poses showing images having different poses ( 5 A- 5 D) and rendered images using the estimated poses ( 5 E-H);  
         [0015]      FIG. 6  and  FIG. 7  are graphs showing the error distribution for the estimates of  FIG. 5A-5D .  
         [0016]      FIG. 8  is a graph showing the cumulative distribution of both the yaw and pitch estimation.  
         [0017]      FIG. 9  and  FIG. 10  are graphs showing the estimated poses of the test data plotted against the ground truth (annotated) poses.  
         [0018]      FIG. 11 ( a - b ) is a flow diagram depicting the method of the present invention; and  
         [0019]      FIG. 12  is a block diagram of a computing platform suitable for practicing the inventive method according to the present invention.  
     
    
     DETAILED DESCRIPTION  
       [0020]     Sparse Representation of the Face and the Pose  
         [0021]     While the size and the shape of the human face varies within small ranges, it is hard to model the variety of appearance of the human head, or the face in real life due, in part, to changes in hair style or clothing. On the other hand, the facial elements such as eyes or mouth are usually exposed to view, and their sizes, shapes and relative positions vary within a relatively limited range. In addition, the appearance of such features usually does not vary much with different lighting conditions. As such, we can model the image projections of these features using simple curves on a 2D surface, and changes in their appearance due to pose changes can be modeled using the rotation of the surface.  FIG. 1  is a schematic representation for our rotational model of the human head.  
         [0022]     A. Head Model  
         [0023]     With reference now to that  FIG. 1 , we model the head as an ellipsoid in xyz space, with z being the camera axis. Represented mathematically:  
               E   ⁡     (     x   ,   y   ,   z     )       ⁢       =       E       R   x     ,     R   y     ,     R   z     ,     C   x     ,     C   y     ,     C   z     ,       ⁡     (     x   ,   y   ,   z     )                       ⁢       =   Δ     ⁢             (     x   -     C   x       )     2       R   x   2       +         (     y   -     C   y       )     2       R   y   2       +         (     z   -     C   z       )     2       R   z   2         =   1                 
 
         [0024]     We represent the pose of the head by three rotation angles (θ x ,θ y ,θ z ,); where θ x  and θ z  measure the rotation of the head axis n, and the rotation of the head around n, is denoted by θ y (=θ n ). The center of rotation is assumed to be near the bottom of the ellipsoid, denoted by a=(a x ,a y ,a z ), which is measured from (C x ,C y ,C z ) for convenience. And since the rotation of n and the rotation around it is commutative, we can think of any change of head pose as rotation around the y axis, followed by “tilting” of the axis.  
         [0025]     If we let Q x ,Q y , and Q z  be rotation matrices around the x, y, and z, respectively, and let p=(x′,y′,z′) be any point on the ellipsoid E R     x     ,R     y     ,R     z     ,C     x     ,C     y     ,C     z     , (x,y,z). Accordingly, p moves to p′=(x′,y′,z′) under rotation Q y  followed by rotations Q x  and Q z : 
 
 p′=Q   z Q x Q y ( p−t−a )+ a+t   [1]
 
         [0026]     Note that t=t (C     x     ,C     y     ,C     z     ) =(C x ,C y ,C z ) represents the position of the ellipsoid before rotation.  
         [0027]      FIG. 2  is a schematic of our ellipsoidal head model showing the parameterization of facial features. With reference to that  FIG. 2 , it is noted that the eyes and eyebrows are undoubtedly the most prominent features of the human face. The round curves made by the upper eyelid and the circular iris give unique signatures which are preserved under changes in illumination and facial expression. Features such as the eyebrows, mouth, and the bottom of the nose are also modeled as curves in the same manner.  
         [0028]     The feature curves are approximated by circles or circular arcs on the (head) ellipsoid. We parameterize the positions of these features by using the spherical coordinate system (azimuth, altitude) on the ellipsoid. A circle on the ellipsoid is given by the intersection of a sphere centered at a point on the ellipsoid with the ellipsoid itself. Typically, 28 parameters are used including 6 pose/location parameters.  
         [0029]     B. Computing the Projections of a Face Image  
         [0030]     We measure the model fit using a shape filter introduced by H. Moon, R. Chellappa, and A. Rosenfeld, in an article entitled “Optimal Shape Detection”, which appeared in ICIP, 2000. This filter is designed to accurately integrate the gradient response of the image element that forms a certain shape. In the given application, the filters are constructed to accumulate the edge response along the boundary of an eye, boundary of the eyebrows, etc. The filter is shaped so that the response is smooth with respect to the changes in the position and the shapes, between the model and the image data.  
         [0031]     An optimal one-dimensional smoothing operator, designed to minimize the sum of noise response power and step edge response error, is shown to be  
           g   σ     ⁡     (   t   )       =       1   σ     ⁢       exp   ⁡     (     -     |   t   |     /   σ         )       .           
 
 Then the shape operator for a given shape region D is defined by: 
 
 G ( x )= g   σ ( l ( x )) 
 
         [0032]     Where the level function/is implemented by:  
         l   ⁡     (   x   )       =     {             +     min   zεC       ∥     x   -   z     ∥     for   ⁢           ⁢   x   ⁢           ⁢   ε   ⁢           ⁢   D                   -     min   zεC       ∥     x   -   z     ∥     for   ⁢           ⁢   x   ⁢           ⁢   ε   ⁢           ⁢     D   c                     
 
         [0033]     With reference to  FIG. 3 , there is shown a shape operator (filter) for a circular arc feature, matched to an eye outline or eyebrow. Advantageously, the shape is matched to a circular arc to detect the eye outline, and the cross-section is designed to detect the intensity change along the boundary.  
         [0034]     The response of a local image/of an object to the operator G σ , having geometric configuration α is: 
 
 r   α   =ƒG   α ( u ) I ( u ) du  
 
         [0035]     Using this set of filters, the gradient information is computed bottom-up, from the raw intensity image.  
         [0036]     The kind of filters that we use for picking up gradient responses from facial features, will correctly estimate the pose of the head if the random samples are generated in a region that is close to the true state in the parameter space. When such initial estimates are not given, we preferably generate the random particles such that they span the wide range of parameter values to cover the correct value.  
         [0037]     Some of the particles, however, will pick up responses from irrelevant regions such as facial boundaries or the hair, and bias the estimates. We have found that the estimates using the weighted sum of the particles, are highly biased when some of the particles collect strong gradient response from the facial boundary.  
         [0038]     Such off-match responses, however, also provide useful information about the pose of the head. For example, if the “left-eye filter” yields very strong response when it is slightly moved (or “rotated”) to the right and keeps the level of response consistently when moved along the vertical direction, it is probable that the face is rotated to the left. This observation led us to make use of the whole set of representation that covers wide ranges of model parameters. The facial image will respond to the projections close to the true pose, and form a sharp peak, not necessarily a global maximum, around it. Other off-match projections could generate sufficient responses, yet the collective response will yield a different shape.  
         [0039]     C. Camera Model and Filter Construction  
         [0040]      FIG. 4 . shows a perspective projection model of the camera used in our inventive method. In operation, we combine the head model and camera model to compute the depth of each point on the face, so that we can compute the inverse projection and construct the corresponding operator. The center of the perspective projection is (0,0,0) and the image plane is defined as z=ƒ.  
         [0041]     With continued reference to that  FIG. 4 , we let P=(X,Y) be the projection of p′=(x′,y′,z′) on the ellipsoid. These two points are related by:  
               X   f     =           x   ′       z   ′       ⁢   and   ⁢     Y   f       =       y   ′       z   ′                 [   2   ]             
 
         [0042]     Given ξ=(C x ,C y ,C z ,θ x ,θ y ,θ z ,ν) the hypothetical geometric parameters of the head and feature (simply denoted by ν), we need to compute the inverse projection on the ellipsoid to construct the shape operator.  
         [0043]     Suppose the feature curve on the ellipsoid is the intersection (with the ellipsoid) of the circle ∥(x,y,z)−(e x   ξ ,e y   ξ , e z   ξ )∥ 2 =R e   ξ2 , centered at (e x   ξ ,e y   ξ , e z   ξ ) which is on the ellipsoid. Let P=(X,Y) be any point on the image. The inverse projection of P is the line defined by equation [2]. The point (x′,y′,z′) on the ellipsoid is computed by solving equation [2], combined with the quadratic equation E R     x     ,R     y     ,R     z     ,C     x     ,C     y     ,C     z   (x,y,z)=1. This solution exists and is unique, since we seek the solution on the visible side of the ellipsoid.  
         [0044]     The point (x,y,z) on the reference ellipsoid E 0,0,0,C     x     ,C     y     ,C     z     , (x,y,z)=1 is computed using the inverse operation of equation [1].  
         [0045]     If we define the mapping from (X,Y) to (x,y,z) by 
 
ρ( X,Y )         ( x,y,z )         (ρ x ( X,Y ),ρ y ( X,Y ),ρ z ( X, Y ))  [3]
 
 then we may construct the shape filter as: 
 
 h   ξ ( X,Y )= h   σ (∥(ρ( X,Y )−(e x   ξ ,e y   ξ ,e z   ξ )∥ 2   −R   e   ξ2 ) 
 
         [0046]     D. Generation of Samples and the Support Vector Regression  
         [0047]     A large number of samples {X n |n=1,2, . . . ,N} that represent the pose of the model and the position and shapes of the facial features are generated. Each vector X n  then constructs the set of shape filters that will compute the image responses: 
 
 R   n ={eye l   n , eye r   n , bro l   n , bro r   n , iris l   n , iris r   n , nose n , mouth n , head n };  [4]
 
 for each of the facial features, to the total of 9N dimensional projection, is computed. Note that a filter matched to the head boundary (to yield the response head n ) is also used to compare the relative positions of the features to the head. And while this form is apparently a linear transformation, we found that computing the magnitudes of the feature gradient responses (by taking the absolute values) produced better pose estimates. Therefore, we assume the absolute values of the responses in the expression of R n . 
 
         [0048]     Given a set of training images along with the pose: {(I m ,φ)|m=1,2, . . . ,M}, where φ may be θ x ,θ y , or θ z ; we apply the above procedure to each image to generate sparse representations {X m =(X m   n )n=1, . . . N|m=1,2, . . . ,M}. This linearly transformed features are then operated on by the Support Vector Regression (SVR) algorithm to train the relation between X m  and φ. Those skilled in the art will recognize that the SVR is a variant of known Support Vector Machines.  
         [0049]     Ultimately, the regression problem is to find a functional relation f from the sparse representation to the sine of the pose angles: 
 
ƒ φ   :X   m →φ, where φ=θ y  or θ x . 
 
         [0050]     E. Evaluation of Method on NEC Face Database  
         [0051]     The data set we have used for training and testing includes a large number of face images. Typically, they are natural images of faces representing a variety of ages, races, genders, and hair styles, taken under wide variations in lighting, background and resolution. The faces are cropped from the images and scaled, so that the center of the eyes are positioned at the center of a 128×128 image frame, and the distance from the eye center to the mouth is 20 pixels. The in-plane rotation is adjusted so that the nose line is vertical.  
         [0052]     The training set includes the filter responses X m  of 22508 faces to the random set of filters and the ground truth pose angles θ y  (yaw) and θ x  (pitch). The ground truth poses and the pixel coordinates of the eye center and the mouth center are manually annotated. The training set is “pose balanced” so that the training images cover the pose ranges evenly.  
         [0053]     This approach of aligning the face images at the eye center has advantages to the aligning the image at the head center. Since eyes (along with the combination with eyebrows) are the most prominent facial features and as such are, relatively, the easiest to detect and localize. Additionally, the eye center is generally a well-defined position on the face while a “head center”, is somewhat ambiguous.  
         [0054]     While there are numerous choices of nonlinear kernel functions that “bend” the regression hyperplane, we have determined that the Gaussian kernel is most suitable.  
         [0055]     The SVR algorithm determines an offset of the regression, and a subset of the training data, and the corresponding Lagrange multiplier from the constrained optimization problem. The support vectors, along with the Lagrange multipliers define the “regression manifold” that represent the pose estimation. Two separate trainings, one for the yaw estimation and the other for the pitch estimation, generate two sets of support vectors. The training for the yaw angles generated 15,366 support vectors and the training for the pitch angles generated 18,195 support vectors.  
         [0056]     We have tested the trained SVR to the dataset of 3,290 face images. The images in the test data do not contain any faces which appear in the training set. The testing set also covers wide ranges of lighting conditions and image quality.  
         [0057]     With reference to  FIG. 5 , there is shown some of the images ( 5 A- 5 D) and estimated poses ( 5 E- 5 H), where a 3D face model is used to render the faces having the estimated poses. The error distributions of each of the estimates are shown in  FIG. 6 . and  FIG. 7 . The cumulative distribution of both the yaw and pitch estimation is shown in  FIG. 8 .  
         [0058]     With continued reference now to that  FIG. 8 ., plotted therein is the percentage of the test faces, whose pose estimates (of both yaw and the pitch) have less than the given error level. For example, slightly more than ⅔ of the images have both yaw and pitch estimates within 10 degrees from the ground truth poses. At 20 degrees, around 93% of the faces have pose estimates within 20 degrees.  
         [0059]     Turning now to  FIG. 9  and  FIG. 10 , the estimated poses of the test data is plotted against the ground truth (annotated) poses). With reference to these Figs, one can see that our method shows limitations when the facial poses approach profiles (+90 or −90). Such a limitation may be expected as our head model is not able to model the feature shape(s) at such extreme (perpendicular) poses.  
         [0060]     Finally, with reference to Table 1, there is shown the performance of our method against the SVR pose estimation using raw images and the SVR pose estimate ion using histogram equalized images. The performance is compared using the mean absolute difference between the annotated pose and the estimated pose, of the 3,290 test images.  
         [0061]     With reference now to  FIG. 11 ( a ) there is shown a flowchart depicting an aspect of our inventive method. In particular,  FIG. 11 ( a ) depicts the training aspect of our invention. In particular, a sparse representation filter, SRF is constructed at step  1105 . This SRF, is applied to training images I α  to produce a set of images SRF(I α ) at step  1110 . Finally, the relation is trained on known poses at step  1120 , in which SRF(I α )→pose(I α ), thereby producing the facial pose, FP.  
         [0062]     After this training, and with reference now to  FIG. 11 ( b ), when given image J α , we compute the sparse representation, SR(J α ), at step  1150 . At step  1160 , we compute FP(SRF(J α ))=Pose(J α ), thereby producing Pose(J α ).  
         [0063]     Advantageously, our inventive method may be practiced on relatively inexpensive, readily available computing equipment. In particular, and with reference to  FIG. 12 , there is depicted a block diagram of such a computer for practicing our invention. In particular, Central Processing Unit (CPU)  1210 , is interconnected with and in communication with primary storage  1220  which may include semiconductor memory, secondary storage  1230 , and/or network interconnect  1240 . Input/Output subsystem  1250 , provides access to camera or other input device  1260 .  
                                           TABLE 1                           Comparison Among Pose Estimation Methods In Mean Absolute Error                Yaw Estimation Error   Pitch Estimation Error       Method   (deg)   (deg)                    Raw Image   12.27   6.00       Raw Image + Hist.Eq.   10.95   4.87       Sparse Representation   7.75   4.30                  
 
         [0064]     Of course, it will be understood by those skilled in the art that the foregoing is merely illustrative of the principles of this invention, and that various modifications can be made by those skilled in the art without departing from the scope and spirit of the invention. Accordingly, my invention is to be limited only by the scope of the claims attached hereto.