The invention relates to image processing systems. More particularly, the invention relates to a method for synthesizing faces of image objects.
With the ubiquity of new information technology and media, more effective and friendly human computer interaction (HCI) means that are not reliant on traditional devices, such as keyboards, mice, and displays, are being developed. In the last few years, face and facial expression recognition technologies have been receiving significant attention and many research demonstrations and commercial applications have been developed as a result. The reason for the increased interest is mainly due to the suitability of face and facial expression recognition technologies for a wide range of applications such as biometrics, information security, law enforcement and surveillance, smart cards and access control.
An initial step performed by a typical face recognition system is to detect locations in an image where faces are present. Although there are many other related problems of face detection such as face localization, facial feature detection, face identification, face authentication and facial expression recognition, face detection is still considered as one of the foremost problem to be tackled in respect of difficulty. Most existing face recognition systems typically employ a single two-dimension (2D) representation of the face of the human subject for inspection by the face recognition systems. However, face detection based on a 2D image is a challenging task because of variability in imaging conditions, image orientation, pose, presence or absence of facial artefacts, facial expression and occlusion.
In addition, existing face recognition systems are able to function satisfactorily only when both the training images and the actual image of the human subject to be inspected are captured under similar conditions. Furthermore, there is a requirement that training images captured under different conditions for each human subject are to be made available to the face recognition systems. However, this requirement is considered unrealistic since typically only a small number of training images are generally available for a human subject under deployment situations. Further efforts to address the shortcomings of existing face recognition systems deal with technologies for creation of three-dimensional (3D) models of a human subject's face based on a 2D digital photograph of the human subject. However, such technologies are inherently susceptible to errors since the computer is merely extrapolating a 3D model from a 2D photograph. In addition, such technologies are computationally intensive and hence might not be suitable for deployment in face recognition systems where speed and accuracy are essential for satisfactory performance.
Hence, in view of the foregoing problems, there affirms a need for a method for providing an improved means for performing face detection.
Embodiments of the invention disclosed herein provide a method for synthesizing a plurality of 2D face images of an image object based on a synthesized 3D head object of the image object.
In accordance with a first aspect of the invention, there is disclosed a method for synthesizing a representation of an image object. The method comprises providing an image of the image object in which the image is a two-dimensional (2D) representation of the image object. Further, the method comprises providing a three-dimensional (3D) mesh having a plurality of mesh reference points in which the plurality of mesh reference points are predefined. The method also comprises identifying a plurality of feature portions of the image object from the image and identifying a plurality of image reference points based on the plurality of feature portions of the image object. The plurality of image reference points has 3D coordinates. In addition, the method comprises at least one of manipulating and deforming the 3D mesh by compensating the plurality of mesh reference points accordingly towards the plurality of image reference points and mapping the image object onto the deformed 3D mesh to obtain a head object in which the head object is a 3D object. The synthesized image of the image object in at least one of an orientation and a position is obtainable from the head object positioned to the at least one of the orientation and the position.
In accordance with a second aspect of the invention, there is disclosed a device readable medium having stored therein a plurality of programming instructions, which when execute by a machine, the instructions cause the machine to provide an image of the image object in which the image is a two-dimensional (2D) representation of the image object. Further the instructions cause the machine to provide a three-dimensional (3D) mesh having a plurality of mesh reference points in which the plurality of mesh reference points are predefined. The instructions also cause the machine to identify a plurality of feature portions of the image object from the image and identify a plurality of image reference points based on the plurality of feature portions of the image object. The plurality of image reference points has 3D coordinates. In addition, the instructions cause the machine to at least one of manipulate and deform the 3D mesh by compensating the plurality of mesh reference points accordingly towards the plurality of image reference points and map the image object onto the deformed 3D mesh to obtain a head object in which the head object is a 3D object. The synthesized image of the image object in at least one of an orientation and a position is obtainable from the head object positioned to the at least one of the orientation and the position.
Embodiments of the invention are disclosed hereinafter with reference to the drawings, in which:
A method for synthesizing a plurality of 2D face images of an image object based on a synthesized 3D head object of the image object are described hereinafter for addressing the foregoing problems.
For purposes of brevity and clarity, the description of the invention is limited hereinafter to applications related to 2D face synthesis of image objects. This however does not preclude various embodiments of the invention from other applications of similar nature. The fundamental inventive principles of the embodiments of the invention are common throughout the various embodiments.
Exemplary embodiments of the invention described hereinafter are in accordance with
From the 2D image 100 of
The identified plurality of feature portions is then marked with a plurality of image reference points 404 using a feature extractor as shown in
Next, in order to improve the extraction resolution of the feature extractor around an image feature point (x, y), counter solutions around the region of the image feature point (x, y) are collected and the feature extractor is trained to reject the counter solutions. All extracted feature vectors (also known as positive samples) of a image feature point are then stored in a stack “A” while the feature vectors of counter solutions (also known as negative samples) are then stored in a corresponding stack “B”. This then produces a forty-eight dimensional feature vector and dimensionality reduction using principal component analysis (PCA) is then required. Thus, dimensionality reduction is performed for both the positive samples (PCA_A) and the negative samples (PCA_B).
The separability between the positive samples and the negative samples is optimized using linear discriminant analysis (LDA). The LDA computation of the positive samples is performed using the positive samples and negative samples as training sets. Two different sets, PCA_A(A) and PCA_A(B), are then created from the projection of the positive samples. The set PCA_A(A) is assigned as class “0” and the set PCA_A(B) is assigned as class “1”. The best linear discriminant is then defined using the fisher linear discriminant analysis on the basis of a two-class problem. The linear discriminant analysis of the set PCA_A(A) is obtained by computing LDA_A(PCA_A(A)) since a “0” value must be generated. Similarly, the linear discriminant analysis of the set PCA_A(B) is obtained by computing LDA_A(PCA_A(B)) since a “1” value must be generated. The separability threshold present between the two classes is then estimated.
Separately, LDA_B undergoes the same process as explained afore for LDA_A. However, instead of using the sets, PCA_A(A) and PCA_A(B), the sets PCA_B(A) and PCA_B(B) are used. Two scores are then obtained by subjecting an unknown feature vector, X, through the following two processes:
XPCA_A
LDA_A (1)
XPCA_B
LDA_B (2)
The feature vector, X, is preferably accepted by the process LDA_A(PCA_A(X)) and is preferably rejected by the process LDA_B(PCA_B(X)). The proposition is that two discriminant functions are defined for each class using a decision rule being based on the statistical distribution of the projected data:
f(x)=LDA—A(PCA—A(x)) (3)
g(x)=LDA—B(PCA—B(x)) (4)
Set “A” and set “B” are defined as the “feature” and “non-feature” training sets respectively. Further, four one-dimensional clusters are also defined: GA=g(A), FB=f(B), FA=f(A) and GB=f(b). The derivation of the mean,
Additionally, for a given vector Y, the projections of the vector Y using the two discriminant functions are obtained:
yf=f(Y) (5)
yg=g(Y) (6)
Further, let
The vector Y is then classified as class “A” or “B” according to the pseudo-code, which is expressed as:
Preferably, the plurality of image reference points 404 in 3D are correlated with and estimated from the feature portions of the face in 2D space by a pre-determined function. In addition, as shown in
The head pose of the human subject in the 2D image 100 is estimated prior to deformation of the 3D mesh 200. First, the 3D mesh 200 is rotated at an azimuth angle, and edges are extracted using an edge detection algorithm such as the Canny edge detector. 3D mesh-edge maps are then computed for the 3D mesh 200 for azimuth angles ranging from −90 degrees to +90 degrees, in increments of 5 degrees. Preferably, the 3D mesh-edge maps are computed only once and stored off-line in an image array.
To estimate the head pose in the 2D image 100, the edges of the 2D image 100 are extracted using the edge detection algorithm to obtain an image edge map (not shown) of the 2D image 100. Each of the 3D mesh-edge maps is compared to the image edge map to determine which pose results in the best overlap of the 3D mesh-edge maps. To compute the disparity between the 3D mesh-edge maps, the Euclidean distance-transform (DT) of the image edge map is computed. For each pixel in the image edge map, the DT process assigns a number that represents the distance between that pixel and the nearest non-zero pixel of the image edge map.
The value of the cost function, F, of each of the 3D mesh-edge maps is then computed. The cost function, F, which measures the disparity between the 3D mesh-edge maps and the image edge map is expressed as:
where AEM≅{(i, j):EM(i, j)=1} and N is the cardinality of set AEM (total number of nonzero pixels in the 3D mesh-edge map EM). F is the average distance-transform value at the nonzero pixels of the image edge map. The pose for which the corresponding 3D mesh-edge map results in the lowest value of F is the estimated head-pose for the 2D image 100.
Once the pose of the human subject in the 2D image 100 is known, the 3D mesh 200 undergoes global deformation for spatially and dimensionally registering the 3D mesh 200 to the 2D image 100. The deformation of the 3D mesh 200 is shown in
where (X, Y, Z) are the 3D coordinates of the vertices of the 3D mesh 200, and subscript “gb” denotes global deformation. The affine model appropriately stretches or shrinks the 3D mesh 200 along the X and Y axes and also takes into account the shearing occurring in the X-Y plane. The affine deformation parameters are obtained by minimizing the re-projection error of the first plurality of mesh reference points on the rotated deformed 3D mesh 200 and the corresponding 2D locations in the 2D image 100. The 2D projection (xf, yf) of the 3D feature points (Xf, Yf, Zf) on the deformed 3D mesh 200 is expressed as:
where R12 is the matrix containing the top two rows of the rotation matrix corresponding to the estimated head pose for the 2D image 100. By using the 3D coordinates of the plurality of image reference points, equation (9) can then be reformulated into a linear system of equations. The affine deformation parameters P=[a11, a12, a21, a22, b1, b2]T are then determinable by obtaining a least-squares (LS) solution of the linear system of equations. The 3D mesh 200 is globally deformed according to these parameters, thus ensuring that the 3D head object 600 created conforms with the approximate shape of the face of the human subject and the significant features are properly aligned. The 3D head object 600 is shown in
Once the 3D mesh 200 is adapted and deformed according to the 2D image 100, the texture of the human subject is extracted and mapped onto the 3D head object 600 for visualization. The 3D head object 600 with texture mapping being applied onto is then an approximate representation of the head object of the human subject in the 2D image 100. Lastly, a series of synthesized 2D images of the 3D head object 600 in various predefined orientations and poses in 3D space are captured for creating a database of synthesized 2D images 100 of the human subject. In addition, the 3D head object 600 is further manipulated such as viewing the 3D head object 600 in simulated lighting conditions with respect to different angles. The database then provides the basis for performing face recognition of the human subject under any conceivable conditions. Face recognition is typically performed within acceptable error tolerances of a face recognition system.
In the foregoing manner, a method for synthesizing a plurality of 2D face images of an image object based on a synthesized 3D head object of the image object is described according to embodiments of the invention for addressing at least one of the foregoing disadvantages. Although a few embodiments of the invention are disclosed, it will be apparent to one skilled in the art in view of this disclosure that numerous changes and/or modification can be made without departing from the spirit and scope of the invention.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/SG2008/000123 | 4/14/2008 | WO | 00 | 5/27/2011 |