# Patent

## Title
Multi-label multi-instance learning for image classification

## Abstract

Described is a technology by which an image is classified (e.g., grouped and/or labeled), based on multi-label multi-instance data learning-based classification according to semantic labels and regions. An image is processed in an integrated framework into multi-label multi-instance data, including region and image labels. The framework determines local association data based on each region of an image. Other multi-label multi-instance data is based on relationships between region labels of the image, relationships between image labels of the image, and relationships between the region and image labels. These data are combined to classify the image. Training is also described.

## Background
BACKGROUND
With the proliferation of digital photography, automatically classifying images is useful in many applications. To classify an image, the image needs to be semantically understood. Classification is typically formulated as a multi-class or multi-label learning problem.
In a multi-class image classification setting, each image is categorized into one (and only one) category of a set of predefined categories. In other words, only one label is assigned to each image in this setting. In a multi-label setting, which is generally closer to real world applications, each image is assigned one or multiple labels from a predefined label set, such as “sky,” “mountain,” and “water” for a scenery image showing those scenic items.
While multi-class image and solutions are used, both have drawbacks. In general such drawbacks include somewhat poor classification accuracy, as well as classification accuracy that varies depending on the types of images in the dataset.
SUMMARY
This Summary is provided to introduce a selection of representative concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used in any way that would limit the scope of the claimed subject matter.
Briefly, various aspects of the subject matter described herein are directed towards a technology by which an image is classified (e.g., grouped and/or labeled) based on multi-label multi-instance data learning-based classification. An image is processed into multi-label multi-instance data, including determining local association data based on each region of an image. Further, the data is based on relationships between region labels of the image, relationships between image labels of the image, and relationships between the region and image labels. These data are combined to classify the image.
Other advantages may become apparent from the following detailed description when taken in conjunction with the drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
The present invention is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements and in which:
FIG. 1 is a block diagram representing image classification mechanisms, including a multi-label multi-instance classification mechanism.
FIG. 2 is a block diagram representing classification of images via a multi-label multi-instance classification mechanism.
FIG. 3 is a representation of hidden conditional random fields used in modeling multi-label multi-instance learning.
FIG. 4 is a flow diagram showing example steps taken to classify images with a multi-label multi-instance classification mechanism.
FIG. 5 shows an illustrative example of a computing environment into which various aspects of the present invention may be incorporated.



DETAILED DESCRIPTION
Various aspects of the technology described herein are generally directed towards a framework that classifies images based upon a multi-label multi-instance solution. Unlike existing solutions, an integrated multi-label multi-instance learning framework is provided that captures the connections between semantic labels and regions, as well as the correlations among the labels, in a single formulation. The framework is flexible to capture the various dependencies among the regions, such as spatial relations.
As will be understood, the multi-label multi-instance learning framework described herein addresses the intrinsic reason of the multi-label phenomena and directly models the latent semantic meaning of regions. In contrast with techniques that model individual labels independently, multi-label multi-instance learning mechanisms model both the individual labels and their interactions in a manner that is flexible to capture various dependencies among an image's regions.
It should be understood that any examples set forth herein are non-limiting examples. As such, the present invention is not limited to any particular embodiments, aspects, concepts, structures, functionalities or examples described herein. Rather, any of the embodiments, aspects, concepts, structures, functionalities or examples described herein are non-limiting, and the present invention may be used various ways that provide benefits and advantages in computing and image processing in general.
As generally represented in FIG. 1, there is shown a relative comparison of multi-label classification 102, multi-instance classification 103 and, as described herein, multi-label multi-instance classification (e.g., via a mechanism 104). By way of background, an image is typically described by multiple semantic labels whereby image classification is generally formulated as a multi-label learning problem. A typical multi-label classification 102 solution translates the multi-label learning task into a set of single-label classification problems, e.g., by building an individual classifier for each label such that the labels of a new sample are determined by the outputs of these individual classifiers. This strategy treats labels independently and neglects the correlations among labels. However, semantic labels interact with each other naturally. Note that “mountain” (“mtn” in FIG. 1) and “sky” tend to appear together, while “sky” typically does not appear with “indoor”. To exploit these correlations, a contextual fusion step may be performed based on the outputs of the individual classifiers. Other multi-label learning approaches model labels and correlation between labels simultaneously. However, each treat an image as an indiscrete unit and do not capture the semantic meanings of the regions which actually contribute to the multiple labels, and/or cannot model dependencies among the regions.
By way of further background, multi-instance learning-based image classification 103 takes into account the relations between labels and regions. In this solution, an image is regarded as a bag of multiple instances (i.e., regions). When building its classifiers, multi-instance classification 103 only allows labeling images at the image level, instead of labeling at the region level. For a specific semantic label, a bag is labeled positive if at least one instance has the corresponding semantic meaning; otherwise, it is negative. Thus, multi-instance learning depends on which instances contribute to the semantic meaning of the bag-level labels. While different perspectives on contribution have provided different multi-instance learning approaches, they are limited by the single label, and indeed, label correlations are not taken into account in multi-instance learning.
As described above, an image can be described by multiple semantic labels, in which those labels are often closely related to respective regions rather than the entire image. The multi-label multi-instance learning classification mechanism 104 as described herein overcomes the above drawbacks of these prior methods. By together modeling the relations between the labels and regions, as well as the correlations among the multiple labels, the multi-label multi-instance learning classification mechanism 104 solves the multi-label and multi-instance problems in an integrated manner.
FIG. 2 shows a general usage model for multi-label and multi-instance classification mechanism 104. In general, classifiers 220 are trained by a training mechanism 222 based on some training dataset 224; (the dashed line in FIG. 2 suggests that training typically takes place before image classification). The multi-label multi-instance learning classification mechanism 104 uses those classifiers 220 to process images 230 into classes 2231-232n. Note that by classification, it does not necessarily mean “grouping” as shown in FIG. 2, but may alternatively (or additionally) refer to associating region and/or image labels with each image as determined below. As will be understood, by together modeling the relations between the labels and regions, as well as the correlations among the multiple labels, the multi-label multi-instance learning classification mechanism 104 as described herein solves the multi-label and multi-instance problems in an integrated manner.
By way of explanation of joint multi-label multi-instance learning, let X and Y denote the feature and label space, respectively. A training dataset 224 (FIG. 2) is denoted by {(x1,y1), (x2,y2), . . . (xN,yN)} where xiεX indicates a bag (image) of instances (regions) and xi={x1i, x2i, . . . , xR1i}. Note that xji denotes the feature vector of the jth instance, while yi is a K dimensional label vector where [y1i, y2i, . . . , yKi]T and ykiε{+1,−1}. Each entry yki indicates the membership associating xi with the kth label. A general task is to learn a classification function ƒ:X→Y from the training dataset 224. However, the relation between yi and each instance xji is not explicitly indicated in the training data.
Therefore, an intermediate hidden variable hji for xji is introduced herein, where hji is a binary K-dimensional vector indicating the label vector of each instance. Such hidden variables explicitly capture the semantic meanings of the instances and the connection between the instances and the bag labels. As described below and represented in FIG. 3, an aspect referred to as hidden conditional random fields (HCRF) is able to capture such model structure and thus is used to model the multi-label multi-instance learning problem.
For any image, the posterior distribution of the label vector y given the observation x can be obtained by integrating out the latent variables h. Thus, for multi-label multi-instance learning:




  
    
      
        
          
            
              
                p
                ⁡
                
                  (
                  
                    
                      y
                      ❘
                      x
                    
                    ;
                    θ
                  
                  )
                
              
              =
              
              ⁢
              
                
                  ∑
                  h
                
                ⁢
                
                  
                
                ⁢
                
                  p
                  ⁡
                  
                    (
                    
                      y
                      ,
                      
                        
                          h
                          ❘
                          x
                        
                        ;
                        θ
                      
                    
                    )
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  1
                  
                    Z
                    ⁡
                    
                      (
                      x
                      )
                    
                  
                
                ⁢
                
                  
                    ∑
                    h
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    exp
                    ⁢
                    
                      {
                      
                        φ
                        ⁡
                        
                          (
                          
                            y
                            ,
                            h
                            ,
                            
                              x
                              ;
                              θ
                            
                          
                          )
                        
                      
                      }
                    
                    ⁢
                    
                      6
                      ′
                    
                  
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where Z(x)=ΣyΣhexp(φ(y,h,x;θ)) is a partition function. The function φ(y,h,x;θ) is a scale-valued potential function parameterized by θ. For the sake of simplicity, θ is dropped from the formula in the following context.

This probabilistic model allows incorporating the correspondence between labels and regions, the spatial relation of the labels, and the correlations of the labels in a single unified formulation. To encode this information, an overall potential function Φ is decomposed into four component potential functions according to the relationships between those variables:

Φ(y,h,x)=Φa(h,x)+Φs(h,x)+Φhy(h,y)+Φyy(y)  (2)

where φa models the association between hidden labels and the corresponding instances, φs aims to model the spatial dependence among the hidden labels, φhy associates the hidden variables to bag labels, and φyy models the correlation of bag labels. FIG. 3 shows these relationships (association/dependency/correlation) in a hidden conditional random fields representation.

Note that while formula (2) shows a simple addition of the component potential functions, it is understood that other mathematical combinations may be used. For example, functions may be weighed differently relative to one another.
The association between a region and its label, corresponding to one of the association potential functions, is designed for modeling the latent labels of the regions. A local association potential φ(hj,xj) captures the appearance of each region, which is dependent on the jth region only rather than the entire image; it can be modeled by a local soft classifier. Based on the posterior p(hj|xj;λ) from the classifier, the association potential is given by




  
    
      
        
          
            
              
                
                  φ
                  a
                
                ⁡
                
                  (
                  
                    h
                    ,
                    x
                  
                  )
                
              
              =
              
              ⁢
              
                
                  ∑
                  j
                
                ⁢
                
                  
                
                ⁢
                
                  φ
                  ⁡
                  
                    (
                    
                      
                        h
                        j
                      
                      ,
                      
                        x
                        j
                      
                    
                    )
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    ∑
                    j
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    log
                    ⁢
                    
                      
                    
                    ⁢
                    
                      p
                      ⁡
                      
                        (
                        
                          
                            
                              h
                              j
                            
                            ❘
                            
                              x
                              j
                            
                          
                          ;
                          λ
                        
                        )
                      
                    
                    ⁢
                    1
                  
                
                ≤
                j
                ≤
                
                  R
                  ′
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where λ represents the parameters of the classifier and R is the number of regions. In one implementation, the soft classifier is learned using a Support Vector Machine (SVM), (e.g., represented in FIG. 2 as part of the training mechanism 222).

With respect to spatial relation between region labels, this interaction potential function is designed for modeling the spatial dependence between region labels. Intuitively, semantic labels are spatially related. Some labels often occur in the neighboring regions, such as “mountain” and “sky.” Such spatial relations can be exploited to improve classification performance. To this end, there is a defined interaction potential to capture the neighboring relationship of each pair of labels:




  
    
      
        
          
            
              
                
                  Φ
                  β
                
                ⁡
                
                  (
                  
                    h
                    ,
                    x
                  
                  )
                
              
              =
              
              ⁢
              
                
                  ∑
                  
                    m
                    ,
                    n
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    α
                    
                      m
                      ,
                      n
                    
                  
                  ⁢
                  
                    
                      f
                      
                        m
                        ,
                        n
                      
                    
                    ⁡
                    
                      (
                      
                        h
                        ,
                        x
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              
                =
                
                ⁢
                
                  
                    ∑
                    
                      m
                      ,
                      n
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      α
                      
                        m
                        ,
                        n
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          i
                          ,
                          j
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          δ
                          〚
                          
                            
                              h
                              
                                i
                                ,
                                m
                              
                            
                            =
                            1
                          
                          〛
                        
                        ⁢
                        
                          δ
                          〚
                          
                            
                              h
                              
                                j
                                ,
                                n
                              
                            
                            =
                            1
                          
                          〛
                        
                        ⁢
                        
                          δ
                          〚
                          
                            
                              x
                              i
                            
                            ∼
                            
                              x
                              j
                            
                          
                          〛
                        
                      
                    
                  
                
              
              ,
            
          
        
        
          
            
              
              ⁢
              
                m
                ,
                
                  n
                  ∈
                  
                    {
                    
                      1
                      ,
                      
                        2.
                        ..
                      
                      ⁢
                      
                        
                      
                      ,
                      K
                    
                    }
                  
                
                ,
                
                  1
                  ≤
                  i
                  <
                  j
                  ≤
                  R
                
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




where δ is an indicator function that takes on value 1 if the predicate is true and 0 otherwise. The superscript m and n are the label indices. The subscripts i and j are the region indices, and R is the number of regions; him denotes the mth entry of hi, and Xi ̃Xj indicates that region i is adjacent to region j. The weighting parameter is αm,n.

The coherence between region and image labels, that is, as represented by the coherence potential function, is designed for modeling the coherence between image labels and region labels. According to the bag-instance setting, for a specific label, an image is labeled positive if at least one region has the corresponding semantic meaning, otherwise, it is negative. To emphasize the consistency between h and y, the commonly-used Ising model may be employed to formulate φhy(h,y) as γvTy, which penalizes inconsistency between v and y by a cost γ. The vector v is a K dimensional label vector, where the ith entry is defined as:




  
    
      
        
          v
          i
        
        =
        
          {
          
            
              
                
                  
                    +
                    1
                  
                
                
                  
                    
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          ∃
                          
                            1
                            ≤
                            r
                            ≤
                            R
                          
                        
                        ⁢
                        
                          h
                          ri
                        
                      
                    
                    =
                    1
                  
                
              
              
                
                  
                    -
                    1
                  
                
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        ∀
                        
                          1
                          ≤
                          r
                          ≤
                          R
                        
                      
                      ⁢
                      
                        
                          h
                          ri
                        
                        ≠
                        1
                      
                    
                  
                
              
            
            .
          
        
      
    
    
      
        (
        5
        )
      
    
  




With respect to correlating image labels, the correlation potential is designed for modeling the label correlations. In real world scenarios, semantic labels do not exist in isolation. Instead, they appear correlatively and naturally interact with each other at the semantic level. For example, “sheep” and “grass” often appear simultaneously, while “fire” and “water” do not commonly co-occur. These correlations can serve as a useful hint to improve the classification performance. The following potential is defined to exploit such correlations:




  
    
      
        
          
            
              
                
                  Φ
                  yy
                
                ⁡
                
                  (
                  y
                  )
                
              
              =
              
              ⁢
              
                
                  ∑
                  
                    k
                    ,
                    l
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    ∑
                    
                      p
                      ,
                      q
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      μ
                      
                        k
                        ,
                        l
                        ,
                        p
                        ,
                        q
                      
                    
                    ⁢
                    
                      
                        f
                        
                          k
                          ,
                          l
                          ,
                          p
                          ,
                          q
                        
                      
                      ⁡
                      
                        (
                        y
                        )
                      
                    
                  
                
              
            
          
        
        
          
            
              
                =
                
                ⁢
                
                  
                    ∑
                    
                      k
                      ,
                      l
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        p
                        ,
                        q
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        μ
                        
                          k
                          ,
                          l
                          ,
                          p
                          ,
                          q
                        
                      
                      ⁢
                      
                        δ
                        〚
                        
                          
                            y
                            k
                          
                          =
                          p
                        
                        〛
                      
                      ⁢
                      
                        δ
                        〚
                        
                          
                            y
                            l
                          
                          =
                          q
                        
                        〛
                      
                    
                  
                
              
              ,
            
          
        
        
          
            
              
              ⁢
              
                p
                ,
                
                  q
                  ∈
                  
                    {
                    
                      
                        +
                        1
                      
                      ,
                      
                        -
                        1
                      
                    
                    }
                  
                
                ,
                
                  1
                  ≤
                  k
                
                ,
                
                  l
                  ≤
                  K
                
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




where k and l are the label indices, p and q are the binary labels (positive and negative label); μk,l,p,q are weighting parameters.

The potential φyy(y) severs to capture the various possible pairs of labels. Note that both the positive and negative relations are captured with this potential. For example, the label pair “car” and “road” is a positive label pair, while “fire” and “water” is a negative label. Note that high-order correlations may also be modeled, however, the cost of employing such statistics may surpass any benefits because of requiring more training samples to estimate more parameters.
FIG. 4 is an example flow diagram that summarizes the various operations performed by the multi-label multi-instance learning classification mechanism 104, beginning at step 402 where an image is received. Step 402 also represents determining the regions, as well as determining image labels.
Steps 404, 406, 408 and 410 represent obtaining the component potential functions; these steps need not be performed in the order shown, and may be performed at least in part in parallel. Step 404 represents determining the local association potential, while step 406 represents determining the interaction potential based on hidden region labels, both of which are described above. Step 408 represents determining the coherence potential based on region and image labels, while step 410 represents determining the correlation potential based on image labels, both of which are likewise described above.
Step 412 represents computing the overall potential function, such as described above with reference to equation (2). Note however that as also mentioned above, other ways of combining the component functions into an overall result are feasible. The image is thus classified using a multi-label multi-instance classification framework.
Turning to various aspects related to training, parameters in one multi-label multi-instance learning model are estimated by penalized maximum likelihood on a set of training examples {(x1,y1), (x2,y2), . . . (xN,yN)} with respect to the conditional distribution:




  
    
      
        
          
            
              
                L
                ⁡
                
                  (
                  θ
                  )
                
              
              =
              
              ⁢
              
                
                  
                    〈
                    
                      log
                      ⁢
                      
                        
                      
                      ⁢
                      
                        P
                        ⁡
                        
                          (
                          
                            
                              y
                              ❘
                              x
                            
                            ;
                            θ
                          
                          )
                        
                      
                    
                    〉
                  
                  
                    Γ
                    ~
                  
                
                -
                
                  
                    1
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      
                        σ
                        2
                      
                    
                  
                  ⁢
                  
                    
                      
                      θ
                      
                    
                    2
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    〈
                    
                      log
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          ∑
                          h
                        
                        ⁢
                        
                          P
                          ⁡
                          
                            (
                            
                              y
                              ,
                              
                                
                                  h
                                  ❘
                                  x
                                
                                ;
                                θ
                              
                            
                            )
                          
                        
                      
                    
                    〉
                  
                  
                    Γ
                    ~
                  
                
                -
                
                  
                    1
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      
                        σ
                        2
                      
                    
                  
                  ⁢
                  
                    
                      
                      θ
                      
                    
                    2
                  
                
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




where {tilde over (Γ)} denotes the denotes the empirical distribution.  denotes the expectation with respect to distribution {tilde over (Γ)}. i indexes the training sample. The first term in Equation (8) is the log-likelihood of the training data. The second term is a penalization factor to improve the model's generalization ability. It is the log of a Gaussian prior with variance σ2, i.e.,





  
    p
    ⁡
    
      (
      θ
      )
    
  
  ∼
  
    
      exp
      ⁡
      
        (
        
          
            -
            
              1
              
                2
                ⁢
                
                  
                
                ⁢
                
                  σ
                  2
                
              
            
          
          ⁢
          
            
              
              θ
              
            
            2
          
        
        )
      
    
    .
  




However, it is difficult to optimize L(θ) directly. Instead, an Expectation Maximization (EM) algorithm may be used to solve this optimization problem as follows.

E-Step: Given the current tth step parameter estimation θ(t), the Q-function (i.e., the expected value of L(θ) under the current parameter estimates) can be written as:




  
    
      
        
          Q
          ⁡
          
            (
            
              θ
              ,
              
                θ
                
                  (
                  t
                  )
                
              
            
            )
          
        
        =
        
          <
          
            
              E
              
                
                  h
                  ❘
                  y
                
                ,
                
                  x
                  ;
                  
                    θ
                    
                      (
                      t
                      )
                    
                  
                
              
            
            ⁢
            
              log
              (
              
                
                  
                    p
                    ⁡
                    
                      (
                      
                        y
                        ,
                        
                          
                            h
                            ❘
                            x
                          
                          ;
                          θ
                        
                      
                      )
                    
                  
                  ⁢
                  
                    >
                    
                      Γ
                      ~
                    
                  
                  ⁢
                  
                    
                      -
                      
                        1
                        
                          2
                          ⁢
                          
                            
                          
                          ⁢
                          
                            σ
                            2
                          
                        
                      
                    
                    ⁢
                    
                      
                        
                        θ
                        
                      
                      2
                    
                  
                
                ,
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




where Eh|y,x;θ(t) is the expectation operator given the concurrent estimated conditional probability p(h|y,x;θ(t)).

M-Step: A new parameter vector θ(t+1) is updated by maximizing the Q-function:




  
    
      
        
          θ
          
            (
            
              t
              +
              1
            
            )
          
        
        =
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              max
            
            θ
          
          ⁢
          
            
              Q
              ⁡
              
                (
                
                  θ
                  ,
                  
                    θ
                    
                      (
                      t
                      )
                    
                  
                
                )
              
            
            .
          
        
      
    
    
      
        (
        9
        )
      
    
  




The derivatives of Q-function with respect to its parameters are:





  
  ⁢
  
    
      
        
          
            
              
                
                ⁢
                
                  
                    
                      ∂
                      Q
                    
                    
                      ∂
                      γ
                    
                  
                  =
                  
                    <
                    
                      
                        E
                        
                          
                            h
                            ❘
                            y
                          
                          ,
                          
                            x
                            ;
                            
                              θ
                              
                                (
                                t
                                )
                              
                            
                          
                        
                      
                      ⁢
                      
                        v
                        T
                      
                      ⁢
                      y
                    
                    ⁢
                    
                      >
                      
                        Γ
                        ~
                      
                    
                    ⁢
                    
                      -
                      
                        <
                        
                          
                            v
                            T
                          
                          ⁢
                          y
                        
                        ⁢
                        
                          >
                          Γ
                        
                        ⁢
                        
                          
                            -
                            
                              1
                              
                                σ
                                2
                              
                            
                          
                          ⁢
                          γ
                        
                      
                    
                  
                
              
            
          
          
            
              
                
                ⁢
                
                  
                    
                      ∂
                      Q
                    
                    
                      ∂
                      
                        α
                        
                          m
                          ,
                          n
                        
                      
                    
                  
                  =
                  
                    <
                    
                      
                        E
                        
                          
                            h
                            ❘
                            y
                          
                          ,
                          
                            x
                            ;
                            
                              θ
                              
                                (
                                t
                                )
                              
                            
                          
                        
                      
                      ⁢
                      
                        f
                        
                          m
                          ,
                          n
                        
                      
                    
                    ⁢
                    
                      >
                      
                        Γ
                        ~
                      
                    
                    ⁢
                    
                      -
                      
                        <
                        
                          f
                          
                            m
                            ,
                            n
                          
                        
                        ⁢
                        
                          >
                          Γ
                        
                        ⁢
                        
                          
                            -
                            
                              1
                              
                                σ
                                2
                              
                            
                          
                          ⁢
                          
                            α
                            
                              m
                              ,
                              n
                            
                          
                        
                      
                    
                  
                
              
            
          
          
            
              
                
                  
                    
                      ∂
                      Q
                    
                    
                      ∂
                      
                        μ
                        
                          k
                          ,
                          l
                          ,
                          p
                          ,
                          q
                        
                      
                    
                  
                  =
                  
                    <
                    
                      
                        E
                        
                          
                            h
                            ❘
                            y
                          
                          ,
                          
                            x
                            ;
                            
                              θ
                              
                                (
                                t
                                )
                              
                            
                          
                        
                      
                      ⁢
                      
                        f
                        
                          k
                          ,
                          l
                          ,
                          p
                          ,
                          q
                        
                      
                    
                    ⁢
                    
                      >
                      
                        Γ
                        ~
                      
                    
                    ⁢
                    
                      -
                      
                        <
                        
                          f
                          
                            k
                            ,
                            l
                            ,
                            p
                            ,
                            q
                          
                        
                        ⁢
                        
                          >
                          Γ
                        
                        ⁢
                        
                          
                            -
                            
                              1
                              
                                σ
                                2
                              
                            
                          
                          ⁢
                          
                            μ
                            
                              k
                              ,
                              l
                              ,
                              p
                              ,
                              q
                            
                          
                        
                      
                    
                  
                
                ,
              
            
          
        
      
      
        
          (
          10
          )
        
      
    
  




where Γ is the model distribution.

Given the above derivatives, a gradient-based algorithm may be used to maximize Q(θ,θ(t)). However, such a procedure requires computing the expectation under model distribution, which is NP-hard due to the partition function. To overcome this difficulty, various approximate inference algorithms can be used. One such solution is a sampling-based method such as Markov chain Monte Carlo (MCMC); however, sampling-based methods may take a large number of iterations to converge. Instead, a contrastive divergence (CD) algorithm is used, which only needs to take a few steps in the Markov chain to approximate the gradients. This property of contrastive divergence often leads to significant savings, particularly when the inference algorithm will be repeatedly invoked during the model training.
With respect to inference, given a new image x, the inference is to find the optimal label configuration y. A widely-used criteria for inferring labels from the posterior distribution is Maximum Posterior Marginal (MPM), which is adopted herein. The computation of MPM requires marginalization over a large number of variables, which is generally NP-hard. To address this difficulty, a frequently-used approximate inference method is adopted, Gibbs sampling, because of its fast convergence. A reasonable initial point for the sampling can be obtained by considering the outputs of the local classifier. Using a similar approach, the region label vector h is estimated.
As can be seen, there is provided a multi-label multi-instance learning framework for image classification. The framework models both the relation between semantic labels and regions and the correlations among the labels in an integrated manner. Also, the framework works with dependence between regions, such as the spatial configuration of the region labels. Testing shows that the framework provides high classification accuracy on the image and region level, and is robust to different datasets.
Exemplary Operating Environment
FIG. 5 illustrates an example of a suitable computing and networking environment 500 on which the examples and/or implementations of FIGS. 1-4 may be implemented. The computing system environment 500 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 500 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 500.
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to: personal computers, server computers, hand-held or laptop devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, embedded systems, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, and so forth, which perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in local and/or remote computer storage media including memory storage devices.
With reference to FIG. 5, an exemplary system for implementing various aspects of the invention may include a general purpose computing device in the form of a computer 510. Components of the computer 510 may include, but are not limited to, a processing unit 520, a system memory 530, and a system bus 521 that couples various system components including the system memory to the processing unit 520. The system bus 521 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.
The computer 510 typically includes a variety of computer-readable media. Computer-readable media can be any available media that can be accessed by the computer 510 and includes both volatile and nonvolatile media, and removable and non-removable media. By way of example, and not limitation, computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by the computer 510. Communication media typically embodies computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above may also be included within the scope of computer-readable media.
The system memory 530 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 531 and random access memory (RAM) 532. A basic input/output system 533 (BIOS), containing the basic routines that help to transfer information between elements within computer 510, such as during start-up, is typically stored in ROM 531. RAM 532 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 520. By way of example, and not limitation, FIG. 5 illustrates operating system 534, application programs 535, other program modules 536 and program data 537.
The computer 510 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only, FIG. 5 illustrates a hard disk drive 541 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 551 that reads from or writes to a removable, nonvolatile magnetic disk 552, and an optical disk drive 555 that reads from or writes to a removable, nonvolatile optical disk 555 such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 541 is typically connected to the system bus 521 through a non-removable memory interface such as interface 540, and magnetic disk drive 551 and optical disk drive 555 are typically connected to the system bus 521 by a removable memory interface, such as interface 550.
The drives and their associated computer storage media, described above and illustrated in FIG. 5, provide storage of computer-readable instructions, data structures, program modules and other data for the computer 510. In FIG. 5, for example, hard disk drive 541 is illustrated as storing operating system 544, application programs 545, other program modules 545 and program data 547. Note that these components can either be the same as or different from operating system 534, application programs 535, other program modules 535, and program data 537. Operating system 544, application programs 545, other program modules 545, and program data 547 are given different numbers herein to illustrate that, at a minimum, they are different copies. A user may enter commands and information into the computer 510 through input devices such as a tablet, or electronic digitizer, 554, a microphone 553, a keyboard 552 and pointing device 551, commonly referred to as mouse, trackball or touch pad. Other input devices not shown in FIG. 5 may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 520 through a user input interface 550 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 591 or other type of display device is also connected to the system bus 521 via an interface, such as a video interface 590. The monitor 591 may also be integrated with a touch-screen panel or the like. Note that the monitor and/or touch screen panel can be physically coupled to a housing in which the computing device 510 is incorporated, such as in a tablet-type personal computer. In addition, computers such as the computing device 510 may also include other peripheral output devices such as speakers 595 and printer 595, which may be connected through an output peripheral interface 594 or the like.
The computer 510 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 580. The remote computer 580 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 510, although only a memory storage device 581 has been illustrated in FIG. 5. The logical connections depicted in FIG. 5 include one or more local area networks (LAN) 571 and one or more wide area networks (WAN) 573, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, the computer 510 is connected to the LAN 571 through a network interface or adapter 570. When used in a WAN networking environment, the computer 510 typically includes a modem 572 or other means for establishing communications over the WAN 573, such as the Internet. The modem 572, which may be internal or external, may be connected to the system bus 521 via the user input interface 550 or other appropriate mechanism. A wireless networking component 574 such as comprising an interface and antenna may be coupled through a suitable device such as an access point or peer computer to a WAN or LAN. In a networked environment, program modules depicted relative to the computer 510, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 5 illustrates remote application programs 585 as residing on memory device 581. It may be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
An auxiliary subsystem 599 (e.g., for auxiliary display of content) may be connected via the user interface 550 to allow data such as program content, system status and event notifications to be provided to the user, even if the main portions of the computer system are in a low power state. The auxiliary subsystem 599 may be connected to the modem 572 and/or network interface 570 to allow communication between these systems while the main processing unit 520 is in a low power state.
CONCLUSION
While the invention is susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the invention to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention.

## Claims

1. In a computing environment, a method comprising:
classifying an image, including obtaining image label data corresponding to the image, obtaining hidden region label data corresponding to regions in the image, and combining the image label data and the hidden region label data to classify the image, wherein obtaining the image label data comprises at least one of determining a coherence potential based on relationships between hidden region labels and image labels or determining a correlation potential based on relationships between the image labels.

2. The method of claim 1 wherein obtaining the hidden region label data comprises determining a local association potential of each region.

3. The method of claim 1 wherein obtaining the hidden region label data comprises determining an interaction potential based on relationships between hidden region labels.

4. The method of claim 1 wherein obtaining the image label data comprises obtaining one or more image labels, and wherein obtaining the hidden region label data comprises obtaining hidden region labels.

5. The method of claim 1 wherein obtaining the hidden region label data comprises determining a local association potential of each region and determining an interaction potential based on relationships between the hidden region labels.

6. The method of claim 1 wherein obtaining the image label data comprises obtaining one or more image labels and determining a correlation potential based on relationships between image labels, and further comprising determining a coherence potential based on relationships between the region and image labels, and wherein combining the image label data and hidden region label data comprises mathematically combining the local association potential, the interaction potential, the correlation potential and the coherence potential.

7. The method of claim 6 wherein mathematically combining comprises adding the local association potential, the interaction potential, the correlation potential and the coherence potential.

8. The method of claim 6 wherein mathematically combining comprises determining a weight for each potential, and using the weights in adding the local association potential, the interaction potential, the correlation potential and the coherence potential.

9. The method of claim 1 further comprising, training at least one classifier used in obtaining the image label data or the hidden region label data.

10. In a computing environment, a system comprising:
at least one classifier;
a multi-label multi-instance learning classification mechanism configured to classify an image using the at least one classifier, wherein the at least one classifier is configured to obtain image label data corresponding to the image and to obtain hidden region label data corresponding to regions in the image, wherein the mechanism is configured to combine the image label data and the hidden region label data to classify the image, and wherein the at least one classifier is further configured to determine at a correlation potential based on relationships between image labels.

11. The system of claim 10 wherein the mechanism is configured to obtain the hidden region label data by using the at least one classifier to determine a local association potential of each region and determining an interaction potential based on relationships between hidden region labels.

12. The system of claim 10 wherein the mechanism is configured to obtain the image label data and the hidden region label data by using the at least one classifier to determine image and hidden region labels, the mechanism further configured to determine a coherence potential based on relationships between the region and image labels.

13. The system of claim 10 wherein the mechanism is configured to obtain the image label data and the hidden region label data comprising a coherence potential based on relationships between the region and image labels, a local association potential of each region, an interaction potential based on relationships between hidden region labels, and a correlation potential based on relationships between image labels.

14. The system of claim 13 wherein the mechanism is configured to classify the image based on a mathematical combination of the local association potential, the interaction potential, the correlation potential and the coherence potential into an overall potential.

15. The system of claim 14 wherein the mechanism is further configured to mathematically combine the local association potential, the interaction potential, the correlation potential and the coherence potential into an overall potential by determining a weight for each potential, and using the weights in adding the local association potential, the interaction potential, the correlation potential and the coherence potential.

16. The system of claim 10 further comprising, training means coupled to the multi-label multi-instance learning classification mechanism.

17. One or more tangible computer-readable storage media storing computer-executable instructions, which when executed perform steps, comprising:
processing an image into multi-label, multi-instance data, including determining a local association potential based on each region of an image, determining an interaction potential based on relationships between hidden region labels of the image, determining a correlation potential based on relationships between image labels of the image, and determining a coherence potential based on relationships between the region and image labels; and
combining the local association potential, the interaction potential, the correlation potential and the coherence potential to classify the image.

18. The one or more tangible computer-readable storage media of claim 17 storing further computer-executable instructions comprising, associating one or more labels with the image to classify the image.

19. The one or more tangible computer-readable storage media of claim 17 storing further computer-executable instructions comprising, training at least one classifier to provide at least part of the multi-label, multi-instance data.

20. The one or more tangible computer-readable storage media of claim 19 wherein training comprises using at least one approximate inference method.