Abstract:
Unsupervised learning of object category from images is carried out by using an automatic image recognition system. A plurality of training images are automatically analyzed using an interest operator which produces an indication of features. Those features are clustered using a vector guantizer. The model is learned from the features using expectation maximization to assess a joint probability of which features are most relevant.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
   The present application claims priority from provisional application No. 60/266,014, filed Feb. 1, 2001. 

   STATEMENT AS TO FEDERALLY-SPONSORED RESEARCH 
   The U.S. Government has certain rights in this invention pursuant to Grant Nos. NSF9402726 and NSF9457618 awarded by the National Science Foundation. 

   BACKGROUND 
   Machines can be used to review an electronic version of an image to recognize information within an electronic image. 
   An object class is a collection of objects which share characteristic parts or features that are visually similar, and which occur in similar spatial configurations. Solutions to the problem of recognizing members of object classes have taken various forms. Use of various models have been suggested. 
   These techniques often require a training process that attempts to carry out:
         segmentation, that is which objects are to be recognized and where do they appear in the training images,   selection, that is, selection of which object parts are distinctive and stable, and   estimation of model parameters, that is, what parameters of the global geometry or shape and the appearance of the individual parts best describe the training data.       

   Previous model based techniques may require a supervised stage of learning. For example, targeted objects must be identified in training images either by selection of points or regions on their surfaces, or by segmenting the objects from the background. This may produce significant disadvantages, including that any prejudices of the human observer, such as which features appear most distinctive to the human observer, may also be trained during the training process. 
   SUMMARY 
   The present application defines a statistical model in which shape variability is modeled in a probabilistic setting. In an embodiment, a set of images are used to automatically train a system for model learning. The model is formed based on probabilistic techniques. 
   In an embodiment, an interest operator is used to determine textured regions in the image, and the number of features are reduced by clustering. An automatic model estimates which of these features are the most important and probabilistically determines a model, a correspondence, and a joint model probability density. This may be done using expectation maximization. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
     These and other aspects will now be described in detail with reference to the accompanying drawings, wherein: 
       FIG. 1  shows a basic block diagram of the system of the present application; 
       FIG. 2  shows a flowchart of the basic training techniques; 
       FIG. 3  shows some generic templates; 
       FIG. 4  shows a flowchart of the overall operation; and 
       FIGS. 5A and 5B  shows some exemplary results for models for specified letters. 
   

   DETAILED DESCRIPTION 
   In the present system, instances of an object class are described through characteristic set of features/parts which can occur at varying spatial locations. The objects are composed of parts and shapes. Parts are the image patches that may be detected and characterized by detectors. Shape describes the geometry of the parts. In the embodiment, a joint probability density is based on part appearance and shape models of the object class. 
   The parts are modeled as rigid patterns. Their positional variability is represented using a probability density function over the point locations of the object features. Translation of the part features are eliminated by describing all feature positions relative to one reference feature. Positions are represented by a Gaussian probability density function. 
   In one aspect, the system determines whether the image contains only clutter or “background”, or whether the image contains an instance of the class or “foreground”. According to an embodiment, the object features may be independently detected using different types of feature detectors. After detecting the features, a hypothesis evaluation stage evaluates candidate locations in the image to determine the likelihood of their actually corresponding to an instance of the object class. This is done by fitting a mixture density model to the data. The mixture density model includes a joint Gaussian density over all foreground detector responses, and a uniform density over background responses. 
     FIG. 1  shows a basic diagram of the operation and  FIG. 4  shows a flowchart of the basic operation. In general, the operation can be carried out on any programmed computer.  FIG. 1  may be embodied in a general-purpose computer, as software within the computer, or as any kind of hardware system including dedicated logic, programmable logic, and the like. The images may be obtained from files, or may be obtained using a camera. 
   An image set  100  may be used for automatic feature selection at  400 . The image set is applied to a feature selection system  110 . The feature selection system  110  may have an interest operator  112  which automatically detects textured regions in the images. The interest operator may be the so called Forstner interest operator. This interest operator may detect corner points, line intersections, center points and the like.  FIG. 3  shows a set of  14  generic detector templates which may be used. These templates are normalized such that their mean is equal to zero. Other techniques may be used, however, using other templates. 
   The automatic feature selection in  400  may produce 10,000 or more features per image. 
   The number of interesting features is reduced in a vector quantizer  114  which quantizes the vectors and clusters them by grouping similar parts. A clustering algorithm may also be used. This may produce approximately 150 features per image. Shifting by multiple pixels may further reduce the redundancy. 
   The object model is trained using the part candidates. 
   Model training at  410  trains the feature detectors using the resultant clusters, in the model learning block  120 . This is done to estimate which are of the features are actually the most informative, and to determine the probabilistic description of the constellation that these features form when they are exposed to an object of interest. This is done by forming the model structure, establishing a correspondence between homologous parts across the training set, and labeling and other parts as background or noise. 
   The inventors recognize three basic issues which may produce advantages over the prior art. First, the technique used for training should be automated, that is, it should avoid segmentation or labeling of the images manually. Second, a large number of feature detectors should be used to enable selecting certain feature detectors that can consistently identify a shared feature of the object class. This means that a subset of the feature detectors may be selected to choose the model configuration. A global shape representation should also be learned autonomously. 
   Training a model requires determining the key parts of the object, selecting corresponding parts on the number of training images, and estimating the joint probability function based on part appearance and shape. While previous practitioners have done this manually, the present technique may automate this. 
   The operation proceeds according to the flowchart of  FIG. 2 . Initially, a number of feature detectors F. may be selected to be part of the model. At  200 , all the information is extracted from the training image. The objects are modeled as collections of rigid parts. Each of those parts is detected by a detector, thereby transforming the entire image into a collection of parts. Some of those parts will correspond to the foreground, that is they will be an instance of the target object class. Other parts stem from background clutter or false detections known as the background. 
   Assume T different types of parts. Then, the positions of all parts extracted from 1 image may be summarized as a matrix of feature candidate positions of the form: 
   
     
       
         
           
             X 
             0 
           
           = 
           
             ( 
             
               
                 
                   
                     
                       
                         
                           x 
                           11 
                         
                         ⁢ 
                         
                           x 
                           12 
                         
                       
                       , 
                       … 
                       ⁢ 
                       
                           
                       
                       , 
                       
                         
                           x 
                           1 
                         
                         ⁢ 
                         
                           N 
                           1 
                         
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           x 
                           21 
                         
                         ⁢ 
                         
                           x 
                           22 
                         
                       
                       , 
                       … 
                       ⁢ 
                       
                           
                       
                       , 
                       
                         
                           x 
                           2 
                         
                         ⁢ 
                         
                           N 
                           2 
                         
                       
                     
                   
                 
                 
                   
                     ⋮ 
                   
                 
                 
                   
                     
                       
                         
                           x 
                           T1 
                         
                         ⁢ 
                         
                           x 
                           T2 
                         
                       
                       , 
                       … 
                       ⁢ 
                       
                           
                       
                       , 
                       
                         
                           x 
                           T 
                         
                         ⁢ 
                         
                           N 
                           T 
                         
                       
                     
                   
                 
               
               , 
             
           
         
       
     
   
   Each row contains the two-dimensional locations of detections of the feature type F. Random variables of the type
 
D={X T   o , x T   m , n T , h T , b T }.
 
may be used to represent the explicit or unobserved information. The superscript “o” indicates that the positions are observed, while unobserved features are designated by the superscript “m” for missing.
 
   The entire set x of feature candidates can be divided between candidates which are be true features of the object or the “foreground”, and noise features also called the “background”. The random variable vector h may be used to create a set of indices so that if h i =j;,j&gt;0, if the point x ij  is a foreground point. If an object part is not included in X 0  then the corresponding entry in h will be zero. 
   When presented with an unlabeled image, the system does not know which parts correspond to the foreground. This means that h is not observable. Therefore, h is a hypothesis, since it is used to hypothesize that certain parts of X 0  belong to the foreground object. Positions of the occluded or missed foreground features are collected in a separate vector x m , where the size of x m  varies between 0 and F. depending on the number of unobserved features. The binary vector b encodes information about which parts have been detected and which omissions or occluded. Therefore, bf is 1 if hf&gt;0 (the object part is included in X 0 ), and is 0 otherwise. 
   The vector N denotes the number of background candidates included in a specific row of X 0 . 
   Finally, the number n tau  represents the number of background detections. 
   At  210 , the statistics of the training image is assessed. The object is to classify the images into the classes of whether the object is present (c1) or whether the object is absent (c0). This may be done by choosing the class with the maximum a posteriori probability. The techniques are disclosed herein. This classification may be characterized by the ratio 
   
     
       
         
           
             
               
                 p 
                 ⁡ 
                 
                   ( 
                   
                     
                       C 
                       1 
                     
                     | 
                     
                       X 
                       0 
                     
                   
                   ) 
                 
               
               
                 p 
                 ⁡ 
                 
                   ( 
                   
                     
                       C 
                       0 
                     
                     | 
                     
                       X 
                       0 
                     
                   
                   ) 
                 
               
             
             ∝ 
             
               
                 
                   ∑ 
                   h 
                 
                 ⁢ 
                 
                   p 
                   ⁡ 
                   
                     ( 
                     
                       
                         X 
                         0 
                       
                       , 
                       
                         h 
                         | 
                         
                           C 
                           1 
                         
                       
                     
                     ) 
                   
                 
               
               
                 p 
                 ⁡ 
                 
                   ( 
                   
                     
                       X 
                       0 
                     
                     , 
                     
                       
                         h 
                         0 
                       
                       | 
                       
                         C 
                         0 
                       
                     
                   
                   ) 
                 
               
             
           
           , 
         
       
     
   
   The probability distribution modeling the data may be shown as
 
 p ( X   0   , x   m   , h, n, b )= p ( X   0   , x   m   |h, n ) p ( h|n, b ) p ( n ) p ( b ).
 
   The probability density over the number of background detection may be modeled by a Poisson distribution as 
               p   ⁡     (   n   )       =       ∏     f   =   1     F     ⁢       1       n   f     !       ⁢       (     M   f     )       n   f       ⁢     ⅇ     -     M   f               ,         
Where M f  is the average number of background detections per image. Allowing a different M f  for each feature allows modeling different detector statistics and ultimately enables distinguishing between more reliable detectors and less reliable detectors.
 
   The vector b encodes information about which features have been detected and which are missed. The probability that b is 1, p(b), is modeled by a table of size 2 F  which equals the number of possible binary vectors of length F. If F. is large, then the explicit probability mass table of length 2 F  may become even longer. Independence between the feature detectors and the model p(b) is shown as: 
             p   ⁡     (   b   )       =       ∏     f   =   1     F     ⁢       p   ⁡     (     b   f     )       .             
The number of parameters reduces in that case from 2 F  to F.
 
   The density p is modeled by 
             p   ⁡     (       h   |   n     ,   b     )       =     {           1       ∏     f   =   1     F     ⁢     N   f     b   f                 h   ∈     H   b               0         o   ⁢           ⁢   t   ⁢           ⁢   h   ⁢           ⁢   e   ⁢           ⁢   r   ⁢           ⁢   h                   
where Hb denotes the set of all hypotheses consistent with both b and n and N f  and denotes the total number of detections of the feature f.
 
   The hypothesized foreground detections are shown as
 
 p ( X   0   , x   m   |h, n )= G ( z |μ 1 Σ) U ( x   bg ) 1  
 
Where z T ≅(x 0 x m )is defined as the coordinates of the hypothesized foreground detections both observed and missing, x bg  is defined as the coordinates of the background detection, G(z|μ,Σ) denotes a Gaussian with a mean of μ and covariance of Σ.
 
   The positions of the background detections are modified with a uniform intensity shown by 
               U   ⁡     (     x     b   ⁢           ⁢   g       )       =       ∏     f   =   1     F     ⁢     1     A     n   f             ,         
Where A is the area covered by the image.
 
   Statistical learning is then used to estimate parameters of the statistical object class. This may be done using expectation maximization. The joint model probability density is estimated from the training set at  420 . A probabilistic attempt is carried out to maximize the likelihood of the observed data, using expectation maximization (EM) to attempt to determine the maximum likelihood solution. 
               L   ⁡     (       X   0     |     θ   _       )       =       ∑     τ   =   1     T     ⁢     log   ⁢       ∑     h   τ       ⁢       ∑     b   τ       ⁢       ∑     n   τ       ⁢     ∫       p   ⁡     (       X   τ   0     ,     x   τ   m     ,     h   τ     ,     n   τ     ,       b   τ     |   θ       )       ⁢     ⅆ     x   τ   m                       ,         
Where θ represents the set of all parameters of the model.
 
   This may be simplified as 
             Q   ⁡     (       θ   _     |   θ     )       =       ∑     τ   =   1     T     ⁢       E   ⁡     [     log   ⁢           ⁢     p   ⁡     (       X   τ   0     ,     x   τ   m     ,     h   τ     ,     n   τ     ,       b   τ     |     θ   _         )         ]       .             
Where E[.] denotes taking the expectation with respect to p(h T , x T   m , n T , b T |X T   0 ,θ). As notation, the tilde implies that the values from a previous iteration are substituted. By using the EM technique, a local maximum may be found to thereby determine the maximum values.
 
   At  130 , update rules are determined. This may be done by decomposing Q into four parts: 
                   Q   ⁡     (       θ   _     |   θ     )       =       ⁢         Q   1     ⁡     (       θ   _     |   θ     )       +       Q   2     ⁡     (       θ   _     |   θ     )       +       Q   3     ⁡     (       θ   _     |   θ     )       +       Q   4     ⁡     (   θ   )                     =       ⁢         ∑     τ   =   1     T     ⁢     E   ⁡     [     log   ⁢           ⁢     p   ⁡     (       n   τ     |   θ     )         ]         +       ∑     τ   =   1     T     ⁢     E   ⁡     [     log   ⁢           ⁢     p   ⁡     (       b   τ     |   θ     )         ]         +                     ⁢         ∑     τ   =   1     T     ⁢     E   ⁡     [     log   ⁢           ⁢     p   ⁡     (       X   τ   0     ,       x   τ   m     |     h   τ       ,     n   τ     ,   θ     )         ]         +                     ⁢       ∑     τ   =   1     T     ⁢     E   ⁡     [     log   ⁢           ⁢     p   ⁡     (         h   τ     |     n   τ       ,     b   τ       )         ]                     
The first three terms contain the parameters that will be updated while the last term includes no new parameters. First, the update rules for μ. Q 3  depends only on μ tilde. Therefore, taking the derivative of the expected likelihood yields
 
                 ∂     ∂     μ   _         ⁢       Q   3     ⁡     (       θ   _     |   θ     )         =       ∑     τ   =   1     T     ⁢     E   ⁡     [         ∑   _       -   1       ⁢     (       z   τ     -     μ   _       )       ]           ,         
Where z T =(x 0  x m ) according to the definition above. Setting the derivative to 0 yields the update rule
 
   
     
       
         
           
             μ 
             _ 
           
           = 
           
             
               1 
               T 
             
             ⁢ 
             
               
                 ∑ 
                 
                   τ 
                   = 
                   1 
                 
                 T 
               
               ⁢ 
               
                 
                   E 
                   ⁡ 
                   
                     [ 
                     
                       z 
                       T 
                     
                     ] 
                   
                 
                 . 
               
             
           
         
       
     
   
   Next the update rule for Σ operates in an analogous way. The derivative with respect to the covariance matrix 
               ∂     ∂       ∑   _       -   1           ⁢       Q   3     ⁡     (       θ   _     |   θ     )         =       ∑     τ   =   1     T     ⁢       E   ⁡     [       1   2     ⁢       ∑   _     ⁢       -     1   2       ⁢     (       z   τ     -     μ   _       )     ⁢       (       z   τ     -     μ   _       )     T           ]       .             
Equating with zero leads to
 
   
     
       
         
           
             ∑ 
             _ 
           
           ⁢ 
           
             = 
             
               
                 
                   1 
                   T 
                 
                 ⁢ 
                 
                   
                     ∑ 
                     
                       τ 
                       = 
                       1 
                     
                     T 
                   
                   ⁢ 
                   
                     E 
                     ⁡ 
                     
                       [ 
                       
                         
                           ( 
                           
                             
                               z 
                               τ 
                             
                             - 
                             
                               μ 
                               _ 
                             
                           
                           ) 
                         
                         ⁢ 
                         
                           
                             ( 
                             
                               
                                 z 
                                 τ 
                               
                               - 
                               
                                 μ 
                                 _ 
                               
                             
                             ) 
                           
                           T 
                         
                       
                       ] 
                     
                   
                 
               
               = 
               
                 
                   
                     1 
                     T 
                   
                   ⁢ 
                   
                     
                       ∑ 
                       
                         τ 
                         = 
                         1 
                       
                       T 
                     
                     ⁢ 
                     
                       E 
                       ⁡ 
                       
                         [ 
                         
                           
                             z 
                             τ 
                           
                           ⁢ 
                           
                             z 
                             τ 
                             T 
                           
                         
                         ] 
                       
                     
                   
                 
                 - 
                 
                   
                     μ 
                     _ 
                   
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     
                       
                         μ 
                         _ 
                       
                       T 
                     
                     . 
                   
                 
               
             
           
         
       
     
   
   The update rule for p(b) may require considering Q 2  since this is the only term the depends on the parameters. The derivative with respect to p(b) yields 
               ∂     ∂       p   _     ⁡     (     b   _     )           ⁢       Q   2     ⁡     (       θ   _     |   θ     )         =       ∑     τ   =   1     T     ⁢       E   ⁡     [     δ     b   ,     b   _         ]           p   _     ⁡     (     b   _     )                 
And imposing the constraint
 Σ   b εB     p   (   b   )=1, 
E.g. by adding a Lagrange multiplier term provides
 
   
     
       
         
           
             
               p 
               _ 
             
             ⁡ 
             
               ( 
               
                 b 
                 _ 
               
               ) 
             
           
           = 
           
             
               1 
               T 
             
             ⁢ 
             
               
                 ∑ 
                 
                   τ 
                   = 
                   1 
                 
                 T 
               
               ⁢ 
               
                 
                   E 
                   ⁡ 
                   
                     [ 
                     
                       δ 
                       
                         b 
                         , 
                         
                           b 
                           _ 
                         
                       
                     
                     ] 
                   
                 
                 . 
               
             
           
         
       
     
   
   The update rule for M only depends on Q 3 , and hence differentiating this with respect to M yields 
               ∂     ∂     M   _         ⁢       Q   3     ⁡     (       θ   _     |   θ     )         =         ∑     τ   =   1     T     ⁢       E   ⁡     [     n   τ     ]         M   _         -     I   .             
Equating to zero gives the intuitive result,
 
   
     
       
         
           
             M 
             _ 
           
           = 
           
             
               1 
               T 
             
             ⁢ 
             
               
                 ∑ 
                 
                   τ 
                   = 
                   1 
                 
                 T 
               
               ⁢ 
               
                 
                   E 
                   ⁡ 
                   
                     [ 
                     
                       n 
                       τ 
                     
                     ] 
                   
                 
                 . 
               
             
           
         
       
     
   
   At 140 the sufficient statistics are determined. The posterior density is given by 
             p   ⁡     (       h   τ     ,     x   τ   m     ,     n   τ     ,       b   τ     |     X   τ   0       ,   θ     )       =       p   ⁡     (       h   τ     ,     x   τ   m     ,     n   τ     ,     b   τ     ,       X   τ   0     |   θ       )           ∑       b   τ     ∈     H   b         ⁢       ∑       b   τ     ∈   B       ⁢       ∑       n   τ     =   0     ∞     ⁢     ∫       p   ⁡     (       h   τ     ,     x   τ   m     ,     n   τ     ,     b   τ     ,       X   τ   0     |   θ       )       ⁢     ⅆ     x   τ   m                         
Which may be simplified by noticing that if the summations are carried out in the order
 
   
     
       
         
           
             ∑ 
             
               
                 b 
                 τ 
               
               ∈ 
               
                 H 
                 b 
               
             
           
           ⁢ 
           
             
               ∑ 
               
                 
                   b 
                   τ 
                 
                 ∈ 
                 B 
               
             
             ⁢ 
             
               ∑ 
               
                 
                   n 
                   τ 
                 
                 = 
                 0 
               
               ∞ 
             
           
         
       
     
   
   Then certain simplifications may be made. 
   This enables selecting a hypothesis that is consistent with the observed data. 
   A final operation assesses the performance of the model at  430 . 
   After applying all the feature detectors to the training samples, a greedy configuration search may be used to explore different model configurations. In general, configurations with a few different features may be explored. The configuration which yields the smallest training error, that is the smallest probability of misclassification, may be selected. This may be also augmented by one feature trying again all possible types. The best of these augmented models may be retained for subsequent augmentation. The process can be continued until a criterion for model complexity is met. For example, if no further improvement in detection performance is obtained before the maximum number of features is reached, then further operations should be unnecessary. 
   An iterative process may start with a random selection of parts. At each iteration, a test is made to determine whether replacing one model part with a randomly selected part improves or worsens the model. The replacement part is capped when the performance improves, otherwise the process is stopped when no more improvements are possible. This can be done after increasing the total number of parts to the model to determine if additional parts should be added. This may be done by iteratively trying different combinations of small numbers of parts. Each iteration allows the parameters of the underlying probable listed model to be estimated. The iteration continues until the final model is obtained. 
   As an example, a recognition experiment may be carried out on comic strips. In an embodiment, the system attempted to learn the letters E, T, H and L. Two of the learned models are shown in  FIGS. 5A and 5B  which respectively represent the model for the letter B and the model for the letter T. 
   The above has described the model configuration being selected prior to the EM phase. However, this could conceivably require a model to be fit to each possible model configuration. This may be avoided by producing a more generic model. 
   This system has been used to identify handwritten letters e.g. among comic books, recognition of faces within images, representing the rear views of cars, letters, leaves and others. 
   This system may be used for a number of different applications. In a first application, the images may be indexed into image databases. Images may be classified automatically enabling a user to search images that include given objects. For example, a user could show this system can image that includes a frog, and obtain back from at all images that included frogs. 
   Autonomous agents/vehicle/robots could be used. For example, this system could allow a robot to Rome and area and learn all the objects were certain objects are president. The vehicle could then report events that differ from the normal background or find certain things. 
   This system could be used for automated quality control, for example, this system could be shown a number of defective items, and find similar defective items. Similarly, the system could be used to train for dangerous situations. 
   Another application is in toys and entertainments e.g. a robotic device. Finally, visual screening in industries such as the biomedical industry in which quality control applications might be used. 
   Although only a few embodiments have been disclosed in detail above, other modifications are possible. All such modifications are intended to be encompassed within the following claims, in which: