# Patent

## Title
Method and apparatus for obtaining and processing Gabor image features

## Abstract

Machine-readable media, methods, apparatus and system for obtaining and processing image features are described. In some embodiments, a Gabor representation of an image may be obtained by using a Gabor filter. A region may be determined from the Gabor representation, wherein the region comprises a plurality of Gabor pixels of the Gabor representation; and, a sub-region may be determined from the region, wherein the sub-region comprises more than one of the plurality of Gabor pixels. Then, a Gabor feature may be calculated based upon a magnitude calculation related to the sub-region and the region.

## Background
CROSS-REFERENCE TO RELATED APPLICATION
The present application claims the benefit of U.S. patent application Ser. No. 11/961,659 filed on Dec. 20, 2007, entitled “Method And Apparatus For Obtaining And Processing Image Features,” the entire content of which is incorporated by reference herein.
BACKGROUND
Image recognition (e.g., face recognition) has been widely used in various applications and fields such as security applications and research fields. Image representation becomes a key for a successful recognition. Many researches have been focused on this. Among them, Gabor filters based representation has achieved significant success in image recognition. As a multi-scale and multi-orientation representation, raw Gabor features are of high dimensionality. Several technologies are proposed to solve this problem, such as Elastic bunch graph matching, local binary pattern, and local Gabor binary pattern histogram sequence.



