The present invention relates to computer vision, and more particularly, to a face-tracking method with high accuracy.
Generally speaking, face-tracking refers to a computer vision technology that extracts the shapes of human faces in arbitrary digital images. It detects facial features and ignores anything else in surrounding, such as furniture or dogs. According to the related art, there are many conventional face tracking methods (e.g., snake, AAM, CLM . . . , etc.) based on face detection to detect face region and then set an initial shape (which is composed by feature points) inside the region, and the content of a given part in face region of an image is extracted to get features and then go fine tuning the face shape to fit features in the image face.
However, these methods may result in false shape extractions due to over/under face region detection or target-like background noises, and the following processes (e.g., the power saving application or the camera application) based on the face detection results would be affected by the false shape extractions. Therefore, there is a need for an innovative face-tracking scheme which is capable of extracting face shapes accurately.
The present invention provides a face-tracking method with high accuracy. The face-tracking method comprises generating an initial face shape according to a detected rectangle face region in an input image and a learned data base, wherein the initial face shape comprises an initial inner shape and an initial outer shape; generating a refined inner shape by refining the initial inner shape according to the features in the input image and the learned data base; and generating a refined outer shape by searching features composed by edges of the refined outer shape from the initial outer shape outward to limits of the defined possible outer shape.
These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.
a) is a diagram illustrating the face region of face detection result and initial inner shape of the face-tracking method with high accuracy according to an exemplary embodiment of the present invention.
b) is a diagram illustrating the refined inner shape of the face-tracking method with high accuracy according to an exemplary embodiment of the present invention.
The main concept of the present invention is to improve the face-tracking accuracy especially when the background of an image is complicated or messy. In such condition, the performance of conventional face-tracking methods will be deteriorated, especially at face border. However, the present invention proposes a face-tracking method for analyzing images (i.e., face shape border detection) from the inside of a face toward outside with a predetermined distance so as to avoid the background noise interference and improve the face-tracking accuracy.
Please refer to
Step 101: Receive an input image 202 (Refer to
Step 102: Generate an initial face shape according to the detected face region (the rectangle with dot line in
Step 103: Generate a refined inner shape 208 by refining the initial inner shape 204 in accordance with at least the input image 202 and the learned data base;
Step 104: Generate a refined outer shape by searching an edge of the refined outer shape from the initial outer shape toward the limit of outer shape.
In Step 101, the input image 202 can be a frame of a video, a picture, and so on. After the input image 202 is received in Step 101, Step 102 is executed to operate a face detection on the input image 202 to get a face region (the rectangle with dot line in
Si(θ)=sR(
wherein the initial face shape comprises at least the initial inner shape 204 and the initial outer shape, and (
It should be noted that in Step 102, the geometric factors s, R, t, and γ are just rough values and under no posture conditions, e.g. roll, yaw, or pitch. In other words, these geometric factors are not refined yet, and have to be refined through further fitting process. Consequently, the initial inner shape 204 and the initial outer shape are just rough results as well and need to be refined at the following Step 103. Moreover, the n feature points may have errors due to the difference between the generic face shape model of the learned data base and the real face shape in the input image 202.
In Step 103, some optimization algorithms are used to iteratively tune the initial shape to match the extracted features in real image face shape, and do not stop until some criteria are met. For better understanding of technical features of the present invention, one optimization algorithm to match an image (xi, yi) with model as mentioned above to find optimum θ and zi are described in equation (2):
However, this is for illustrative purposes only, and is not meant to be a limitation of the present invention. The optimization algorithms or schemes may be modified according to different optimization algorithms or schemes. As a person skilled in the art can readily understand details of the optimization methods described in equation (2), and further description is omitted here for brevity.
Please refer to
In general, since there is only skin around the inner face shape, and the background around the outer face shape may appear with some unexpected objects, the background around the outer face shape of the input image 202 is much more complicated than the background around the inner face shape. Considering the fact mentioned above, the present invention processes the refined inner shape 208 first, and then processes the refined outer shape or the whole face shape. In this way, the refined inner shape 208 would be generated stably and precisely. In Step 104, after inner shape has been extracted, an initial outer shape and many scan line segments may be set for searching correct outer shape (face border) from inside to outside direction from a face center.
Please refer to
Any object outside the line segments 306 would be ignored, hence the searching process may avoid identifying most of the undesired objects at background and the searching process would be efficient. For example, line segments can be defined as a n dimensions 2D image point pi(xi, yi) arrays ArrayPk[pi], i=0, 1, . . . , n−1 and k=0, 1, . . . , 16. Please note that this setting is initially under no posture (no roll, yaw and pitch) condition. The image coordinates of each point in the scan line segment arrays ArrayPk[pi] should be transformed to correct position before doing searching operation. For example, each point pi in ArrayPk[pi] may be transformed to (as equation (3)):
p′i=sRpi+t (3);
wherein s, R, t are the scaling factor, the Rotation matrix (composed by head roll, yaw and pitch) and the translation factor as defined in equation (1). Therefore, refined arrays of the scan line segment 306 for searching usage is ArrayPk[p′i]. According to the embodiment of the present invention, the searching process may be configured to a direct searching in the one dimensional refined arrays ArrayPk[p′i] of the scan line segment 306 in an in-to-out direction.
Firstly, the input image 202 is processed by any one well known edge detection method to get an ‘edge map’ for further processing, for example, the Sobel edge detection. However, this is for illustrative purposes only, and is not meant to be a limitation of the present invention. The edge detection method or scheme may be modified, wherein other methods may be employed according to different edge detection. Please refer to
In another embodiment of the present invention, a searching process is configured to be 2D directional searching along the refined arrays ArrayPk[p′i] of the scan line segment 306 with a 2D patch ‘edge detector’. Please refer to
After each maximum edge point pmax(i,k) has been found (if no edge found in some line segment, the maximum edge point in pmax(i,k) of the line segment would be omitted), one optimization algorithm similar to Equation (2) can be used to determine the refined outer shape. Equation (4) shows this optimization equation, where the shape (face border) generated from the searching process with total n maximum edge points (e.g., 17 points in this embodiment) is subtracted by predicted shape Sk(θ) from the learned data base and zk and θ are estimated by optimization and minimization process until some converge condition (stop criteria) met. Note that we only need take deformation parameters γ into account in θ (includes the scaling factor s, the rotation matrix (composed by roll, yaw and pitch) R, the translation factor t, and the deformation parameters γ, but not limited to) because the scaling factor s, the rotation matrix R, and the translation factor t are determined when we obtained the refined inner shape 208. In addition, some geometry constrains, for example, reflection symmetry with respect to the left face and the right face, can be imposed upon the optimization and minimization process to improve the fitting correctness as Equation (5).
.Assume center at (0,0,0), no rotation for (k=0; k<n/2; k++)
|[pmax(i,k);zk]−[pmax(i,n−k);zn−k]|<δ (5)
Wherein |.| denotes the distance between two points, δ is a threshold value.
It is an advantage of the present invention that the present invention method can provide an improved flow for face-tracking process. In addition, the improved flow for face-tracking process is suitable for various kinds of, where a traditional face-tacking or detection process can be altered with ease based upon the embodiments disclosed above, to prevent the related art problems.
Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
7218760 | Gu et al. | May 2007 | B2 |
7697736 | Kee et al. | Apr 2010 | B2 |
7706575 | Liu et al. | Apr 2010 | B2 |
8121347 | Metaxas et al. | Feb 2012 | B2 |
8582834 | Tong et al. | Nov 2013 | B2 |
8737697 | Morishita | May 2014 | B2 |
20100202696 | Usui et al. | Aug 2010 | A1 |
Number | Date | Country | |
---|---|---|---|
20130094768 A1 | Apr 2013 | US |
Number | Date | Country | |
---|---|---|---|
61547040 | Oct 2011 | US |