Abstract:
The present invention relates to a method, device and storage medium for locating feature points on a human face. The method for locating feature points on a human face of the present invention comprises: preliminary locating of the position of a human face by combining human face detection with human eye matching, and acquiring preliminary locating information; according to the preliminary locating information, fitting feature points on the human face; and according to the fitting result, completing the locating of the feature points on the human face. The present invention has the beneficial effects that: by using human face detection and human eye matching at the same time, and incorporating at least one feature of an appearance model according to the preliminary locating information, the position information about a human face is more accurately located, and the location of the feature points on the human face is accurately accomplished.

Description:
TECHNICAL FIELD 
       [0001]    The present disclosure relates to the field of Internet technologies, especially to a method and device for locating human facial feature points and a storage medium. 
       TECHNICAL BACKGROUND 
       [0002]    The locating of key feature points on a human face is not only an essential issue in a human face recognition research, but also a fundamental issue in the fields of graphics and computer vision. The locating of human facial feature points is such a technology that human face detection is conducted on a video stream by adopting technologies such as a digital image processing technology and a pattern recognition technology and key feature points on the human face are accurately located and tracked, for the purpose of determining and researching shape information of major organs such as mouth through the located key feature points on the human face. 
         [0003]    The above locating is implemented by human face detecting technologies in an existing technical scheme, but a preliminary facial location located according to a result of human face detecting is not accurate enough in the prior art, resulting in that the locating of key feature points on the human face is not accurate enough, and hence the fitting of the key feature points on the human face is likely failed. In addition, an Active Shape Model (ASM) algorithm is adopted as a facial feature point fitting algorithm in the prior art, but the accuracy of the ASM algorithm is not high enough because only shape information is considered in the ASM algorithm. 
       SUMMARY 
       [0004]    The disclosure provides a method and device for locating human facial feature points and a storage medium, which are intended to solve problems of a failure in fitting key feature points on a human face and a low accuracy of the fitting which are caused in that locating of the key feature points on the human face is not accurate enough in the prior art. 
         [0005]    The disclosure is realized as follows. 
         [0006]    A method for locating human facial feature points, including: 
         [0007]    preliminarily locating a human face location by a face detecting technology in combination with an eye matching technology, and obtaining preliminary location information; 
         [0008]    fitting human facial feature points according to the preliminary location information; and 
         [0009]    accomplishing locating of the human facial feature points according to a result of the fitting. 
         [0010]    A technical scheme of another embodiment of the disclosure includes a device for locating human facial feature points, and the device includes a face detecting module, a feature point fitting module and a feature point locating module; where the face detecting module is configured to preliminarily locating for a location of a human face through a face detecting technology and an eye matching technology; the feature point fitting module is configured to fit human facial feature points according to the preliminary location information; and the feature point locating module is configured to accomplish the locating of the human facial feature points according to a result of the fitting. 
         [0011]    In addition, the disclosure further provides a storage medium including computer-executable instructions, and the computer-executable instructions are configured to execute a method for locating human facial feature points including: 
         [0012]    preliminarily locating a human face location by a face detecting technology in combination with an eye matching technology, and obtaining preliminary location information; 
         [0013]    fitting human facial feature points according to the preliminary location information; and 
         [0014]    accomplishing locating of the human facial feature points according to a result of the fitting. 
         [0015]    Technical schemes of the disclosure possess following advantages or beneficial effects. The method and device for locating human facial feature points and the storage medium according to the embodiments of the disclosure implement preliminary locating of a face location by the face detecting technology in combination with the eye matching technology, therefore the facial location information of the human face can be located more accurately compared with the case of using the face detecting technology only. And the human facial feature points are fitted by using an Inverse Compositional algorithm according to the preliminary location information in conjunction with grayscale features, gradient features, and edge and angular point features, so as to complete the accurate locating of the human facial feature points. Appearance models such as gradient values in directions of X axis and Y axis as well as edge and angular point features are added in the AAM, thus making the fitting of the human facial feature points more accurate and effectively alleviating a problem of an existing AAM that local minimization and poor anti-interference ability likely occurs in the process of fitting. 
     
    
     
       DESCRIPTION OF DRAWINGS 
         [0016]      FIG. 1  is a flow chart of a method for locating human facial feature points according to a first embodiment of the disclosure; 
           [0017]      FIG. 2  is a flow chart of a method for locating human facial feature points according to a second embodiment of the disclosure; 
           [0018]      FIG. 3  is a schematic diagram of an eye searching Region of Interest (ROI) of the method for locating human facial feature points according to an embodiment of the disclosure; 
           [0019]      FIG. 4  is a schematic diagram of label points of facial feature points of the method for locating human facial feature points according to an embodiment of the disclosure; 
           [0020]      FIG. 5  is a flow chart of modeling a facial feature point shape model in the method for locating human facial feature points according to an embodiment of the disclosure; and 
           [0021]      FIG. 6  is a schematic structural diagram showing a device for locating human facial feature points according to an embodiment of the disclosure. 
       
    
    
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
       [0022]    To make the purpose, the technical scheme and the advantage of the disclosure more clear, the disclosure is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the embodiments described here are only used for interpreting the disclosure instead of limiting the disclosure. 
         [0023]    Referring to  FIG. 1  which is a flow chart of a method for locating human facial feature points according to a first embodiment of the disclosure, the method for locating human facial feature points according to the first embodiment of the disclosure includes following steps. 
         [0024]    Step S 100 : preliminarily locating a human face location through a face detecting technology in connection with an eye matching technology. 
         [0025]    In Step S 100 , cascaded Harr feature classifiers are adopted in the present embodiment of the disclosure to detect a human face, so as to obtain preliminary location information and preliminary facial size information of the human face; further, an eye matching algorithm is used to match location information of both eyes, thus locating the human face location more accurately compared with the case where merely a face detecting method is used. 
         [0026]    Step S 110 : fitting human facial feature points according to the preliminary location information and at least one feature of the AAM. 
         [0027]    In Step S 110 , features of the AAM include features such as grayscale, gradient, edge and angular point; in the present embodiment of the disclosure, a combination of the AAM algorithm and multiple features such as grayscale values, gradient values in the directions of X axis and Y axis, edges and angular points is regarded as an appearance model of the AAM, thus the fitted locations of the human facial feature points are more accurate; in the present embodiment of the disclosure, the Inverse Compositional algorithm is adopted for the fitting of the human facial feature points. 
         [0028]    Step S 120 : accomplishing the locating of the human facial feature points according to a result of the fitting. 
         [0029]    In Step S 120 , an image of both eyes can be obtained according to locations of human facial feature points after the human facial feature points are located; in an image of a next frame, an eye searching ROI (a term in picture processing) in the image of the next frame is determined, and locations of both eyes in the current frame are obtained within the eye searching ROI by an image matching algorithm, with an image of both eyes in an image of a previous frame being used as a template. The eye searching ROI may be determined in such a way that: a center of the eye searching ROI overlaps with a center of an eye, and if eye_height and eye_width respectively represent a height and a width of an eye, and roi_height and roi_width respectively represent a height and a width of the eye searching ROI, then 
         [0000]      roi_height=αeye_height;
 
         [0000]      roi_width=βeye_width;
 
         [0030]    where α and β represent ROI size control factors, and in this technical scheme, α=3, and β=2. 
         [0031]    In the method for locating human facial feature points of the present embodiment of the disclosure, the face location is preliminarily located by the face detecting technology in combination with the eye matching technology, so that the facial location information can be located more accurately compared with the case of using the face detecting technology only. 
         [0032]    Referring to  FIG. 2  which is a flow chart of the method for locating human facial feature points according to a second embodiment in the disclosure, the method for locating human facial feature points according to the second embodiment in the disclosure includes following steps. 
         [0033]    Step S 200 : inputting a video, and obtaining corresponding facial image information in the video. 
         [0034]    Step S 210 : determining whether an eye is detected in an image of a previous frame, and if an eye is detected in an image of a previous frame, executing Step S 220 ; otherwise, executing Step S 240 . 
         [0035]    In Step S 210 , an eye matching algorithm is adopted for eye matching at the time of face detecting in the present embodiment of the disclosure, thus locating the facial location more accurately compared with the case of using the face detecting method only. 
         [0036]    Step S 220 : searching in the eye searching ROI (a term in picture processing), to match the preliminary location information of the eye. 
         [0037]    In Step S 220 , the eye searching ROI is determined in such a way that: a center of the eye searching ROI overlaps with a center of an eye, and if eye_height and eye_width respectively represent a height and a width of an eye, and roi_height and roi_width respectively represent a height and a width of the eye searching ROI, specifically referring to  FIG. 3  which is a schematic diagram of the eye searching ROI of the disclosure, where an image of a left eye is enclosed by a smaller frame and a left eye searching ROI is enclosed by a bigger frame outside of the smaller frame, then, 
         [0000]      roi_height=α·eye_height
 
         [0000]      roi_width=β·eye_width;
 
         [0038]    where α and β represent ROI size control factors, and in the present embodiment of the disclosure, α=3, and β=2; and the eye matching algorithm specifically includes that: if T(x, y) represents an image of an eye, I(x,y) represents an eye searching ROI, and R(x,y) represents a matching resultant image, then 
         [0000]    
       
         
           
             
               R 
                
               
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
             
             = 
             
               
                 
                   
                     ∑ 
                     
                       
                         x 
                         ′ 
                       
                       , 
                       
                         y 
                         ′ 
                       
                     
                     
                         
                     
                   
                    
                   
                       
                   
                    
                   
                     ( 
                     
                       
                         T 
                          
                         
                           ( 
                           
                             
                               x 
                               ′ 
                             
                             , 
                             
                               y 
                               ′ 
                             
                           
                           ) 
                         
                       
                       · 
                       
                         I 
                          
                         
                           ( 
                           
                             
                               x 
                               + 
                               
                                 x 
                                 ′ 
                               
                             
                             , 
                             
                               y 
                               + 
                               
                                 y 
                                 ′ 
                               
                             
                           
                           ) 
                         
                       
                     
                     ) 
                   
                 
                 
                   
                     
                       ∑ 
                       
                         
                           x 
                           ′ 
                         
                         , 
                         
                           y 
                           ′ 
                         
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         
                           T 
                            
                           
                             ( 
                             
                               
                                 x 
                                 ′ 
                               
                               , 
                               
                                 y 
                                 ′ 
                               
                             
                             ) 
                           
                         
                         2 
                       
                       · 
                       
                         
                           ∑ 
                           
                             
                               x 
                               ′ 
                             
                             , 
                             
                               y 
                               ′ 
                             
                           
                         
                          
                         
                           
                             I 
                              
                             
                               ( 
                               
                                 
                                   x 
                                   + 
                                   
                                     x 
                                     ′ 
                                   
                                 
                                 , 
                                 
                                   y 
                                   + 
                                   
                                     y 
                                     ′ 
                                   
                                 
                               
                               ) 
                             
                           
                           2 
                         
                       
                     
                   
                 
               
               . 
             
           
         
       
     
         [0039]    The matching resultant image R(x, y) is located at a best-matching location in the searching ROI I(x, y) and the eye image T(x,y) when the matching resultant image R(x,y) reaches its maximum value. 
         [0040]    Step S 230 : facial feature points are fitted by the AAM according to the preliminary location information of the eye, and executing Step S 260 . 
         [0041]    Step S 240 : detecting a human face and determining whether the human face is detected, and if the human face is detected, executing Step S 250 ; otherwise, executing Step S 200  again. 
         [0042]    In Step S 240 , cascaded Harr feature classifiers are adopted to detect the human face in the present embodiment of the disclosure, so as to obtain the preliminary location information and preliminary facial size information of the human face. 
         [0043]    Step S 250 : obtaining the preliminary location information (x, y) and the preliminary facial size information s of the human face, and fitting the facial feature points by the AAM according to the preliminary location information and the preliminary facial size information of the human face in conjunction with features such as grayscale values, gradient values in directions of X axis and Y axis of the preliminary location of the human face, edges and angular points. 
         [0044]    In Step S 250 , after the preliminary location information and the preliminary facial size information of the human face are obtained, features such as grayscale values, gradient values in directions of X axis and Y axis of the preliminary location of the human face, edges and angular points are combined as an appearance model of the AAM to fit the human facial feature points, thus making the fitted locations of the human facial feature points more accurate. The appearance model is a parameterized model, which is used for unified modeling of a shape and textures of a variable object through principal component analysis, and matching of an unknown object by using a two norm-minimizing strategy. The ASM of the human facial feature points may be represented by a vector S={x 1 , y 1  . . . x n , y n }, where x i , y i  represent a location coordinate of the i-th human facial feature point. In the present embodiment of the disclosure, 82 facial label points are adopted, specifically referring to  FIG. 4  which is a schematic diagram showing label points of the human facial feature points in the disclosure. In a training process of the AAM, a certain number of human facial expression images are collected, location coordinates of 82 human facial feature points are labeled manually as shown in  FIG. 4  so as to obtain a coordinate vector S=(x 1 , y 1 , x 2 , y 2  . . . x 82 , y 82 ) of the human facial feature points, a Procrustes algorithm is conducted on the coordinate vector of the human facial feature points for the purpose of geometrical alignment, and then the principal components analysis (PCA) based learning is performed based on the training data to obtain 
         [0000]    
       
         
           
             S 
             = 
             
               
                 S 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   m 
                 
                  
                 
                     
                 
                  
                 
                   
                     p 
                     i 
                   
                    
                   
                     S 
                     i 
                   
                 
               
             
           
         
       
     
         [0045]    where S 0  represents an average shape, S i  represents a PCA base of a shape, and p i  represents a factor of the PCA base. A vector S of the corresponding ASM can be obtained as long as the respective factors p i  are calculated in the process of fitting, specifically referring to  FIG. 5  which is a flow chart of modeling a facial feature point shape model in the disclosure. The modeling approach of the shape model of the human facial feature points in the disclosure includes following steps. 
         [0046]    Step S 251 : excising a mean for coordinate vectors of all facial feature points, and transferring the coordinate vectors to a centroidal coordinate system; 
         [0047]    Step S 252 : selecting a sample as an initial average shape, and calibrating a dimension of the initial average shape so that |  S |=1; 
         [0048]    Step S 253 : denoting the estimated initial average shape as  S   0 , and regarding  S   0  as a reference coordinate system; 
         [0049]    Step S 254 : calibrating coordinate vectors of feature points of all training samples onto the current average shape through affine transformation; 
         [0050]    Step S 255 : recalculating an average shape for all calibrated samples; 
         [0051]    Step S 256 : calibrating the current average shape onto  S   0 , obtaining |  S |=1; 
         [0052]    Step S 257 : determining whether the calibrated average shape is greater than a given threshold value, and if the calibrated average shape is greater than a given threshold value, executing Step S 254  again; otherwise, executing Step S 258 ; 
         [0053]    Step S 258 : conducting statistical shape modeling for aligned samples through a PCA approach, to obtain 
         [0000]    
       
         
           
             S 
             = 
             
               
                 S 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   m 
                 
                  
                 
                     
                 
                  
                 
                   
                     p 
                     i 
                   
                    
                   
                     
                       S 
                       i 
                     
                     . 
                   
                 
               
             
           
         
       
     
         [0054]    An AAM A is obtained by mapping points from a region surrounded by an ASM onto the average shape, where a piecewise affine mapping algorithm may be adopted for the mapping here; similarly, the PCA based learning may be conducted for the AAM, to obtain 
         [0000]    
       
         
           
             A 
             = 
             
               
                 A 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                     
                 
                  
                 
                   
                     λ 
                     i 
                   
                    
                   
                     A 
                     i 
                   
                 
               
             
           
         
       
     
         [0055]    where A 0  represents an average appearance, A i  represents a PCA base of the AAM, and λ i  represents a factor of the PCA base. 
         [0056]    A modeling approach of the AAM specifically includes: mapping each training sample into the average shape, and then respectively calculating three kinds of features including grayscale values, gradient values in directions of X axis and Y axis, and feature values of edges and angular points so as to form the AAM; where a grayscale value A gray  may be calculated in such a way that: if I(x,y) denotes a grayscale image of each sample mapped into the average shape, then a value of a grayscale appearance model is: 
         [0000]        A   gray ( x,y )= I ( x,y ) 
         [0057]    The gradient values in directions of X axis and Y axis may be calculated in such a way of: calculating gradient values in directions of X axis and Y axis by using a Sobel operator (which is one of operators in image processing, and is mainly used for edge detecting): 
         [0000]    
       
         
           
             
               
                 G 
                 x 
               
                
               
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
             
             = 
             
               
                 [ 
                 
                   
                     
                       
                         - 
                         1 
                       
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                   
                     
                       
                         - 
                         2 
                       
                     
                     
                       0 
                     
                     
                       2 
                     
                   
                   
                     
                       
                         - 
                         1 
                       
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               * 
               
                 I 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 G 
                 y 
               
                
               
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
             
             = 
             
               
                 [ 
                 
                   
                     
                       
                         - 
                         1 
                       
                     
                     
                       
                         - 
                         2 
                       
                     
                     
                       
                         - 
                         1 
                       
                     
                   
                   
                     
                       0 
                     
                     
                       0 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       2 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               * 
               
                 
                   I 
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
                 . 
               
             
           
         
       
     
         [0058]    Hence, values A dx  and A dy  of appearance models of gradient values in directions of X axis and Y axis can be obtained with following formulas: 
         [0000]        A   dx ( x,y )= G   x ( x,y ) 2 ; 
         [0000]        A   dy ( x,y )= G   y ( x,y ) 2 . 
         [0059]    The edge and angular point features A edge     —     and     —     corner  may be calculated in such a way that: after gradient values in directions of X axis and Y axis are obtained, assuming: 
         [0000]      Edge xy ( x,y )= G   x ( x,y )· G   x ( x,y );
 
         [0000]      Edge yy ( x,y )= G   y ( x,y )· G   y ( x,y );
 
         [0000]      Edge xy ( x,y )= G   x ( x,y )· G   y ( x,y );
 
         [0060]    then Edge xx (x, y), Edge yy (x, y), Edge xy (x, y) are respectively filtered by using a 3×3 Gaussian window to obtain: 
         [0000]    
       
         
           
             
               
                 
                   Edge 
                   xx 
                   ′ 
                 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                     
                       
                         2 
                       
                       
                         4 
                       
                       
                         2 
                       
                     
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                   
                   ] 
                 
                 * 
                 
                   
                     Edge 
                     xx 
                   
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
               
             
             ; 
           
         
       
       
         
           
             
               
                 
                   Edge 
                   yy 
                   ′ 
                 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                     
                       
                         2 
                       
                       
                         4 
                       
                       
                         2 
                       
                     
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                   
                   ] 
                 
                 * 
                 
                   
                     Edge 
                     yy 
                   
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
               
             
             ; 
           
         
       
       
         
           
             
               
                 
                   Edge 
                   xy 
                   ′ 
                 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                     
                       
                         2 
                       
                       
                         4 
                       
                       
                         2 
                       
                     
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                   
                   ] 
                 
                 * 
                 
                   
                     Edge 
                     xy 
                   
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
               
             
             ; 
           
         
       
     
         [0061]    and the edge and angular point features are calculated by the following formula: 
         [0000]        A   edge     —     and     —     corner ( x,y )=(Edge xx ′( x,y )+Edge yy ′( x,y )) 2 ·(Edge xx ′( x,y )·Edge yy ′( x,y )−Edge xy ′( x,y )·Edge xy ′( x,y ))
 
         [0062]    The features such as grayscale values, gradient values in directions of X axis and Y axis, and edges and angular points are not represented in the same scale, and therefore need to be normalized to the same scale after calculation. A Sigmoidal approach is selected for such normalization of feature values in the present embodiment of the disclosure specifically as follows: 
         [0000]        A   gray ′( x,y )= A   gray ( x,y )/( A   gray ( x,y )+    A   gray ( x,y )) ;
 
         [0000]        A   dx ′( x,y )= A   dx ( x,y )/( A   dx ( x,y )+    A   dx ( x,y )) ;
 
         [0000]        A   dy ′( x,y )= A   dy ( x,y )/( A   dy ( x,y )+    A   dy ( x,y )) ;
 
         [0000]        A   edge     —     and     —     corner ′( x,y )= A   edge     —     and     —     corner ( x,y )/( A   edge     —     and     —     corner ( x,y )+    A   edge     —     and     —     corner ( x,y )) ,
 
         [0063]    After the normalization, these three kinds of features including grayscale values, gradient values in directions of X axis and Y axis, and edges and angular points are all in the same scale, and each training sample corresponds to these three kinds of features and four feature values; after the AAM with four feature values is obtained, the PCA based learning results in: 
         [0000]    
       
         
           
             A 
             = 
             
               
                 A 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                     
                 
                  
                 
                   
                     λ 
                     i 
                   
                    
                   
                     
                       A 
                       i 
                     
                     . 
                   
                 
               
             
           
         
       
     
         [0064]    In an embodiment of the disclosure, an Inverse Compositional algorithm (which is a commonly used algorithm in the art) is adopted to fit the human facial feature points and specifically includes: transforming an input image I(x,y) according to four initial global affine transformation parameters q obtained by a face detecting algorithm or an eye matching algorithm, obtaining I(N(W(x|p)|q)), where W is defined as piecewise affine mapping from a basic shape S 0  to the current shape S, N represents two-dimension similarity transformation, and q represents a parameter of the similarity transformation, hence 
         [0000]    
       
         
           
             
               
                 N 
                  
                 
                   ( 
                   
                     x 
                     | 
                     q 
                   
                   ) 
                 
               
               = 
               
                 
                   
                     [ 
                     
                       
                         
                           
                             1 
                             + 
                             a 
                           
                         
                         
                           
                             - 
                             b 
                           
                         
                       
                       
                         
                           b 
                         
                         
                           
                             1 
                             + 
                             b 
                           
                         
                       
                     
                     ] 
                   
                    
                   
                     [ 
                     
                       
                         
                           x 
                         
                       
                       
                         
                           y 
                         
                       
                     
                     ] 
                   
                 
                 + 
                 
                   [ 
                   
                     
                       
                         
                           t 
                           x 
                         
                       
                     
                     
                       
                         
                           t 
                           y 
                         
                       
                     
                   
                   ] 
                 
               
             
             , 
           
         
       
     
         [0000]    where q=(a,b,t x , t y ) and may be obtained by calculating with the eye matching algorithm. Those three kinds of feature appearance models are calculated for transformed images to obtain A(I(N(W(x|p))|q)); an appearance model difference value A((N(W(x|p))|q))−A 0 (x) is calculated; and then (∇q, ∇p)=H −1 ΣSD T ·(A(I(N(W(x|p))|q))−A 0 (x)) is calculated; where H represents a Hessian matrix (which is a square matrix formed of second-order partial derivatives of a real-valued function whose independent variable is a vector), SD represents the steepest descent graph which is calculated by the following formulas in advance when models are trained: 
         [0000]    
       
         
           
             
               SD 
               = 
               
                 
                   
                     ∇ 
                     
                       A 
                       0 
                     
                   
                    
                   
                     
                       ∂ 
                       W 
                     
                     
                       ∂ 
                       p 
                     
                   
                 
                 - 
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     m 
                   
                    
                   
                       
                   
                    
                   
                     
                       [ 
                       
                         ∑ 
                         
                           
                             
                               A 
                               i 
                             
                             · 
                             
                               ∇ 
                               
                                 A 
                                 0 
                               
                             
                           
                            
                           
                             
                               ∂ 
                               W 
                             
                             
                               ∂ 
                               p 
                             
                           
                         
                       
                       ] 
                     
                      
                     
                       A 
                       i 
                     
                   
                 
               
             
             ; 
           
         
       
       
         
           
             H 
             = 
             
               ∑ 
               
                 
                   SD 
                   T 
                 
                 · 
                 
                   SD 
                   . 
                 
               
             
           
         
       
     
         [0065]    A shape parameter (N◯W)(x; q, p)←(N◯W)(x; q, p)◯(N◯W)(x; ∇q, ∇p) −1  is updated till ∥∇q,∇p∥&lt;ε. 
         [0066]    Step S 260 : determining whether the human facial feature points are fitted successfully, and if so, executing Step S 270 ; otherwise, executing Step S 200  again. 
         [0067]    Step S 270 : accomplishing the locating of the human facial feature points according to a result of the fitting, obtaining an eye image according to the human facial feature points, and matching, in the eye searching ROI, locations of both eyes in an image of a next frame by taking an eye image in the image of the previous frame as a template. 
         [0068]    In Step S 270 , an image of both eyes is obtained according to the locations of the human facial feature points, an eye searching ROI in the image of the next frame is determined, and locations of both eyes in the current frame are re-matched in the determined eye searching ROI by using the image matching algorithm and taking an eye image in an image of a previous frame as a template. 
         [0069]    In the method for locating human facial feature points according to the present embodiment of the disclosure, human facial feature points are fitted by using an Inverse Compositional algorithm according to the preliminary location information in conjunction with grayscale features, gradient features, and edge and angular point features, so as to complete accurate locating of the human facial feature points. Appearance models such as gradient values in directions of X axis and Y axis as well as edge and angular point features are added in the Active Appearance Model (AAM), thus making the fitting of the human facial feature points more accurate and effectively alleviating a problem of an existing AAM that local minimization and poor anti-interference ability likely occurs in the process of fitting. 
         [0070]    Referring to  FIG. 6  which is a schematic structural diagram showing a device for locating human facial feature points in the disclosure, and the device for locating human facial feature points in the disclosure includes a face detecting module, a feature point fitting module and a feature point locating module. The face detecting module is configured to preliminarily locate a location of a human face by a face detecting technology in combination with an eye matching technology, where cascaded Harr feature classifiers are adopted by the face detecting module to detect the human face so as to obtain preliminary location information (x, y) and preliminary facial size information s of the human face, and an eye matching algorithm is further adopted to match location information of both eyes, so that the human face position may be more accurately detected compared with the case of using a face detecting method only. The feature point fitting module is configured to fit the human facial feature points according to the preliminary location information in combination of an AAM, where the AAM includes features such as grayscale, gradient, edge and angular point. The feature point locating module is configured to accomplish the locating of the human facial feature points according to a result of the fitting. 
         [0071]    The face detecting module includes an eye detecting unit and a face detecting unit. 
         [0072]    The eye detecting unit is configured to determine whether an eye is detected from an image of a previous frame, and if an eye is detected from the image of the previous frame, search in the eye searching ROI (which is a term in picture processing) to match location information of the eye; otherwise, the face detecting unit detects the human face; as such, an eye matching algorithm is adopted for eye matching in addition to the face detecting in the present embodiment of the disclosure, thus the human face location may be located more accurately compared with the case of using the face detecting method only. The eye searching ROI may be determined in such a way that: a center of the eye searching ROI overlaps with a center of an eye, and if eye_height and eye_width respectively represent a height and a width of an eye, an roi_height and roi_width respectively represent a height and a width of an eye searching ROI, specifically referring to  FIG. 3  which is a schematic diagram of the eye searching ROI of the disclosure where an image of a left eye is enclosed by a smaller frame and a left eye searching ROI is enclosed by a big frame outside of the smaller frame, then, 
         [0000]      roi_height=αeye_height,
 
         [0000]      roi_width=βeye_width;
 
         [0073]    where α and β represent ROI size control factors, and in the present embodiment of the disclosure, α=3, and β=2; and the eye matching algorithm specifically includes that: if T(x,y) represents an eye image, I(x, y) represents a searching ROI, and R(x, y) represents a matching resultant image, hence 
         [0000]    
       
         
           
             
               R 
                
               
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
             
             = 
             
               
                 
                   
                     ∑ 
                     
                       
                         x 
                         ′ 
                       
                       , 
                       
                         y 
                         ′ 
                       
                     
                   
                    
                   
                       
                   
                    
                   
                     ( 
                     
                       
                         T 
                          
                         
                           ( 
                           
                             
                               x 
                               ′ 
                             
                             , 
                             
                               y 
                               ′ 
                             
                           
                           ) 
                         
                       
                        
                       • 
                        
                       
                           
                       
                        
                       
                         I 
                          
                         
                           ( 
                           
                             
                               x 
                               + 
                               
                                 x 
                                 ′ 
                               
                             
                             , 
                             
                               y 
                               + 
                               
                                 y 
                                 ′ 
                               
                             
                           
                           ) 
                         
                       
                     
                     ) 
                   
                 
                 
                   
                     
                       ∑ 
                       
                         
                           x 
                           ′ 
                         
                         , 
                         
                           y 
                           ′ 
                         
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         
                           T 
                            
                           
                             ( 
                             
                               
                                 x 
                                 ′ 
                               
                               , 
                               
                                 y 
                                 ′ 
                               
                             
                             ) 
                           
                         
                         2 
                       
                        
                       • 
                        
                       
                         
                           ∑ 
                           
                             
                               x 
                               ′ 
                             
                             , 
                             
                               y 
                               ′ 
                             
                           
                         
                          
                         
                             
                         
                          
                         
                           
                             I 
                              
                             
                               ( 
                               
                                 
                                   x 
                                   + 
                                   
                                     x 
                                     ′ 
                                   
                                 
                                 , 
                                 
                                   y 
                                   + 
                                   
                                     y 
                                     ′ 
                                   
                                 
                               
                               ) 
                             
                           
                           2 
                         
                       
                     
                   
                 
               
               . 
             
           
         
       
     
         [0074]    The matching resultant image R(x, y) is located at a best-matching location in the searching ROI I(x,y) and the eye image T(x,y) when the matching resultant image R (x, y) reaches its maximum value. 
         [0075]    The face detecting unit is configured to detect a human face and determine whether the human face is detected, and if the human face is detected, obtain the preliminary location information (x, y) and the preliminary facial size information s of the human face; otherwise, a video is inputted again; here, cascaded Harr feature classifiers are adopted for detecting the human face in an embodiment of the disclosure, so as to obtain preliminary location information and preliminary facial size information of the human face. 
         [0076]    The feature point fitting module includes an eye fitting unit, a face fitting unit and a fitting judgment unit. 
         [0077]    The eye fitting unit is configured to fit the facial feature points by the AAM according to the preliminary location information of the eye, and whether the fitting is successful is determined by the fitting judgment unit. 
         [0078]    The face fitting unit is configured to fit the facial feature points by the AAM according to the preliminary location information and the preliminary facial size information of the human face in conjunction with features such as grayscale values, gradient values in directions of X axis and Y axis of the preliminary location of the human face, and edges and angular points, and whether the fitting is successful is determined by the fitting judgment unit. As such, after the preliminary location information and the preliminary facial size information of the human face are obtained, features such as grayscale values, gradient values in directions of X axis and Y axis of the preliminary location of the human face, and edges and angular points are combined as an appearance model of the AAM, so as to implement the fitting of the human facial feature points, thus making the location obtained from the fitting of the human facial feature points more accurate. The ASM of the human facial feature points may be represented by a vector S={x 1 , y 1  . . . x n , y n }, the x i , y i  represent a location coordinate of the i-th human facial feature point. In the present embodiment of the disclosure, 82 facial label points are adopted, specifically referring to  FIG. 4  which is a schematic diagram showing label points of the human facial feature points in the disclosure. In a training process of the AAM, a certain number of facial expression images are collected, location coordinates of 82 human facial feature points are labeled manually as shown in  FIG. 4  so as to obtain a coordinate vector S=(x 1 , y 1 , x 2 , y 2  . . . x 82 , y 82 ) of the human facial feature points, a Procrustes algorithm is conducted on the coordinate vector of the human facial feature points for the purpose of geometrical alignment, and then the principal components analysis (PCA) based learning is performed based on the training data to obtain 
         [0000]    
       
         
           
             S 
             = 
             
               
                 S 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   m 
                 
                  
                 
                     
                 
                  
                 
                   
                     p 
                     i 
                   
                    
                   
                     S 
                     i 
                   
                 
               
             
           
         
       
     
         [0079]    where S 0  represents an average shape, S i  represents a PCA base of a shape, and p i  represents a factor of the PCA base. A vector S of a corresponding AAM can be obtained as long as the respective factors p i  are calculated in the process of fitting. The modeling approach of the shape model of the human facial feature points in the disclosure specifically includes: excising a mean for coordinate vectors of all facial feature points, and transferring the coordinate vectors to a centroidal coordinate system; selecting a sample as an initial average shape, and calibrating a dimension of the initial average shape so that |  S |=1; denoting the estimated initial average shape as  S   0 , and regarding  S   0  as a reference coordinate system; calibrating coordinate vectors of feature points of all training samples onto the current average shape through affine transformation; recalculating an average shape for all calibrated samples; calibrating the current average shape onto  S   0 , obtaining |  S |=1; determining whether the calibrated average shape is greater than a given threshold value, and if the calibrated average shape is greater than the given threshold value, calibrating coordinate vectors of feature points of all training samples through affine transformation again; otherwise, conducting statistical shape modeling for aligned samples through a PCA approach, to obtain 
         [0000]    
       
         
           
             S 
             = 
             
               
                 S 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   m 
                 
                  
                 
                     
                 
                  
                 
                   
                     p 
                     i 
                   
                    
                   
                     
                       S 
                       i 
                     
                     . 
                   
                 
               
             
           
         
       
     
         [0080]    An AAM A is obtained by mapping points from a region surrounded by an ASM onto the average shape, where a piecewise affine mapping algorithm may be adopted for the mapping here; similarly, the PCA based learning may be conducted for the AA M, to obtain 
         [0000]    
       
         
           
             A 
             = 
             
               
                 A 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                     
                 
                  
                 
                   
                     λ 
                     i 
                   
                    
                   
                     A 
                     i 
                   
                 
               
             
           
         
       
     
         [0081]    where A 0  represents an average appearance, A i  represents a PCA base of the AAM, and λ i  represents a factor of the PCA base. 
         [0082]    A modeling approach of the AAM specifically includes: mapping each training sample into the average shape, and then respectively calculating three kinds of features including grayscale values, gradient values in directions of X axis and Y axis, and feature values of edges and angular points so as to form the AAM; where a grayscale value A gray  may be calculated in such a way that: if I(x,y) denotes a grayscale image of each sample mapped into the average shape, then a value of a grayscale appearance model is: 
         [0000]        A   gray ( x,y )= I ( x,y ) 
         [0083]    The gradient values in directions of X axis and Y axis may be calculated in such a way of: calculating gradient values in directions of X axis and Y axis by using a Sobel operator (which is one of operators in image processing, and is mainly used for edge detecting): 
         [0000]    
       
         
           
             
               
                 G 
                 x 
               
                
               
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
             
             = 
             
               
                 [ 
                 
                   
                     
                       
                         - 
                         1 
                       
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                   
                     
                       
                         - 
                         2 
                       
                     
                     
                       0 
                     
                     
                       2 
                     
                   
                   
                     
                       
                         - 
                         1 
                       
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               * 
               
                 I 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 G 
                 y 
               
                
               
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
             
             = 
             
               
                 [ 
                 
                   
                     
                       
                         - 
                         1 
                       
                     
                     
                       
                         - 
                         2 
                       
                     
                     
                       
                         - 
                         1 
                       
                     
                   
                   
                     
                       0 
                     
                     
                       0 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       2 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               * 
               
                 
                   I 
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
                 . 
               
             
           
         
       
     
         [0084]    Hence, values A dx  and A dy  of appearance models of gradient values in directions of X axis and Y axis can be obtained with following formulas: 
         [0000]        A   dx ( x,y )= G   x ( x,y ) 2 ; 
         [0000]        A   dy ( x,y )= G   y ( x,y ) 2 . 
         [0085]    The edge and angular point features A edge     —     and     —     corner  may be calculated in such a way that: after gradient values in directions of X axis and Y axis are obtained, assuming: 
         [0000]      Edge xx ( x,y )= G   x ( x,y )· G   x ( x,y );
 
         [0000]      Edge yy ( x,y )= G   y ( x,y )· G   y ( x,y );
 
         [0000]      Edge xy ( x,y )= G   x ( x,y )· G   y ( x,y );
 
         [0086]    then Edge xx (x, y), Edge yy (x, y), Edge xy (x, y) are respectively filtered by using a 3×3 Gaussian window to obtain: 
         [0000]    
       
         
           
             
               
                 
                   Edge 
                   xx 
                   ′ 
                 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                     
                       
                         2 
                       
                       
                         4 
                       
                       
                         2 
                       
                     
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                   
                   ] 
                 
                 * 
                 
                   
                     Edge 
                     xx 
                   
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
               
             
             ; 
           
         
       
       
         
           
             
               
                 
                   Edge 
                   yy 
                   ′ 
                 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                     
                       
                         2 
                       
                       
                         4 
                       
                       
                         2 
                       
                     
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                   
                   ] 
                 
                 * 
                 
                   
                     Edge 
                     yy 
                   
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
               
             
             ; 
           
         
       
       
         
           
             
               
                 
                   Edge 
                   xy 
                   ′ 
                 
                  
                 
                   ( 
                   
                     x 
                     , 
                     y 
                   
                   ) 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                     
                       
                         2 
                       
                       
                         4 
                       
                       
                         2 
                       
                     
                     
                       
                         1 
                       
                       
                         2 
                       
                       
                         1 
                       
                     
                   
                   ] 
                 
                 * 
                 
                   
                     Edge 
                     xy 
                   
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
               
             
             ; 
           
         
       
     
         [0087]    and the edge and angular point features are calculated by the following formula: 
         [0000]        A   edge     —     and     —     corner ( x,y )=(Edge xx ′( x,y )+Edge yy ′( x,y )) 2 −2·(Edge xy ′( x,y )·Edge yy ( x,y )−Edge xy ′( x,y )·Edge xy ′( x,y )).
 
         [0088]    The features such as grayscale values, gradient values in directions of X axis and Y axis, and edges and angular points are not represented in the same scale, and therefore need to be normalized to the same scale after calculation. A Sigmoidal approach is selected for such normalization of feature values in the present embodiment of the disclosure specifically as follows: 
         [0000]        A   gray ′( x,y )= A   gray ( x,y )/( A   gray ( x,y )+    A   gray ( x,y )) ;
 
         [0000]        A   dx ′( x,y )= A   dx ( x,y )/( A   dx ( x,y )+    A   dx ( x,y )) ;
 
         [0000]        A   dy ′( x,y )= A   dy ( x,y )/( A   gray ( x,y )+    A   dy ( x,y )) ;
 
         [0000]        A   edge     —     and     —     corner ′( x,y )= A   edge     —     and     —     corner ( x,y )/( A   edge     —     and     —     corner ( x,y )+    A   edge     —     and     —     corner ( x,y )) .
 
         [0089]    After the normalization, these three kinds of features including grayscale values, gradient values in directions of X axis and Y axis, and edges and angular points are all in the same scale, and each training sample corresponds to these three kinds of features and four feature values; after the AAM with four feature values is obtained, the PCA based learning results in: 
         [0000]    
       
         
           
             A 
             = 
             
               
                 A 
                 0 
               
               + 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                     
                 
                  
                 
                   
                     λ 
                     i 
                   
                    
                   
                     
                       A 
                       i 
                     
                     . 
                   
                 
               
             
           
         
       
     
         [0090]    In an embodiment of the disclosure, an Inverse Compositional algorithm (which is a commonly used algorithm in the art) is adopted to fit the human facial feature points and specifically includes: transforming an input image I(x,y) according to four initial global affine transformation parameters q obtained by a face detecting algorithm or an eye matching algorithm, obtaining I(N(W(x|p)|q)), where W is defined as piecewise affine mapping from a basic shape S 0  to the current shape S, N represents two-dimension similarity transformation, and q represents a parameter of the similarity transformation, hence 
         [0000]    
       
         
           
             
               
                 N 
                  
                 
                   ( 
                   
                     x 
                     | 
                     q 
                   
                   ) 
                 
               
               = 
               
                 
                   
                     [ 
                     
                       
                         
                           
                             1 
                             + 
                             a 
                           
                         
                         
                           
                             - 
                             b 
                           
                         
                       
                       
                         
                           b 
                         
                         
                           
                             1 
                             + 
                             b 
                           
                         
                       
                     
                     ] 
                   
                    
                   
                     [ 
                     
                       
                         
                           x 
                         
                       
                       
                         
                           y 
                         
                       
                     
                     ] 
                   
                 
                 + 
                 
                   [ 
                   
                     
                       
                         
                           t 
                           x 
                         
                       
                     
                     
                       
                         
                           t 
                           y 
                         
                       
                     
                   
                   ] 
                 
               
             
             , 
           
         
       
     
         [0000]    where q=(a,b,t x , t y ) and may be obtained by calculating with the eye matching algorithm. Those three kinds of feature appearance models are calculated for transformed images to obtain A(I(N(W(x|p))|q)); an appearance model difference value A(I(N(W(x|p))|q))−A 0 (x) is calculated; and then (∇q,∇p)=H −1 ΣSD T ·(A(I(N(W(x|p))|q))−A 0 (x)) is calculated; where H represents a Hessian matrix (which is a square matrix formed of second-order partial derivatives of a real-valued function whose independent variable is a vector), SD represents the steepest descent graph which is calculated by the following formulas in advance when models are trained: 
         [0000]    
       
         
           
             
               SD 
               = 
               
                 
                   
                     ∇ 
                     
                       A 
                       0 
                     
                   
                    
                   
                     
                       ∂ 
                       W 
                     
                     
                       ∂ 
                       p 
                     
                   
                 
                 - 
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     m 
                   
                    
                   
                       
                   
                    
                   
                     
                       [ 
                       
                         ∑ 
                         
                           
                             
                               A 
                               i 
                             
                             · 
                             
                               ∇ 
                               
                                 A 
                                 0 
                               
                             
                           
                            
                           
                             
                               ∂ 
                               W 
                             
                             
                               ∂ 
                               p 
                             
                           
                         
                       
                       ] 
                     
                      
                     
                       A 
                       i 
                     
                   
                 
               
             
             ; 
           
         
       
       
         
           
             H 
             = 
             
               ∑ 
               
                 
                   SD 
                   T 
                 
                 · 
                 
                   SD 
                   . 
                 
               
             
           
         
       
     
         [0091]    A shape parameter (N◯W)(x; q, p)←(N◯W)(x; q, p)◯(N◯W)(x; ∇q, ∇p) −1  is updated till ∥(∇q,∇p)∥&lt;ε. 
         [0092]    The fitting judgment unit is configured to determine whether the human facial feature points are fitted successfully, and if so, the human facial feature points are located by the feature point locating module; otherwise, a video is inputted again. 
         [0093]    The feature point locating module is configured to accomplish the locating of the human facial feature points according to a result of the fitting, obtain an eye image according to the human facial feature points, and match, in the eye searching ROI, locations of both eyes in an image of a next frame by the eye detecting unit by taking an eye image in the image of the previous frame as a template. An image of both eyes can be obtained according to the locations of the human facial feature points, an eye searching ROI in the image of the next frame is determined, and locations of both eyes in the current frame are obtained in the determined eye searching ROI by using image matching algorithm and taking an eye image in an image of a previous frame as a template. 
         [0094]    Those of ordinary skills in the art would understand that all or part of steps for achieving the above embodiments may be accomplished through hardware, or through a program instructing corresponding hardware. The program may be stored in a computer-readable storage medium and is executable by at least one computer processor, so as to implement methods and flows shown in  FIG. 1 ,  FIG. 2  and  FIG. 5 . The above-mentioned storage medium may be a read-only memory, a disk or a compact disc and the like. 
         [0095]    The method and device for locating human facial feature points and the storage medium according to the embodiments of the disclosure implement preliminary locating of a face location by the face detecting technology in combination with the eye matching technology, therefore the facial location information of the human face can be located more accurately compared with the case of using the face detecting technology only. And the human facial feature points are fitted by using an Inverse Compositional algorithm according to the preliminary location information in conjunction with grayscale features, gradient features, and edge and angular point features, so as to complete the accurate locating of the human facial feature points. Appearance models such as gradient values in directions of X axis and Y axis as well as edge and angular point features are added in the AAM, thus making the fitting of the human facial feature points more accurate and effectively alleviating a problem of an existing AAM that local minimization and poor anti-interference ability likely occurs in the process of fitting. 
         [0096]    The preferred embodiments of the disclosure have been described as above, but are not intended to limit the disclosure. Any modifications, equivalent replacement or improvements within the spirit and principles of the disclosure fall within the protection scope of the disclosure.