BRIEF DESCRIPTION OF THE DRAWINGS
The invention described herein is illustrated by way of example and not by way of limitation in the accompanying figures. For simplicity and clarity of illustration, elements illustrated in the figures are not necessarily drawn to scale. For example, the dimensions of some elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference labels have been repeated among the figures to indicate corresponding or analogous elements.
FIG. 1 illustrates an embodiment of an apparatus for obtaining refined Gabor features;
FIG. 2a illustrates an embodiment of a wave-front method for region selection.
FIG. 2b illustrates an embodiment of a local-region method for the region selection.
FIG. 3 illustrates a sub-region selection with reference to a Haar-pattern and an extended Haar pattern;
FIG. 4 illustrates an embodiment of an integral image.
FIG. 5 illustrates an apparatus for obtaining and processing image features.
FIG. 6 illustrates an embodiment of a method of obtaining the refined Gabor features.
FIG. 7 illustrates an embodiment of a method of obtaining and processing the image features.
FIG. 8 illustrates an embodiment of a computing platform.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
The following description describes techniques for obtaining and processing image features. In the following description, numerous specific details such as logic implementations, pseudo-code, means to specify operands, resource partitioning/sharing/duplication implementations, types and interrelationships of system components, and logic partitioning/integration choices are set forth in order to provide a more thorough understanding of the current invention. However, the invention may be practiced without such specific details. In other instances, control structures, gate level circuits and full software instruction sequences have not been shown in detail in order not to obscure the invention. Those of ordinary skill in the art, with the included descriptions, will be able to implement appropriate functionality without undue experimentation.
References in the specification to “one embodiment”, “an embodiment”, “an example embodiment”, etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.
Embodiments of the invention may be implemented in hardware, firmware, software, or any combination thereof. Embodiments of the invention may also be implemented as instructions stored on a machine-readable medium that may be read and executed by one or more processors. A machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computing device). For example, a machine-readable medium may include read only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.) and others.
FIG. 1 shows an embodiment of an apparatus of obtaining refined Gabor features. As shown, the apparatus may comprise a Gabor filter 101, a region logic 102, a sub-region logic 103, a feature calculating logic 104 and an integral logic 105.
Gabor filter 101 may receive an image (e.g., a face image) and produce a Gabor representation of the image. In an embodiment, a 2D Gabor filter may be defined as follows:




  
    
      
        
          
            Ψ
            ⁡
            
              (
              
                z
                ,
                
                  σ
                  s
                
                ,
                
                  θ
                  o
                
              
              )
            
          
          =
          
            
              1
              
                2
                ⁢
                
                  πσ
                  s
                  2
                
              
            
            ⁢
            exp
            ⁢
            
              
                {
                
                  -
                  
                    
                      
                        
                        z
                        
                      
                      2
                    
                    
                      2
                      ⁢
                      
                        σ
                        s
                        2
                      
                    
                  
                
                }
              
              ⁡
              
                [
                
                  
                    exp
                    ⁢
                    
                      {
                      
                        j
                        ⁢
                        
                          
                        
                        ⁢
                        
                          x
                          ′
                        
                        ⁢
                        
                          κ
                          /
                          
                            σ
                            s
                          
                        
                      
                      }
                    
                  
                  -
                  
                    exp
                    ⁢
                    
                      {
                      
                        
                          -
                          
                            κ
                            2
                          
                        
                        /
                        2
                      
                      }
                    
                  
                
                ]
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            z
            =
            
              (
              
                
                  x
                  ′
                
                ,
                
                  y
                  ′
                
              
              )
            
          
          ,
          
            

          
          ⁢
          
            {
            
              
                
                  
                    
                      x
                      ′
                    
                    =
                    
                      
                        x
                        ⁢
                        
                          
                        
                        ⁢
                        cos
                        ⁢
                        
                          
                        
                        ⁢
                        
                          θ
                          o
                        
                      
                      +
                      
                        y
                        ⁢
                        
                          
                        
                        ⁢
                        sin
                        ⁢
                        
                          
                        
                        ⁢
                        
                          θ
                          o
                        
                      
                    
                  
                
              
              
                
                  
                    
                      x
                      ′
                    
                    =
                    
                      
                        
                          -
                          x
                        
                        ⁢
                        
                          
                        
                        ⁢
                        cos
                        ⁢
                        
                          
                        
                        ⁢
                        
                          θ
                          o
                        
                      
                      +
                      
                        y
                        ⁢
                        
                          
                        
                        ⁢
                        sin
                        ⁢
                        
                          
                        
                        ⁢
                        
                          θ
                          o
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where x, y may represent a pixel position in a spatial domain, κ may represent a parameter for a bandwidth of Gabor filter 101, θo may represent an angle of Gabor filter 101 on the o-th orientation, and σs are the Gaussian deviation on the s-th scale, which is proportion to a wavelength of Gabor filter 101.

The Gabor representation of the image may be derived by convolving the image with the above definition of Gabor filter 101 as follows:

Gs,o(x, y)=I(x, y)ψ(x, y, σs, θo)  (2)

where Gs,o(x,y) may represent the Gabor representation of the image derived from Gabor filter 101 on the s-th scale and the o-th orientation, I(x,y) may represent the image.

Although the 2D Gabor transform is described above, it should be appreciated that other Gabor transforms can also be used, such as Log-Gabor transform.
Region logic 102 may select a region from the Gabor representation obtained by Gabor filter 101. The selected region may comprise some of Gabor pixels of the Gabor representation. Various methods may be applied for the region selection, for example, a wave-front method (referring to FIG. 2a) and a local-region method (referring to FIG. 2b).
Sub-region logic 103 may select a sub-region from the region selected by region logic 103. The sub-region may comprise more than one Gabor pixels of the region. In an embodiment, the sub-region may be selected with reference to a Haar-pattern and/or an extended Haar-pattern. FIG. 3 illustrates an embodiment of the Haar-pattern and the extended Haar-pattern. In FIG. 3, the outer rectangular may represent the region, and the shadowed region may represent the sub-region.
The first four patterns are the basic Haar-patterns, and the rest are the extended Haar-patterns. It should be appreciated that although six sub-region patterns are illustrated, the sub-region may be selected in other patterns.
Feature calculating logic 104 may calculate refined Gabor features based upon a magnitude calculation related to the region and the sub-regions. In an embodiment, feature calculating logic 104 may calculate magnitude sums for the Gabor pixels in the sub-regions and a magnitude sum for the Gabor pixels in the region, and then obtain the refined Gabor features by dividing the magnitude sums related to the sub-regions by the magnitude sum related to the region. The term “refined Gabor feature” is used for comparison with the term “raw Gabor feature” that is defined as a magnitude of a Gabor pixel of the Gabor representation.
Taking the six sub-region patterns of FIG. 3 as an example, feature calculating logic 104 may calculate the refined Gabor features with the following equations:

f1(S)=(|A|+|B|)/|S|, f4(S)=|E|/|S|, 

f2(S)=(|A|+|D|)/|S|, f5(S)=|F|/|S|, 

f3(S)=(|A|+|C|)/|S|, f6(S)=|G|/|S|  (3)

where f(S) may represent a refined Gabor feature of a region S and the value of f(S) is in a range of [0,1], f1(S) may correspond to the first pattern of FIG. 3, wherein |A| may represent a magnitude sum of the Gabor pixels in rectangular A, |B| may represent a magnitude sum of the Gabor pixels in rectangular B, and |A|+|B| may represent a magnitude sum of the Gabor pixels in the sub-region, |S| may represent a magnitude sum of the Gabor pixels in the region, and so for the rest of refined Gabor features f2(S) . . . f6(S).

In another embodiment, feature calculating logic 104 may obtain the refined Gabor features by calculating magnitude differences as follows:

f1(S)=|A|+|B|−|C|−|D|, f4(S)=|S|−|E|, 

f2(S)=|A|+|D|−|B|−|C|, f5(S)=S|−|F|, 

f3(S)=|A|+|C|−|B|−|D|, f6(S)=|S|−|G|  (4)

Integral logic 105 may produce an integral image from the Gabor representation derived from Gabor filter 101. FIG. 4 illustrates an embodiment of the integral image in a coordinate system. Each integral pixel of the integral image, such as integral pixels AA, BB, CC or DD, may correspond to a Gabor pixel (not shown) of the Gabor representation. Value of the integral pixel may represent a sum of magnitudes for all of the Gabor pixels within a rectangular defined by an origin of the coordinate system and the Gabor pixel that corresponds to the integral pixel: IG(x,y)=Σx,y|G(x′,y′) x′≦x,y,′≦y, wherein IG(x,y) may represent value of an integral pixel that corresponds to a Gabor pixel G(x,v), |G(x′,y′)| may represent a magnitude of a Gabor pixel G(x′,y′) within a rectangular defined by the origin and the Gabor pixel G(x,y).
For example, the value of integral pixel AA may represent the sum of magnitudes for all of the Gabor pixels within the rectangular defined by the origin (O) and the Gabor pixel (AA).
It can be seen that the Integral image may make a feature calculation with feature calculating logic 104 easier. This is because a magnitude sum (e.g., |A|, |B|, |C|, |D|, |E|, |F|, and |S|) used for the feature calculation can be easily obtained from the integral image with a limited number of calculations. For example, assuming that sub-region A is equivalent to the rectangular defined by the origin and integral pixel AA, sub-region A+B is equivalent to the rectangular defined by the origin and integral pixel BB, sub-region A+D is equivalent to the rectangular defined by the origin and integral pixel DD, and sub-region A+B+C+D is equivalent to the rectangular defined by the origin and integral pixel CC. Therefore, |A| may be obtained directly from the value of integral pixel AA (i.e., IG(AA)), |B| may be obtained by subtracting the value of integral pixel AA from the value of integral pixel BB (i.e., IG(BB)), |D| may be obtained with the equation: |D|=IG(DD)−IG(AA), and |C| may be obtained with the equation |C|=IG(CC)−IG(BB)−IG(DD)+IG(AA).
FIG. 5 illustrates an embodiment of an apparatus for obtaining and processing image features. The apparatus as shown may comprise a feature logic 501, a classifier logic 502, a classifying logic 503, a weight logic 504, a weight optimizing logic 505, and a classifier optimizing logic 506.
Feature logic 501 may receive a set of training images and select regions from each training image. Although various methods may be used to select the regions, feature logic 501 may use a uniform method to select regions from each training image, for example, either with the wave-front method or with the local-region method. Then, feature logic 501 may obtain training features from each region of each training image, and group the training features for all of the training images on region basis. In other words, the training features derived from the same region of different training images may be grouped together and the number of the training feature groups may be the same as the number of the regions.
For example, if the local-region method is adopted to select regions from multiple training face images and N local regions are selected from each training face image that may include left eye region, right eye region, month region, etc, then training features derived from the left eye region for all of the training face images may be grouped together. In this way, each group of training features may correspond to each region of the training images.
Further, each group of training features may comprise multiple sub-groups of training features, in which one sub-group of training features may be derived from one region of one training image. Therefore, the number of the sub-groups included in each group may be the same as the number of the training images.
Various methods may be applied to obtain the training features, such as the refined Gabor feature method, and the local Gabor binary histogram sequence method. If the refined Gabor feature method is applied, the training features may be the refined Gabor features. If the local Gabor binary histogram sequence method is applied, the training features may be the local Gabor binary histogram sequences. Here, the training image may be a raw image, or an intermediate image (i.e., Gabor representation) derived from a Gabor filter.
Similarly, feature logic 501 may further obtain groups of validation features from a set of validation images. Each group of validation features may correspond to each region of the validation images. Further, each group of validation features may comprise multiple sub-groups of validation features, in which one sub-group of validation features may be derived from one region of one validation image.
The same method that is used to select regions from the training images may be used to select regions from the validation images. Therefore, corresponding relationships may be established between the regions of the training images and the regions of the validation images, namely, each region of the training images may correspond to each region of the validation images. For example, the left eye region of the validation face images may correspond to the left eye region of the training face images. Thus, a group of validation features derived from a region of the validation images may correspond to a group of training features derived from the corresponding region of the training images. Similar as the training features, various methods may be applied to obtain the validation features, and will not be reiterated here for simplicity.
Classifier logic 502 may train the groups of training features and obtain a plurality of classifiers. Each classifier may correspond to each group of training features and thus correspond to each region of the training images. Various methods may be used to train the training features for the classifiers, such as a dual-space linear discriminant analysis method, principal component analysis method, and Boosting method.
Classifying logic 503 may utilize the plurality of classifiers to classify the groups of validation features. A classifier may classify a group of validation features that it corresponds to and a similarity factor may be obtained for the group of validation features. In an embodiment, the similarity factor may comprise multiple distances and a label for each sub-group of the group of validation features. The multiple distances may be obtained by comparing a sub-group of validation features derived from a region of a validation image with different sub-groups of training features derived from the same region of different training images. Thus, a distance may indicate how close the sub-group of validation features is to a sub-group of training features derived from a training image.
Among the distances, a minimum distance may be determined, based upon which the label that may indicate whether the sub-group of validation features positively or negatively match with the sub-group of training features derived from the training image corresponding to the minimum distance may be obtained. Since the groups of validation features are classified, a plurality of similarity factors may be obtained, each similarity factor corresponding to each group of validation features and thus corresponding to each region of the validation images.
Weight logic 504 may train the plurality of similarity factors and obtain a plurality of weights. Each weight may correspond to each group of validation features, and thus correspond to each region of the validation images. In an embodiment, a probabilistic discriminant learning scheme may be adopted for the weight calculation. Based upon the plurality of similarity factors, a similarity combination for each validation image may be established as follows:

z=[z1, . . . ,zn]T, t  (5)

wherein, each of z1, . . . , zn may represent the minimum distance corresponding to each region of the validation image, and t may represent a new label indicating whether the validation image positively or negatively matches with the training image, in which the new label may be determined based upon the above-stated labels.

Then, a discriminant function may be defined as follows:




  
    
      
        
          
            η
            ⁡
            
              (
              z
              )
            
          
          =
          
            
              log
              ⁢
              
                
              
              ⁢
              
                
                  P
                  ⁡
                  
                    (
                    
                      t
                      =
                      
                        1
                        |
                        z
                      
                    
                    )
                  
                
                
                  P
                  ⁡
                  
                    (
                    
                      t
                      =
                      
                        0
                        |
                        z
                      
                    
                    )
                  
                
              
            
            =
            
              log
              ⁢
              
                
                  P
                  ⁡
                  
                    (
                    
                      t
                      =
                      
                        1
                        |
                        z
                      
                    
                    )
                  
                
                
                  1
                  -
                  
                    P
                    ⁡
                    
                      (
                      
                        t
                        =
                        
                          1
                          |
                          z
                        
                      
                      )
                    
                  
                
              
            
          
        
        ,
        
          z
          =
          
            
              [
              
                
                  z
                  1
                
                ,
                ...
                ⁢
                
                  
                
                ,
                
                  z
                  n
                
              
              ]
            
            T
          
        
      
    
    
      
        (
        6
        )
      
    
  




wherein η(z) may represent the discrimant function, p(t=1|z) may represent a probability that the validation image positively match with the training image, p(t=0|z) may represent a probability that the validation image negatively match with the training image.

Since η(z) is characterized as a linear function, then

η(z)=βTz, z=[z1, . . . , zn]T  (7)

wherein β may represent a plurality of weights, each weight corresponding to each region of the validation image.

Please note that equations (5)-(7) are established for one validation image. In order to calculate the plurality of weights, multiple validation images may be classified and a likelihood function may be established as follows:




  
    
      
        
          L
          ⁡
          
            (
            z
            )
          
        
        =
        
          
            
              ∑
              
                
                  t
                  ⁡
                  
                    (
                    
                      z
                      i
                    
                    )
                  
                
                =
                1
              
            
            ⁢
            
              η
              ⁡
              
                (
                
                  z
                  i
                
                )
              
            
          
          -
          
            
              ∑
              
                
                  t
                  ⁡
                  
                    (
                    
                      z
                      j
                    
                    )
                  
                
                =
                0
              
            
            ⁢
            
              η
              ⁡
              
                (
                
                  z
                  j
                
                )
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




wherein, L(z) may represent the likelihood function,





  
    ∑
    
      
        t
        ⁡
        
          (
          
            z
            i
          
          )
        
      
      =
      1
    
  
  ⁢
  
    η
    ⁡
    
      (
      
        z
        i
      
      )
    
  




may represent a sum of discriminant functions for all of the validation images which positively match with the training images, and





  
    ∑
    
      
        t
        ⁡
        
          (
          
            z
            j
          
          )
        
      
      =
      0
    
  
  ⁢
  
    η
    ⁡
    
      (
      
        z
        j
      
      )
    
  




may represent a sum of discriminant functions for all of the validation images which negatively match with the training images, integers i and j may respectively represent indexes of the validation images that positively and negatively match with the training images.

The weights may be obtained by maximizing the likelihood function as follows:




  
    
      
        max
        (
        
          
            L
            ⁡
            
              (
              z
              )
            
          
          =
          
            
              
                ∑
                
                  
                    t
                    ⁡
                    
                      (
                      
                        z
                        i
                      
                      )
                    
                  
                  =
                  1
                
              
              ⁢
              
                η
                ⁡
                
                  (
                  
                    z
                    i
                  
                  )
                
              
            
            -
            
              
                ∑
                
                  
                    t
                    ⁡
                    
                      (
                      
                        z
                        j
                      
                      )
                    
                  
                  =
                  0
                
              
              ⁢
              
                
                  η
                  ⁡
                  
                    (
                    z
                    )
                  
                
                ⁢
                
                  η
                  ⁡
                  
                    (
                    
                      z
                      j
                    
                    )
                  
                
              
            
          
        
        )
      
    
    
      
        (
        9
        )
      
    
  




Note that L(z)=tL(z)+(1−t)L(z), it is easy to show that the following equation (10) is equivalent to the above maximal likelihood function:





  
    
      
        
          
            max
            ⁢
            
              
                ∏
                i
              
              ⁢
              
                
                  
                    P
                    ⁡
                    
                      (
                      
                        t
                        =
                        
                          1
                          |
                          z
                        
                      
                      )
                    
                  
                  t
                
                ⁢
                
                  
                    P
                    ⁡
                    
                      (
                      
                        t
                        =
                        
                          0
                          |
                          z
                        
                      
                      )
                    
                  
                  
                    1
                    -
                    t
                  
                
              
            
          
          ⁢
          
            

          
          ⇔
          
            max
            ⁢
            
              
                ∏
                i
              
              ⁢
              
                P
                ⁡
                
                  (
                  
                    t
                    ;
                    z
                  
                  )
                
              
            
          
        
        ,
        
          

        
        ⁢
        
          
            wherein
            ⁢
            
              
            
            ⁢
            
              P
              ⁡
              
                (
                
                  t
                  ;
                  z
                
                )
              
            
          
          =
          
            
              
                P
                ⁡
                
                  (
                  
                    t
                    =
                    
                      1
                      |
                      z
                    
                  
                  )
                
              
              t
            
            ⁢
            
              
                
                  P
                  ⁡
                  
                    (
                    
                      t
                      =
                      
                        0
                        |
                        z
                      
                    
                    )
                  
                
                
                  1
                  -
                  t
                
              
              .
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




Equation 10 is in fact a logistical regression model, which can be solved by the iterative re-weighting least square (IRLS) algorithm. Therefore, the plurality of weights can be obtained, in which each weight may correspond to each region of the validation images. It should be appreciated that other algorithms may be used to learn the weights, such as Boosting method.
Weight optimizing logic 505 may optimize the plurality of weights learned by weight logic 504 based upon a certain criteria. In an embodiment, negative weights may be discarded, and therefore, the number of effective weights (i.e., positive weights) may be reduced.
Classifier optimizing logic 506 may utilize the optimized weights to optimize the plurality of classifiers obtained by the classifier logic 502. In an embodiment, classifier optimizing logic 506 may optimize the classifiers with the following equation:




  
    
      
        
          h
          ⁡
          
            (
            x
            )
          
        
        =
        
          
            ∑
            
              m
              =
              1
            
            M
          
          ⁢
          
            
              β
              m
              *
            
            ⁢
            
              
                h
                m
              
              ⁡
              
                (
                x
                )
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




wherein, h(x) may represent a combination of optimized classifier(s), integer M may represent the number of optimized weights (i.e., effective weights), βmmay represent the mth optimized weight, and hm(x) may represent the mth classifier before the optimization.

The following may explain how to use the optimized classifier(s) and optimized weight(s) to optimize the process of recognizing a test image.
After a test image is received, feature logic 501 may obtain test features from region(s) of the test image with reference to the optimized weight(s). Particularly, feature logic 501 may select region(s) from the test image with reference to the region(s) of the validation image that corresponds to the optimized weight(s). With this scheme, the number of the selected region(s) may be reduced to the same as the number of the optimized weight(s), which may thus reduce the complexity for feature calculation and image recognition later.
As stated above, various methods may be used to obtain the test features, such as the refined Gabor feature method, and local Gabor binary histogram sequence method. Feature logic 501 may further group the test feature on regional wise, and thus, each group of test features may correspond to each selected region of the test image.
Then, classifying logic 503 may utilize the optimized classifier(s) to classify the test features. With similar method as stated with reference to the validation image, the optimized classifier(s) may classify the groups of the test features and obtain a label indicating whether the test image positively or negatively match with the training image.
It should be appreciated that the apparatus of FIG. 5 can be used to train and learn a single training image and/or a single validation image.
FIG. 6 illustrates an embodiment of a method of obtaining refined Gabor features. In block 601, an image may be input, for example, from an I/O device. In block 602, the image may go through a Gabor filter and a Gabor representation of the image may be obtained. In block 603, regions may be selected from the Gabor representation of the image based upon various forms, such as wave-front form or local region form. In block 604, sub-regions may be selected from each region of the Gabor representation based upon various patterns, such as the Haar pattern and/or the extended Haar pattern.
In block 605, integral image may be obtained from the Gabor representation of the image. Each integral pixel of the integral image may correspond to each Gabor pixel of the Gabor representation. Value of the integral pixel may represent a magnitude sum for all of the Gabor pixels within a field defined by a Gabor pixel corresponding to the integral pixel. In block 606, the refined Gabor features may be obtained based upon magnitude calculations related to the regions and the sub-regions. The integral image may make the magnitude calculation easier. In an embodiment, the refined Gabor feature may be obtained by dividing a magnitude sum related the sub-region by a magnitude sum related to the region. In another embodiment, the refined Gabor feature may be obtained by calculating magnitude differences as stated above.
FIG. 7 illustrates an embodiment of a method of obtaining and processing image features. In block 701, a set of training images and a set of validation images may be input, for example, from an I/O device. In block 702, training features may be derived from regions of each training image, and validation features may be derived from regions of each validation image, in which regions may be selected from the validation images in a same pattern as the regions selected from the training images. In block 703, training features and validation features may be segmented into region-based groups. Each group of training features may correspond to each region of the training images, and each group of validation features may correspond to each region of the validation images. Moreover, corresponding relationship may be established between groups of training features and groups of validation features. Namely, a group of training features derived from a region of the training images may correspond to a group of validation features derived from the same region of the validation images.
In block 704, a plurality of classifiers may be obtained by training the groups of training features, each classifier corresponding to each group of training features and thus corresponding to each region of training features. In block 705, the plurality of classifiers may be used to classify the groups of validation features, and a plurality of similarity factor may be obtained. Each similarity factor may correspond to each region of validation images and indicate whether the corresponding region of each validation image positively or negatively matches with the corresponding region of a training image having the minimum distance from the validation image.
In block 706, it may be determined whether all of the groups of validation features have been classified. If so, in block 707, a plurality of similarity combinations may be obtained based upon the plurality of similarity factors. Each similarity combination may correspond to each validation image and indicate whether the validation image positively or negatively match with the training image. In block 708, based upon the similarity combinations, a plurality of weights may be obtained. In an embodiment, a discriminant model may be established from which the weights may be learned. Each weight may correspond to each region of the validation images.
In block 709, the plurality of weights may be optimized based upon a certain criteria. In an embodiment, negative weights may be discarded. In block 710, the plurality of classifiers obtained in block 704 may be optimized based upon the optimized weights. In block 711, a test image may be input, and in block 712, groups of test features may be obtained from regions of the test image, each group of test feature from each region of the test image. The regions may be selected from the test image with reference to regions corresponding to the optimized weights. In block 713, the groups of test features may be classified with the optimized classifiers and thus the test image may be recognized.
FIG. 8 illustrates an embodiment of a computing platform. Examples of the node may comprise mainframe computers, mini-computers, personal computers, workstations, portable computers, laptop computers, mobile phones or personal data assistants (PDA), or other device capable for data transceiving and processing.
The computing platform may comprise one or more processors 81, memory 82, chipset 83, I/O devices 84 and possibly other components for data transceiving and processing.
Processors 81 are communicatively coupled to various components (e.g., the memory 82) via one or more buses such as a processor bus. Processors 81 may be implemented as an integrated circuit (IC) with one or more processing cores that may execute codes under a suitable architecture, for example, including Intel® XeonTM, Intel® PentiumTM, Intel® ItaniumTM architectures, available from Intel Corporation of Santa Clara, Calif.
Memory 82 may store codes to be executed by processor 81. In an embodiment, memory 82 may store codes for obtaining refined Gabor features as stated with reference to FIG. 1. In another embodiment, memory 82 may store codes for obtaining and processing image features as stated with reference to FIG. 5.
Chipset 83 may provide one or more communicative path among processors 81, memory 82, I/O devices 84, and possibly other components. I/O devices 84 may input or output data to or from the targeting node, such as trust levels and weights. Examples for the I/O devices 84 may comprise a network card, a blue-tooth device, an antenna, and possibly other devices for transceiving data.
Although the current invention has been described in conjunction with certain embodiments, it shall be understood that modifications and variations may be resorted to without departing from the spirit and scope of the invention as those skilled in the art readily understand. Such modifications and variations are considered to be within the scope of the invention and the appended claims.

## Claims

1. A method of obtaining a refined Gabor feature corresponding to a sub-region of an image, comprising:
receiving an image;
obtaining a Gabor representation of the received image by using a Gabor filter;
determining a region from the Gabor representation, wherein the region comprises a first plurality of Gabor pixels of the Gabor representation;
determining a sub-region from the region, wherein the sub-region comprises a second plurality of Gabor pixels of the Gabor representation, each of the Gabor pixels of the sub-region also being Gabor pixels of the region;
calculating a magnitude sum in the Gabor pixels of the region and in the Gabor pixels in the sub-region; and
calculating a refined Gabor feature for the sub-region based upon a magnitude calculation by dividing the magnitude sum for the sub-region by the magnitude sum for and the region.

2. The method of claim 1, further comprising obtaining an integral image from the Gabor representation, wherein an integral pixel of the integral image corresponds to a Gabor pixel of the Gabor representation and a value of the integral pixel is obtained by integrating magnitudes for Gabor pixels within a field defined by the Gabor pixel corresponding to the integral pixel.

3. The method of claim 2, wherein calculating a magnitude sum comprises calculating a magnitude sum based upon the integral image.

4. The method of claim 1, wherein the sub-region is determined with reference to one or more Haar patterns.

5. The method of claim 1, wherein the sub-region is determined with reference to one or more extended Haar patterns.

6. The method of claim 1, wherein the calculating a sub-region magnitude sum comprises:
calculating a first magnitude sum for a first integral pixel;
calculating a second magnitude sum for a second integral pixel, each integral pixel corresponding to a sum of the Gabor pixels within a region defined by an origin and a position corresponding to the integral pixel; and
obtaining the sub-region magnitude sum by subtracting the first magnitude sum from the second magnitude sum.

7. The method of claim 1 wherein obtaining a Gabor representation comprises convolving the image with a two-dimensional Gabor filter.

8. The method of claim 1, wherein the calculating a refined Gabor feature further comprises:
calculating a first magnitude sum for Gabor pixels within the sub-region;
calculating a second magnitude sum for Gabor pixels within a part of the region that does not overlap with the sub-region; and
obtaining a refined Gabor feature by subtracting the second magnitude sum from the first magnitude sum.

9. The method of claim 1, further comprising:
combining the calculated refined Gabor feature with a plurality of other calculated Gabor features to form a training image in which the Gabor features serve as training features;
training image classifiers using the training image.

10. An apparatus, comprising:
a Gabor filter to obtain a Gabor representation of an image;
a region logic to determine a region from the Gabor representation, wherein the region comprises a plurality of Gabor pixels of the Gabor representation;
a sub-region logic to determine a sub-region from the region, wherein the sub-region comprises a second plurality of Gabor pixels of the Gabor representation, each of the Gabor pixels of the sub-region also being Gabor pixels of the region; and
a feature calculating logic to calculate a magnitude sum in the Gabor pixels of the region and in the Gabor pixels in the sub-region and to calculate a refined Gabor feature for the sub-region based upon a magnitude calculation by dividing the magnitude sum for the sub-region by the magnitude sum for the region.

11. The apparatus of claim 10, further comprising an integral logic to obtain an integral image from the Gabor representation, wherein an integral pixel of the integral image corresponds to a Gabor pixel of the Gabor representation, and a value of the integral pixel is obtained by integrating magnitudes for Gabor pixels within a field defined by the Gabor pixel corresponding to the integral pixel.

12. The apparatus of claim 11, wherein the feature calculating logic is further to perform the magnitude sum calculation for the sub-region and the region based upon the integral image.

13. The apparatus of claim 10, wherein the sub-region is determined with reference to one or more Haar patterns.

14. The apparatus of claim 10, wherein the sub-region is determined with reference to one or more extended Haar patterns.

15. The apparatus of claim 10, wherein the feature calculating logic is further to:
calculate a first magnitude sum for a first integral pixel;
calculate a second magnitude sum for a second integral pixel, each integral pixel corresponding to a sum of the Gabor pixels within a region defined by an origin and a position corresponding to the integral pixel; and
obtain the sub-region magnitude sum by subtracting the first magnitude sum from the second magnitude sum.

16. The apparatus of claim 10, wherein the feature calculating logic is further to:
calculate a first magnitude sum for Gabor pixels within the sub-region;
calculate a second magnitude sum for Gabor pixels within a part of the region that does not overlap with the sub-region; and
obtain a refined Gabor feature by subtracting the second magnitude sum from the first magnitude sum.

17. A system, comprising:
a processor;
a machine-readable medium coupled to the processor, wherein the machine-readable medium further comprises a plurality of instructions which, if executed by the processor, cause the system to perform operations comprising:
receiving an image;
obtaining a Gabor representation of the received image by using a Gabor filter;
determining a region from the Gabor representation, wherein the region comprises a first plurality of Gabor pixels of the Gabor representation;
determining a sub-region from the region, wherein the sub-region comprises a second plurality of Gabor pixels of the Gabor representation, each of the Gabor pixels of the sub-region also being Gabor pixels of the region;
calculating a magnitude sum in the Gabor pixels of the region and in the Gabor pixels in the sub-region; and
calculating a refined Gabor feature for the sub-region based upon a magnitude calculation by dividing the magnitude sum for the sub-region by the magnitude sum for the region.

18. The system of claim 17, wherein the plurality of instructions further cause the system to perform operations comprising: obtaining an integral image from the Gabor representation, wherein an integral pixel of the integral image corresponds to a Gabor pixel of the Gabor representation, and a value of the integral pixel is obtained by integrating magnitudes for Gabor pixels within a field defined by the Gabor pixel corresponding to the integral pixel.

19. The system of claim 18, wherein calculating a magnitude sum comprises calculating a magnitude sum based upon the integral image.

20. The system of claim 17, wherein the sub-region is determined with reference to one or more Haar patterns.

21. The system of claim 17, wherein the sub-region is determined with reference to one or more extended Haar patterns.

22. The system of claim 17, wherein the instructions calculating the sub-region magnitude sum, further cause the system to perform operations comprising:
calculating a first magnitude sum for a first integral pixel;
calculating a second magnitude sum for a second integral pixel, each integral pixel corresponding to a sum of the Gabor pixels within a region defined by an origin and a position corresponding to the integral pixel; and
obtaining the sub-region magnitude sum by subtracting the first magnitude sum from the second magnitude sum.