Constellation model explained

The constellation model is a probabilistic, generative model for category-level object recognition in computer vision. Like other part-based models, the constellation model attempts to represent an object class by a set of N parts under mutual geometric constraints. Because it considers the geometric relationship between different parts, the constellation model differs significantly from appearance-only, or "bag-of-words" representation models, which explicitly disregard the location of image features.

The problem of defining a generative model for object recognition is difficult. The task becomes significantly complicated by factors such as background clutter, occlusion, and variations in viewpoint, illumination, and scale. Ideally, we would like the particular representation we choose to be robust to as many of these factors as possible.

In category-level recognition, the problem is even more challenging because of the fundamental problem of intra-class variation. Even if two objects belong to the same visual category, their appearances may be significantly different. However, for structured objects such as cars, bicycles, and people, separate instances of objects from the same category are subject to similar geometric constraints. For this reason, particular parts of an object such as the headlights or tires of a car still have consistent appearances and relative positions. The Constellation Model takes advantage of this fact by explicitly modeling the relative location, relative scale, and appearance of these parts for a particular object category. Model parameters are estimated using an unsupervised learning algorithm, meaning that the visual concept of an object class can be extracted from an unlabeled set of training images, even if that set contains "junk" images or instances of objects from multiple categories. It can also account for the absence of model parts due to appearance variability, occlusion, clutter, or detector error.

History

The idea for a "parts and structure" model was originally introduced by Fischler and Elschlager in 1973.^[1] This model has since been built upon and extended in many directions. The Constellation Model, as introduced by Dr. Perona and his colleagues, was a probabilistic adaptation of this approach.

In the late '90s, Burl et al.^{[2] [3] [4] [5]} revisited the Fischler and Elschlager model for the purpose of face recognition. In their work, Burl et al. used manual selection of constellation parts in training images to construct a statistical model for a set of detectors and the relative locations at which they should be applied. In 2000, Weber et al. ^{[6] [7] [8] [9]} made the significant step of training the model using a more unsupervised learning process, which precluded the necessity for tedious hand-labeling of parts. Their algorithm was particularly remarkable because it performed well even on cluttered and occluded image data. Fergus et al.^{[10] [11]} then improved upon this model by making the learning step fully unsupervised, having both shape and appearance learned simultaneously, and accounting explicitly for the relative scale of parts.

The method of Weber and Welling et al.

In the first step, a standard interest point detection method, such as Harris corner detection, is used to generate interest points. Image features generated from the vicinity of these points are then clustered using k-means or another appropriate algorithm. In this process of vector quantization, one can think of the centroids of these clusters as being representative of the appearance of distinctive object parts. Appropriate feature detectors are then trained using these clusters, which can be used to obtain a set of candidate parts from images.

As a result of this process, each image can now be represented as a set of parts. Each part has a type, corresponding to one of the aforementioned appearance clusters, as well as a location in the image space.

Basic generative model

Weber & Welling here introduce the concept of foreground and background. Foreground parts correspond to an instance of a target object class, whereas background parts correspond to background clutter or false detections.

Let T be the number of different types of parts. The positions of all parts extracted from an image can then be represented in the following "matrix,"

X ^{o} = \begin{pmatrix} x _{11} ,x _{12} ,{ … } ,x _{1 N _{1}} \\ x _{21} ,x _{22} ,{ … } ,x _{2 N _{2}} \\ \vdots \\ x _{T1} ,x _{T2} ,{ … } ,x _{TN _{T}} \end{pmatrix}

where

N _{i} represents the number of parts of type i \in \{ 1 , ... ,T\} observed in the image. The superscript o indicates that these positions are observable, as opposed to missing. The positions of unobserved object parts can be represented by the vector x ^{m} . Suppose that the object will be composed of F distinct foreground parts. For notational simplicity, we assume here that F = T , though the model can be generalized to F > T . A hypothesis h is then defined as a set of indices, with h _{i} = j , indicating that point x _{ij} is a foreground point in X ^{o} . The generative probabilistic model is defined through the joint probability density p(X ^{o,x} ^{m,h)} .

Model details

The rest of this section summarizes the details of Weber & Welling's model for a single component model. The formulas for multiple component models are extensions of those described here.

To parametrize the joint probability density, Weber & Welling introduce the auxiliary variables

b and n , where b is a binary vector encoding the presence/absence of parts in detection (b _{i} = 1 if h _{i} > 0 , otherwise b _{i} = 0 ), and n is a vector where n _{i} denotes the number of background candidates included in the i ^{th} row of X ^{o} . Since b and n are completely determined by h and the size of X ^{o} , we have p(X ^{o,x} ^{m,h)} = p(X ^{o,x} ^{m,h,n,b)} . By decomposition,p(X ^{o,x} ^{m,h,n,b)} = p(X ^{o,x} ^{m|h,n,b)p(h|n,b)p(n)p(b)}

The probability density over the number of background detections can be modeled by a Poisson distribution,

p(n) = \prod ^{T} _{i =1} (1)/(n _{i!}) (M ^{n _{i}} _{i)} e ^{- M _{i}}

where

M _{i} is the average number of background detections of type i per image.

Depending on the number of parts

F , the probability p(b) can be modeled either as an explicit table of length 2 ^{F} , or, if F is large, as F independent probabilities, each governing the presence of an individual part.

The density

p(h|n,b) is modeled byp(h|n,b) = \begin{cases} (1)/(style \prod ^{F} _{f =1} N ^{b _{f}} _{f}) , & if h \in H(b,n) \\ 0 , & forother h \end{cases}

where

H(b,n) denotes the set of all hypotheses consistent with b and n , and N _{f} denotes the total number of detections of parts of type f . This expresses the fact that all consistent hypotheses, of which there are style \prod ^{F} _{f =1} N ^{b _{f}} _{f} , are equally likely in the absence of information on part locations.

And finally,

p(X ^{o,x} ^{m|h,n)} = p _{fg} (z)p _{bg} (x _{bg} )

where

z = (x ^{ox} ^{m)} are the coordinates of all foreground detections, observed and missing, and x _{bg} represents the coordinates of the background detections. Note that foreground detections are assumed to be independent of the background. p _{fg} (z) is modeled as a joint Gaussian with mean \mu and covariance \Sigma .

Classification

The ultimate objective of this model is to classify images into classes "object present" (class

C _{1} ) and "object absent" (class C _{0} ) given the observation X ^{o} . To accomplish this, Weber & Welling run part detectors from the learning step exhaustively over the image, examining different combinations of detections. If occlusion is considered, then combinations with missing detections are also permitted. The goal is then to select the class with maximum a posteriori probability, by considering the ratio(p(C ^{o)} _{1 |X})/(p(C ^{o)} _{0 |X}) \propto (\sum _{h} p(X ^{o,h|C} _{1 )})/(p(X ^{o,h} _{0 |C} _{0)})

where

h _{0} denotes the null hypothesis, which explains all parts as background noise. In the numerator, the sum includes all hypotheses, including the null hypothesis, whereas in the denominator, the only hypothesis consistent with the absence of an object is the null hypothesis. In practice, some threshold can be defined such that, if the ratio exceeds that threshold, we then consider an instance of an object to be detected.

Model learning

After the preliminary step of interest point detection, feature generation and clustering, we have a large set of candidate parts over the training images. To learn the model, Weber & Welling first perform a greedy search over possible model configurations, or equivalently, over potential subsets of the candidate parts. This is done in an iterative fashion, starting with random selection. At subsequent iterations, parts in the model are randomly substituted, the model parameters are estimated, and the performance is assessed. The process is complete when further model performance improvements are no longer possible.

At each iteration, the model parameters

\Theta = \{\mu, \Sigma, p(b), M\}

are estimated using expectation maximization.

\mu and \Sigma , we recall, are the mean and covariance of the joint Gaussian p _{fg} (z) , p(b) is the probability distribution governing the binary presence/absence of parts, and M is the mean number of background detections over part types.

M-step

EM proceeds by maximizing the likelihood of the observed data,

L(X ^{o|\Theta)} = \sum ^{I} _{i =1} log \sum _{h _{i}} \int p(X ^{m,h} _{i|\Theta)dx} ^{m} ^{i}

with respect to the model parameters

\Theta . Since this is difficult to achieve analytically, EM iteratively maximizes a sequence of cost functions,Q(\tilde{\Theta}|\Theta) = \sum ^{I} _{i =1} E[ log p(X ^{m,h} _{i|\tilde{\Theta})]}

Taking the derivative of this with respect to the parameters and equating to zero produces the update rules:

\tilde{\mu} = (1)/(I) \sum ^{I} _{i =1} E[z _{i]} \tilde{\Sigma} = (1)/(I) \sum ^{I} _{i =1} E[z _{iz} ^{T]} ^{i} - \tilde{\mu}\tilde{\mu} ^{T} \tilde{p}(\bar{b}) = (1)/(I) \sum ^{I} _{i =1} E[\delta _{b,\bar{b} }]\tilde{M} = (1)/(I) \sum ^{I} _{i =1} E[n _{i]}

E-step

The update rules in the M-step are expressed in terms of sufficient statistics,

E[z] , E[zz ^{T]} , E[\delta _{b,\bar{b} }]\, and E[n] , which are calculated in the E-step by considering the posterior density:p(h _{i,x} ^{o,\Theta)} ^{i} = (p(h _{i,x} ^{o|\Theta)} ^{i})/(style \sum _{h _{i} \in H _{b}} \int p(h _{i,x} ^{o|\Theta)} ^{i} dx ^{m} _{i})

The method of Fergus et al.

In Weber et al., shape and appearance models are constructed separately. Once the set of candidate parts had been selected, shape is learned independently of appearance. The innovation of Fergus et al. is to learn not only two, but three model parameters simultaneously: shape, appearance, and relative scale. Each of these parameters are represented by Gaussian densities.

Feature representation

Whereas the preliminary step in the Weber et al. method is to search for the locations of interest points, Fergus et al. use the detector of Kadir and Brady^[12] to find salient regions in the image over both location (center) and scale (radius). Thus, in addition to location information

X this method also extracts associated scale information S . Fergus et al. then normalize the squares bounding these circular regions to 11 x 11 pixel patches, or equivalently, 121-dimensional vectors in the appearance space. These are then reduced to 10-15 dimensions by principal component analysis, giving the appearance information A .

Model structure

Given a particular object class model with parameters

\Theta , we must decide whether or not a new image contains an instance of that class. This is accomplished by making a Bayesian decision,R = (p( Object |X,S,A))/(p( Noobject |X,S,A)) = (p(X,S,A| Object )p( Object ))/(p(X,S,A| Noobject )p( Noobject )) ≈ (p(X,S,A|\Theta)p( Object ))/(p(X,S,A|\Theta _{bg} )p( Noobject ))

where

\Theta _{bg} is the background model. This ratio is compared to a threshold T to determine object presence/absence.

The likelihoods are factored as follows:

p(X,S,A|\Theta) = \sum _{h} p(X,S,A,h|\Theta) = \sum _{h} \underbrace{ p(A|X,S,h,\Theta) } _{Appearance} \underbrace{ p(X|S,h,\Theta) } _{Shape} \underbrace{ p(S|h,\Theta) } _{Rel.Scale} \underbrace{ p(h|\Theta) } _{Other}

Appearance

Each part

p has an appearance modeled by a Gaussian density in the appearance space, with mean and covariance parameters \Theta ^{app} _{p} = \{c _{p,V} _{p\}} , independent of other parts' densities. The background model has parameters \Theta ^{app} _{bg} = \{c _{bg} ,V _{bg} \} . Fergus et al. assume that, given detected features, the position and appearance of those features are independent. Thus, p(A|X,S,h,\Theta) = p(A|h,\Theta) . The ratio of the appearance terms reduces to(p(A|X,S,h,\Theta))/(p(A|X,S,h,\Theta _{bg} )) = (p(A|h,\Theta))/(p(A|h,\Theta _{bg} )) = \prod ^{P} _{p =1} \left ( (G(A(h _{p)|c} _{p,V} _{p)})/(G(A(h _{p)|c} _{bg} ,V _{bg} )) \right ) ^{b _{p}}

Recall from Weber et al. that

h is the hypothesis for the indices of foreground parts, and b is the binary vector giving the occlusion state of each part in the hypothesis.

Shape

Shape is represented by a joint Gaussian density of part locations within a particular hypothesis, after those parts have been transformed into a scale-invariant space. This transformation precludes the need to perform an exhaustive search over scale. The Gaussian density has parameters

\Theta ^{shape} = \{\mu,\Sigma\} . The background model \Theta _{bg} is assumed to be a uniform distribution over the image, which has area \alpha . Letting f be the number of foreground parts,(p(X|S,h,\Theta))/(p(X|S,h,\Theta _{bg} )) = G(X(h)|\mu,\Sigma)\alpha ^{f}

Relative scale

The scale of each part

p relative to a reference frame is modeled by a Gaussian density with parameters \Theta ^{scale} = \{t _{p,U} _{p\}} . Each part is assumed to be independent of other parts. The background model \Theta _{bg} assumes a uniform distribution over scale, within a range r .(p(S|h,\Theta))/(p(S|h,\Theta _{bg} )) = \prod ^{P} _{p =1} G(S(h _{p)|t} _{p,U} ^{d _{p}} ^{p)} r ^{f}

Occlusion and statistics of feature detection

(p(h|\Theta))/(p(h|\Theta _{bg} )) = (p _{Poiss} (n|M))/(p _{Poiss} (N|M)) (1)/(^{nC} ^{r(N,f)}) p(b|\Theta)

The first factor models the number of features detected using a Poisson distribution, which has mean M. The second factor serves as a "book-keeping" factor for the hypothesis variable. The last factor is a probability table for all possible occlusion patterns.

Learning

The task of learning the model parameters

\Theta = \{\mu,\Sigma,c,V,M,p(b|\Theta),t,U\} is accomplished by expectation maximization. This is carried out in a spirit similar to that of Weber et al. Details and formulas for the E-step and M-step can be seen in the literature.

Performance

The Constellation Model as conceived by Fergus et al. achieves successful categorization rates consistently above 90% on large datasets of motorbikes, faces, airplanes, and spotted cats.^[13] For each of these datasets, the Constellation Model is able to capture the "essence" of the object class in terms of appearance and/or shape. For example, face and motorbike datasets generate very tight shape models because objects in those categories have very well-defined structure, whereas spotted cats vary significantly in pose, but have a very distinctive spotted appearance. Thus, the model succeeds in both cases. It is important to note that the Constellation Model does not generally account for significant changes in orientation. Thus, if the model is trained on images of horizontal airplanes, it will not perform well on, for instance, images of vertically oriented planes unless the model is extended to account for this sort of rotation explicitly.

In terms of computational complexity, the Constellation Model is very expensive. If

N is the number of feature detections in the image, and P the number of parts in the object model, then the hypothesis space H is O(N ^{P)} . Because the computation of sufficient statistics in the E-step of expectation maximization necessitates evaluating the likelihood for every hypothesis, learning becomes a major bottleneck operation. For this reason, only values of P \le 6 have been used in practical applications, and the number of feature detections N is usually kept within the range of about 20-30 per image.

Variations

One variation that attempts to reduce complexity is the star model proposed by Fergus et al.^[14] The reduced dependencies of this model allows for learning in

O(N ^{2P)} time instead of O(N ^{P)} . This allows for a greater number of model parts and image features to be used in training. Because the star model has fewer parameters, it is also better at avoiding the problem of over-fitting when trained on fewer images.

External links

• L. Fei-fei. Object categorization: the constellation models. Lecture Slides. (2005) (link not working)

See also

• Part-based models
• One-shot learning in computer vision

Notes and References

1. The Representation and Matching of Pictorial Structures . 10.1109/T-C.1973.223602 . 1973 . Fischler . M.A. . Elschlager . R.A. . IEEE Transactions on Computers . 1 . 67–92 . 14554383 .
2. ftp://vision.caltech.edu/pub/tech-reports-vision/IWAFGR95.ps.Z M. Burl, T. Leung, and P. Perona. Face Localization via Shape Statistics. (1995)
3. ftp://vision.caltech.edu/pub/tech-reports-vision/ICCV95-faces.ps.Z T. Leung, M. Burl, and P. Perona. Finding Faces in Cluttered Scenes Using Random Labeled Graph Matching. (1995)
4. ftp://vision.caltech.edu/pub/tech-reports-vision/CVPR96-recog.ps.gz M. Burl and P. Perona. Recognition of Planar Object Classes (1996)
5. http://www.vision.caltech.edu/publications/ECCV98-recog.pdf M. Burl, M. Weber, and P. Perona. A Probabilistic Approach to Object Recognition Using Local Photometry and Global Geometry (1998)
6. http://www.vision.caltech.edu/publications/MarkusWeber-thesis.pdf M. Weber. Unsupervised Learning of Models for Object Recognition. PhD Thesis. (2000)
7. ftp://vision.caltech.edu/pub/tech-reports/FG00-recog.pdf M. Weber, W. Einhaeuser, M. Welling and P. Perona. Viewpoint-Invariant Learning and Detection of Human Heads. (2000)
8. ftp://vision.caltech.edu/pub/tech-reports/CVPR00-recog.pdf M. Weber, M. Welling, and P. Perona. Towards Automatic Discovery of Object Categories. (2000)
9. ftp://vision.caltech.edu/pub/tech-reports/ECCV00-recog.pdf M. Weber, M. Welling and P. Perona. Unsupervised Learning of Models for Recognition. (2000)
10. ftp://vision.caltech.edu/pub/tech-reports/Fergus_CVPR03.pdf R. Fergus, P. Perona, and A. Zisserman. Object Class Recognition by Unsupervised Scale-Invariant Learning. (2003)
11. http://cs.nyu.edu/~fergus/papers/fergus_thesis.pdf R. Fergus. Visual Object Category Recognition. PhD Thesis. (2005)
12. Saliency, Scale and Image Description . 10.1023/A:1012460413855 . 2001 . Kadir . Timor . Brady . Michael . International Journal of Computer Vision . 45 . 2 . 83–105 . 825395 .
13. http://www.vision.caltech.edu/html-files/archive.html R. Fergus and P. Perona. Caltech Object Category datasets. http://www.vision.caltech.edu/html-files/archive.html (2003)
14. http://www.robots.ox.ac.uk/%7Efergus/papers/fergus_cvpr05.pdf R. Fergus, P. Perona, and A. Zisserman. A Sparse Object Category Model for Efficient Learning and Exhaustive Recognition. (2005)