IEEE International Conference on Computer Vision (ICCV), 2011, Barcelona.

Semi-supervised Learning and Optimization for Hypergraph Matching Marius Leordeanu1 , Andrei Zanfir1 , Cristian Sminchisescu1,2 1 Institute of Mathematics of the Romanian Academy 2 Faculty of Mathematics and Natural Science, University of Bonn [email protected], [email protected], [email protected]

Abstract Graph and hypergraph matching are important problems in computer vision. They are successfully used in many applications requiring 2D or 3D feature matching, such as 3D reconstruction and object recognition. While graph matching is limited to using pairwise relationships, hypergraph matching permits the use of relationships between sets of features of any order. Consequently, it carries the promise to make matching more robust to changes in scale, deformations and outliers. In this paper we make two contributions. First, we present a first semi-supervised algorithm for learning the parameters that control the hypergraph matching model and demonstrate experimentally that it significantly improves the performance of current state-of-the-art methods. Second, we propose a novel efficient hypergraph matching algorithm, which outperforms the state-of-the-art, and, when used in combination with other higher-order matching algorithms, it consistently improves their performance.

1. Introduction Graph and hypergraph matching are important problems in computer vision, and are used in many applications that require 2D and 3D feature matching, such as 3D reconstruction and object recognition. As opposed to the classical graph matching formulation, which is limited to pairwise constraints, hypergraph matching permits the use of higher-order relationships on sets of features. Many recent papers focus on solving the graph matching problem using second-order constraints [1, 6, 8, 12, 14, 11, 5], but only a few have investigated approaches for learning the graph matching model [3, 10]. Hypergraph matching has recently received attention in computer vision [7, 4, 15] due to its ability to handle more difficult scenarios than the more classical pairwise matching approach. To our knowledge, this is the first paper that offers a semi-supervised learning formulation for hypergraph matching, for models with constraints beyond second order. We make two contributions: first, we present a novel

Figure 1. Illustration of our hypergraph matching method versus standard graph matching. By using both geometry and appearance in a scale invariant model, hypergraph matching is superior to graph matching.

semi-supervised learning algorithm that significantly improves the matching accuracy of current state of the art methods; second, we present a novel method for hypergraph matching that is both fast and accurate and outperforms in our experiments the current state-of-the-art. We also show that our matching method can also be used as a post-processing, refinement procedure on initial solutions produced by other algorithms, to further improve their accuracy. Although the methods we present can be applied, in prin1

ciple, to hypergraph matching models of any order, often in practice third-order constraints offer a good compromise between efficiency and the ability to capture the appearance and geometry of objects. While the classical graph matching approach deals with pairwise relationships between features, it is usually not sufficient for invariant matching under similarity, affine or projective transformations. As argued by Duchenne et al. [7], invariance to such transformations is possible if third-order constraints are used. Moreover, third-order relationships provide a natural way to combine both higher-order geometry and appearance. Instead of representing objects as sets of features connected by edges, as in classical graph matching formulations, in third-order matching models the objects can be described by triangles, with features located at corners and appearance described by the interior of the triangles. Using such models we can cover the entire surface of an object in 2D or 3D, with a single representation. In contrast, the second-order case handles appearance only at the level of local features, but not groups of features.

2. Hypergraph Matching Formulation For clarity, we will discuss third-order hypergraph matching, but the same formulation can be extended to matching using relations of any order. Given two sets of features, one extracted from a model image Im and the other from a test image It , third-order hypergraph matching consists of finding correspondences between the two sets, such that a matching score, which considers geometric and appearance information between triplets of features is maximized. Given a list of candidate assignments Lia = (i, a), where a unique index ia is given to each candidate assignment (i, a), with feature i from Im and feature a from It , we can express a possible matching solution by an indicator vector x, of the same length as L, such that xia = 1 if feature i from the model image is matched to feature a from the test image and xia = 0 otherwise. Usually one-to-one matching constraints are imposed on x such that one feature from one image can match only from P a single feature P the other image, and vice-versa: i xia ≤ 1, a xia ≤ 1 and x ∈ {0, 1}n . The constraints can be written in matrix form Ax ≤ 1, x ∈ {0, 1}n , with A a binary matrix. The third-order matching score can then be written as: X S(x) = Hia;jb;kc xia xjb xkc . (1) ia;jb;kc

Here, H is a super-symmetric tensor with nonnegative elements, proportional with the quality of the match between tuples of features. Specifically, Hia;jb;kc indicates how well features (i, j, k) from the model image match, in terms of appearance and geometry, features (a, b, c) from the test image. The hypergraph matching problem consists then of finding the solution that maximizes S(x), under one-to-one matching constraints:

Figure 2. The third-order scores Hia;jb;kc we use can depend on both geometry and appearance. Geometric information can be captured by rotation invariant angles such as βi , rotation dependent angles such such as θij and pairwise distances dki , which can be made scale invariant if divided by the perimeter. The triangle appearance is captured by a feature vector fijk . The relative importance of each type of information is application dependent and automatically learned during training.

x∗ = argmax x

X

Hia;jb;kc xia xjb xkc .

(2)

ia;jb;kc

In practice one can use any type of information to design the scores Hia;jb;kc . Most authors focus on simple geometric relationships [15, 4], such as differences in the angles βi of the triangles formed by triplets of features (Figure 2). In this work we show that by learning powerful scores that include both geometric and appearance information we can significantly improve matching performance. The scores we use are: Hia;jb;kc = exp (−wT gia;jb;kc ),

(3)

where w is a vector of weights/parameters to be learned and gia;jb;kc is a vector containing nonnegative errors/deformations, modeling the change in geometry and appearance when matching the triangle defined by features (i, j, k) in the model image Im to the triangle (a, b, c) in the test image It . See Figure 2 for details.

3. Semi-supervised Learning for Hypergraph Matching Recent hypergraph matching methods [7, 15, 4] are based on a rank-one approximation (ROA) of the tensor H. The ROA of H is based on the assumption that the assignments are probabilistically independent. Let us define the probability assignment vector p, of the same length as the list L of candidate assignments, where pia ∈ [0, 1] is the probability that feature i from Im is matched to feature a from It . Under a statistical independence assumption, tensor H can be approximated by the following decomposition using outer products [4, 15]: Y H≈ ⊗p. (4) i=1..3

This approximation is also related to the symmetric higher order power method (S-HOPM, Algorithm 1) used by Duchenne et al. [7], whose stationary point v is an approximation of the assignment probability vector and gives a rank-one approximation of H. The symmetric higher order power method [9] applies to super-symmetric tensors and is guaranteed to converge to a stationary point of the third-order score (Equation 3), under unit norm constraints kxk = 1. In our experiments S-HOPM was convergent and numerically stable. Since the super-symmetric tensor H has nonnegative elements, the stationary point v of S-HOPM also has nonnegative elements. The connection between the stationary point v of the S-HOPM and the probability of assignments p further justifies the discretization of v [7] in order to obtain an integer solution satisfying the initial constraints. Algorithm 1 Symmetric Higher Order Power Method (SHOPM). v←1 repeat P via ← ia,jb,kc Hia;jb;kc vjb vkc v ← v/kvk until convergence return v The approximation v of p only works if the third order scores Hia;jb;kc correctly reflect the structure and similarities in the underlying problem. We propose to learn the parameters w (Equation 3) that maximize the dot-product between v and a binary solution vector b. The elements of b are equal to the ground truth for the known assignments and the assignments produced by the hypergraph matching algorithm for the unknown ones. This idea is similar to recent work on learning for graph matching [10]. The objective function maximized during learning is the sum of the dot products between each v and the corresponding b over the training set of image pairs: X w∗ = argmax bi T vi (w). (5) w

i

Note that v(w) is a function of the parameters w, since it depends on the elements of the tensor H, which are all functions of w. We optimize the objective by a gradient ascent update: wj ← wj + η

N X i=1

T

bi (w)

∂vi (w) . ∂wj

(6)

Each iteration of S-HOPM computes the update v ← v/kvk. It follows that the gradient of the estimate of v at iteration k +1 can be expressed as a function of the gradient at the previous step. Hence, the gradient can be computed recursively, jointly with the computation of v. A recursive

algorithm based on these ideas (Algorithm 2) can be derived based on these computational ideas. Algorithm 2 Compute the gradient dv of v. v←1 dv ← 0 ∂H dH ← ∂w j repeat P hia ← jb;kc dHia;jb;kc vjb vkc + 2Hia;jb;kc vjb dvkc P via ← jb;kc Hia;jb;kc vjb vkc h h ← kvk v v ← kvk dv ← h − (vT h)v until convergence return dv

4. Hypergraph Matching by Second-Order Approximation Hypergraph matching, as well as graph matching, are NP-hard, so one is usually after efficient algorithms that can find good approximate solutions. The complexity increases dramatically in the transition from second to higher order matching. Therefore it becomes harder to develop fast and accurate algorithms. Current state-of-the-art methods [15, 7, 4] take advantage of the ROA approximation in order to reduce complexity. This leads to either relaxing the oneto-one matching constraints of the original problem [7], or modifying the formulation based on probabilistic interpretations [15, 4]. In this section we present a novel method for hypergraph matching that can be used either stand-alone, starting from a uniform initial solution, or as a refinement procedure started at the solution returned by another algorithm. As opposed to other methods, ours aims to maximize the original objective score, while preserving to the best possible the original discrete one-to-one matching constraints. We experimentally show that local optimization in the original domain turns out to be more effective than global optimization in a relaxed domain, a fact that was also observed by [11] in the case of second-order matching. Our proposed method (Algorithm 3) is an iterative procedure that, at each step k, approximates the higher order score S(x) by its second order Taylor expansion around the current solution xk . This transforms the hypergraph matching problem into an Integer Quadratic Program (IQP), defined around the current solution xk . In turn, the secondorder approximation can be optimized locally, quite efficiently in the continuous domain Ax = 1, x ∈ [0, 1]n . Given a possible solution x in the continuous domain Ax = 1, x ∈ [0, 1]n , let matrix M(x) be a function of x, obtained by marginalizing the tensor H as follows:

M (x)ia;jb =

X

Hia;jb;kc xkc .

(7)

Similarly, we define the column vector d: X d(x)ia = Hia;jb;kc xjb xkc .

(8)

kc

jb;kc

Having defined M and d, we can now write the secondorder Taylor approximation of the third-order matching score (Formula 3) as follows: S(x) ≈ S(x0 ) + 3(xT M(x0 )x − d(x0 )T x).

(9)

We can locally improve the score around x0 by optimizing the quadratic assignment cost xT M(x0 )x − d(x0 )T x in the continuous domain Ax = 1, x ∈ [0, 1]n , since the first term S(x0 ) is constant. Note that in practice matrix M is often close to semi-positive definite. In this case the quadratic approximation is a concave minimization problem, which in general is notoriously difficult to solve globally (as opposed to convex minimization). Since, at each iteration, local maximization suffices, we use the efficient method of [11] (the inner loop of Algorithm 3). Algorithm 3 Sequential Second Order Expansion for Higher-Order Matching. x ← x0 x∗ ← x 0 P S ∗ ← ia;jb;kc Hia;jb;kc xia xjb xkc repeat P Mia;jb P ← kc Hia;jb;kc xkc dia ← jb;kc Hia;jb;kc xjb xkc repeat b ← π(2Mx − dT x) P S ← ia;jb;kc Hia;jb;kc bia bjb bkc if S > S ∗ then S∗ ← S x∗ ← b end if t∗ = argmax x(t)T Mx(t) + dT x(t), t ∈ [0, 1] where x(t) = x + t(b − x) x ← x + t∗ (b − x) until convergence until S∗ does not improve return x∗ The algorithm is initialized at x0 , which can be either a uniform vector or the solution given by another hypergraph matching method, such as HOPM [7]. The inner loop (method of [11]) locally optimizes the quadratic approximation of the hypergraph matching model around the current solution. This inner loop can be viewed as a graph matching problem that locally approximates the original hypergraph matching problem. This relates our approach to the

method recently proposed in [4], which also boils down to a graph matching problem by marginalizing the tensor down to a matrix. Different from [4], our algorithm is based on a second-order Taylor approximation, not the ROA of the tensor. This novel approach gives better objective scores in our experiments. Our method is also different from the probabilistic algorithm [15], which marginalizes the tensor down to a vector, thus transforming the higher order problem into a linear one. This may explain why the probabilistic method [15] performs less well than both our method and [4]. The inner loop consists of b ← π(2Mx − dT x), which is a projection on the discrete domain followed by line maximization t∗ = argmax x(t)T Mx(t) + Dx(t), t ∈ [0, 1], with closed-form solution (see [11] for more details). Similar ideas have been recently implemented also for image segmentation [2] and MAP inference in higher-order MRFs [13]. By tracking the best discrete solution x∗ ← b our method always returns a solution at least as good as the starting one. Since the score S is bounded above and the number of discrete solutions is finite, the algorithm is guaranteed to improve the matching score and stop after a finite number of iterations. Note that the algorithm stops if the previous iteration of the inner loop did not improve. In our experiments, convergence requires on average less than 5 outer-loop iterations.

5. Experiments We perform experiments on synthetic point sets, as well as real images. We compare our matching method with current state-of-the-art methods: the probabilistic method [15] (PM), the Higher Order Power Method [7] (HOPM), and the recently proposed algorithm [4] (FAM2). We also experimentally show that our learning method improves the performance of all hypergraph matching algorithms tested. Similar to earlier work on learning for graph matching [10], we found that the degree of supervision does not influence the quality of learning (see section 5.4 for more details). We also experimentally show that our novel hypergraph matching algorithm (Section 4) outperforms the state-of-the-art, if used by itself or in combination. In all our experiments, for triangulation, we used all triangles formed by connecting every point to its 7 nearest neighbors. On top of that we also added a Delaunay triangulation. This setup was used for both the model and the test images. For testing without learning we use a uniform vector of parameters w, with wi = 0.1, for all experiments and all methods. The gradient ascent method for learning starts at a uniform vector of parameters w for all experiments.

5.1. Synthetic Data Our synthetic experiments followed a setup similar to [4, 15]. The model set Im contains 20 points with 2D positions uniformly generated in the interval [0, 1]2 . The test

Figure 3. Learning on synthetic data. Note how the correlation between the eigenvector and the ground truth is maximized during training. At the same time, the matching accuracy of all algorithms on training data increases during learning. The plots show average values over 60 different learning experiments. No outliers were generated during training; positional noise σp = 0.03; rotation angle noise σa = 5◦ .

set It is generated by randomly perturbing the positions of the model points with Gaussian noise of σp in the interval [0.01, 0.1]. Outliers were added only to the test set, with (x, y) positions from the same uniform distribution in the the interval [0, 1]2 . The outliers are extra points in the test set that have no correct correspondence in the model set. The outliers rate or , which is the ratio of outliers to inliers, ranges from 0 to 1 (when the number of outliers is equal to the number of inliers). The test set was then scaled by a factor s and rotated by an angle α drawn from a Gaussian distribution with σa ∈ [0, 45◦ ]. As opposed to [4], we allowed every point in the model image to match any other point in the test image. In [4] the authors selected for each point in the model image only a few candidates from the test image and made sure that the correct match was always selected. As opposed to their setup, ours is invariant to changes in scale and rotation. We look at two types of third-order scores: scale and rotation invariant and scale invariant, but sensitive to rotation. For each triangle (i, j, k) we define the following geometric descriptors (see Figure 2 for details): bijk = [βi , βj , βk ], tijk = [θij , θjk , θki ] and dijk = [dij , djk , dki ]/pijk , where pijk is the perimeter of the triangle. Note that bijk and dijk are invariant to similarity transformations whereas tijk is sensitive to rotations. For rotation invariant matching, the deformation vector used P by the third-order-score (Equation P 3) is gia;jb;kc = [ |bijk − babc |, max |bijk − babc |, |dijk − dabc |, max |dijk − dabc |]. For rotation sensitive scores we P extend the vector gia;jb;kc with two more entries: [ |tijk − tabc |, max |tijk − tabc |], for a total of 6 dimensions. For training we used two different learning setups, by introducing (or not) the global rotation angle α in our third order scores. We used 5 training point set pairs (Im , It ), for σp = 0.03, or = 0 and σr = 5o . In Figure 3 notice that for rotation sensitive matching (plot on the right)

learning was faster and the matching rates were generally higher than in the rotation invariant case. Matching accuracy increased during learning, for all algorithms. Notice the superior convergence of our method (initialized with a noninformative uniform solution x0 ) vs. the convergence of the other methods tested. For testing we generated pairs of point sets (Im , It ), by uniformly varying σp ∈ [0.01, 0.1], σr ∈ [0, 45o ] and or ∈ [0, 1]. For results see Tables 1, 2. Figure 4 illustrates how rotation sensitive matching can be useful when the global rotation angle α is small. During learning the rotation parameters adapted to small rotations, which results in superior performance for the rotation dependent matching when α is small. In contrast, the rotation independent matching maintains high accuracy even when α is large

Figure 4. The effect of learning. Upper-left: matching using rotation dependent scores. Upper-right: matching using rotation independent scores. Lower-left: similarity invariant matching without learning (all parameters set to wi = 0.1). Lower-right: similarity invariant matching after learning. For the bottom row, σp = 0.03. All plots display averages over 100 experiments.

5.2. Experiments on Real Images For the first set of real image experiments, we used the 50 image pairs of cars and motorbikes (20 motorbikes and 30 cars) from [11]. In order to illustrate the capability of hypergraph matching to handle significant changes in scale, for each pair of model-test images, we down-scaled the test image by a factor of 2. The third-order scores are scale invariant, so changes in scale do not alter matching accuracy. The actual scores used are of the same form as the rotation dependent ones in our synthetic experiments, with a different set of parameters learned on these specific images (Figure 6). Features consisted of 2D points and their normals,

Table 1. Comparisons in objective scores. The results are averages over 412 different types of synthetic matching experiments, by uniformly varying σp ∈ [0.01, 0.1], σr ∈ [0, 45o ] and or ∈ [0, 1]. For each type, 100 experiments were randomly generated, for a total of 41200 experiments. First row: the average ratio of objective score S of other algorithms to the score S obtained by our method starting from a flat solution (Ours-flat). Second row: average ratio of S obtained by our algorithm initialized with other methods to the objective score of Ours-flat. On the last row: frequency with which the score of Ours-flat is greater than the score S of other algorithms. Note that Ours gives significantly better scores on all types of experiments either by itself or in combination with other algorithms.

Algorithm S(Alg)/S(Ours-flat) S(Alg + Ours)/S(Ours-flat) Freq. S(Ours-flat) > S(Alg)

FAM2 0.83 0.99 100%

HOPM 0.49 0.96 100%

PM 0.37 0.97 100%

Figure 5. Examples of scale invariant matching on cars and motorbikes image pairs. Notice the robustness to changes in scale and viewpoint and the degree of background clutter.

Table 2. Average performance on 124 different types of synthetic matching experiments, with and without learning, with and without rotation sensitivity. The model and test sets (Im , It ) were generated by uniformly drawing σp ∈ [0.01, 0.1], σr ∈ [0, 45o ] and or ∈ [0, 1]. For each type, 100 experiments were randomly generated, , for a total of 12400 experiments.

Algorithm No Learning + Learning + Ours

Ours-flat 66.7% 69.9% 69.9%

FAM2 51.1% 70.8% 71.6%

HOPM 34.8% 61.5% 66.3%

PM 35.4% 53.2% 67.6%

Table 3. Average performance on the cars and motorbikes image pairs. The results are averages over test image pairs. Last row shows the average ratio of objective scores.

Algorithm Baseline + Learning + Ours Alg/Ours

Ours 27.5% 54.9% 54.9 % 1

FAM2 21.4% 41.1% 54.7% 0.49

HOPM 6.3% 51.8% 56.3% 0.85

PM 7.6% 29.0% 50.3% 0.26

Figure 6. Learning to match cars, motorbikes and people. Notice that learning using appearance and geometry is faster and leads to better matching accuracy for all algorithms. Results are averages over 30 different learning experiments.

5.3. Matching People sampled on contours as in [11]. We performed 30 different learning and testing experiments. For each experiment we randomly chose 5 pairs of images of the same class for training and used the remaining ones belonging to the same class for testing. The results in Table 3 are averages over both classes over all 30 experiments. This matching task is difficult (see Figure 5 for some examples) as reflected by the relatively low matching rates, but the results clearly confirm the usefulness of our learning and matching methods and their ability to improve the performance of current state-of-the-art methods.

People are a good example of deformable objects that require high quality matching in a large variety of applications, including recognition and tracking of fast motions with large inter-frame displacement. We tested our algorithms on pairs of images containing people from videos captured with the recently released PrimeSense rgb-depth cameras. For every frame, we first register the depth with the color image, by using a linear transformation that was computed once, from manual correspondences and the ICP algorithm on a single color-depth frame. For all points of depth larger than 1000, we set their depth equal to 1000. Af-

Figure 7. Examples of matching people at different scales and poses. Notice the significant change in scale and the relatively large displacement of body parts. Table 4. Matching accuracy over 30 image pairs containing people.

Algorithm No Learning + Learning + Appearance + Ours

Ours 73.4% 84.2% 91.0% 91.0%

FAM2 73.9% 83.5% 86.3% 90.1%

HOPM 23.2% 81.5% 89.7% 89.9%

PM 24.6% 65.4% 84.7% 89.0%

ter pre-processing the depth image in this way, we applied a Canny edge detector on the depth image and extracted occlusion boundaries that proved to be relatively stable and accurate. For training (see Figure 6) and evaluation we select 30 pairs of frames containing the same person in different poses about half a second apart. We manually selected ground truth correspondences between the two frames, on the depth boundaries obtained. For the test frames we added outliers uniformly sampled from the depth boundaries As in the previous experiments we down scaled the test image by a factor of 2. We used two types of third order scores: (i) the rotation dependent ones from the previous experiments, with w learned from rgb-d images pairs; (ii) geometry-only scores augmented with appearance information (chi-squared distances between 40-dimensional histograms in the HSV color space) computed on the interior of the triangles defined by triplets of features. We performed 30 different experiments, using 5 image pairs for training and the remaining ones for testing (See Table 4). See Figures 7, 1 for

Figure 8. Matching people at different scales and poses. Notice the significant change in scale and the relatively large displacements of body parts.

testing examples. We further tested our geometry and appearance hypergraph model on hundreds of pairs of rgb-d frames for which we do not have ground truth correspondences (Figure 8). We implemented our method in C++ and the optimized code is able to match 2 frames in a scale invariant manner in less than a second - total time that includes extracting features, constructing the tensor H and matching.

5.4. Supervised vs. Unsupervised Learning In our experiments the amount of supervision does not affect the quality of learning. Basically the learning algorithm estimates almost identical parameters w at a very similar speed of convergence even when no correct, ground truth matches are given during learning (see Figure 9). These findings are similar to the ones obtained on graph matching [10]. In Figure 9 we show how the matching rate and the correlation between v and the ground truth increase during learning for different rates of supervision,

References

Figure 9. Varying the degree of supervision during training. Note that there is almost no correlation on average between the degree of supervision and the speed of convergence. For each degree of supervision the training pairs of images were randomly chosen.

ranging from unsupervised (no correct matches are known during training) to completely supervised. The values plotted are averages over 10 learning experiments. In each experiment 7 pairs of images of people are chosen randomly and used for training. In these plots we used only three values for the third order scores on triangles: deformations on gray level appearance, gradient appearance, and geometry, normalized by some constants (kept fixed during all experiments) such that their average values were close to 1 (for numerical stability). The initial parameters w were all equal to [0.1, 0.1, 0.1] and the ones learned were very similar for all degrees of supervision; e.g. for the unsupervised case the average learned w = [3.0, 2.2, 1.6], for 40% supervision w = [3.0, 2.2, 1.8] and for completely supervised w = [2.9, 2.1, 1.7].

6. Conclusions We have proposed novel semi-supervised learning and optimization methods for hypergraph matching and experimentally demonstrated that our algorithms have the potential to improve matching accuracy significantly. Our experiments show that semi-supervised learning is a valuable addition to hypergraph matching and can significantly improve the performance of current state-of-the-art algorithms. We also experimentally show that our optimization method outperforms current state-of-the-art and can improve the estimates of other higher-order methods, when used as a refinement, post-processing procedure. In future work, we plan to explore extensions of our hypergraph model and matching methodology for tracking and recognition. Acknowledgements: This work was supported by CNCSIS-UEFISCDI, under PNII-RU-RC-2/2009, and the EC, under MCEXT-025481.

[1] A. Berg, T. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In International Conference on Computer Vision and Pattern Recognition, 2005. 1 [2] W. Brendel and S. Todorovic. Segmentation as maximumweight independent set. In Neural Information Processing Systems, 2010. 4 [3] T. Caetano, J. McAuley, L. Cheng, Q. Le, and A. J. Smola. Learning graph matching. Pattern Analysis and Machine Intelligence, 31(6):1048–1058, 2009. 1 [4] M. Chertok and Y. Keller. Efficient high order matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32:2205–2215, 2010. 1, 2, 3, 4, 5 [5] M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. In European Conference on Computer Vision, 2010. 1 [6] T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In Neural Information Processing Systems, 2006. 1 [7] O. Duchenne, F. Bach, I. Kweon, and J. Ponce. A tensorbased algorithm for high-order graph matching. In International Conference on Computer Vision and Pattern Recognition, 2009. 1, 2, 3, 4 [8] S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. Pattern Analysis and Machine Intelligence, 18(4):377–388, 1996. 1 [9] E. Kofidis and P. A. Regallia. On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. of Matrix Anal. Appl., 23(3), 2002. 3 [10] M. Leordeanu and M. Hebert. Unsupervised learning for graph matching. In International Conference on Computer Vision and Pattern Recognition, 2009. 1, 3, 4, 7 [11] M. Leordeanu, M. Hebert, and R. Sukthankar. An integer projected fixed point method for graph matching and map inference. In Neural Information Processing Systems, 2009. 1, 3, 4, 5, 6 [12] C. Schellewald and C. Schnorr. Probabilistic subgraph matching based on convex relaxation. In International Conference on. Energy Minimization Methods in Computer Vision and Pattern Recognition, 2005. 1 [13] D. Semenovich and A. Sowmya. Tensor power method for efficient map inference in higher-order mrfs. In Proc. Int. Conf. Patt. Recog., 2010. 4 [14] P. H. S. Torr. Solving markov random fields using semidefinite programming. In International Conference on Artificial Intelligence and Statistics, 2003. 1 [15] R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. In International Conference on Computer Vision and Pattern Recognition, 2008. 1, 2, 3, 4

Semi-supervised Learning and Optimization for ... - Semantic Scholar

matching algorithm, which outperforms the state-of-the-art, and, when used in ... Illustration of our hypergraph matching method versus standard graph matching.

4MB Sizes 0 Downloads 265 Views

Recommend Documents

SVM Optimization for Lattice Kernels - Semantic Scholar
[email protected]. ABSTRACT. This paper presents general techniques for speeding up large- scale SVM training when using sequence kernels. Our tech-.

Continuous extremal optimization for Lennard ... - Semantic Scholar
The optimization of a system with many degrees of free- dom with respect to some ... [1,2], genetic algorithms (GA) [3–5], genetic programming. (GP) [6], and so on. ..... (Color online) The average CPU time (ms) over 200 runs vs the size of LJ ...

SVM Optimization for Lattice Kernels - Semantic Scholar
gorithms such as support vector machines (SVMs) [3, 8, 25] or other .... labels of a weighted transducer U results in a weighted au- tomaton A which is said to be ...

Measurement-Based Optimization Techniques for ... - Semantic Scholar
the TCP bandwidth achievable from the best server peer in the candidate set. .... lection hosts to interact with a large number of realistic peers in the Internet, we ... time) like other systems such as web servers; in fact the average bandwidth ...

Measurement-Based Optimization Techniques for ... - Semantic Scholar
the TCP bandwidth achievable from the best server peer in the candidate set. .... Host. Location. Link Speed. # Peers. TCP Avg. 1. CMU. 10 Mbps. 2705. 129 kbps. 2 ... time) like other systems such as web servers; in fact the average bandwidth ...

Estimation, Optimization, and Parallelism when ... - Semantic Scholar
Nov 10, 2013 - Michael I. Jordan. H. Brendan McMahan. November 10 ...... [7] J. Ma, L. K. Saul, S. Savage, and G. M. Voelker. Identifying malicious urls: An ...

Learning Topographic Representations for ... - Semantic Scholar
the assumption of ICA: only adjacent components have energy correlations, and ..... were supported by the Centre-of-Excellence in Algorithmic Data Analysis.

MACHINE LEARNING FOR DIALOG STATE ... - Semantic Scholar
output of this Dialog State Tracking (DST) component is then used ..... accuracy, but less meaningful confidence scores as measured by the .... course, 2015.

Learning Topographic Representations for ... - Semantic Scholar
Figure 1: The covariance matrices of (a) sampled s, estimated components (b) without and ... example is coherent sources in EEG or MEG, which can be linearly ...

Learning, Information Exchange, and Joint ... - Semantic Scholar
Atlanta, GA 303322/0280, [email protected]. 2 IIIA, Artificial Intelligence Research Institute - CSIC, Spanish Council for Scientific Research ... situation or problem — moreover, the reasoning needed to support the argumentation process will als

Organizational Learning Capabilities and ... - Semantic Scholar
A set of questionnaire was distributed to selected academic ... Key words: Organizational learning capabilities (OLC) systems thinking Shared vision and mission ... principle and ambition as a guide to be successful. .... and databases.

Domain Adaptation: Learning Bounds and ... - Semantic Scholar
samples for different loss functions. Using this distance, we derive new generalization bounds for domain adaptation for a wide family of loss func- tions. We also present a series of novel adaptation bounds for large classes of regularization-based

Learning, Information Exchange, and Joint ... - Semantic Scholar
as an information market. Then we will show how agents can use argumentation as an information sharing method, and achieve effective learning from communication, and information sharing among peers. The paper is structured as follows. Section 2 intro

Accelerating Hessian-Free Optimization for Deep ... - Semantic Scholar
study aims at speeding up Hessian-free training, both by means of decreasing the amount of .... In the HF algorithm, the CG search is truncated, based upon the rel- ... for this domain problem HF algorithms manage to capture salient features of ...

Offline Optimization for Online Ad Allocation - Semantic Scholar
be the flow on edge (a, i) in this max flow (since all the ca- pacities are integers, we may assume that the resulting flow is integral [25]). For ease of notation, we say fai = 0 if edge. (a, i) ∈ E. Online Algorithm. When an impression i ∈ D(i)

Offline Optimization for Online Ad Allocation - Semantic Scholar
ABSTRACT. We consider online ad allocation from the perspective of op- timizing delivery of a given set of ad reservations. Ad allo- cation naturally fits into the class of online bipartite match- ing problems: ad nodes are fixed, and impression (ad

Delay learning and polychronization for reservoir ... - Semantic Scholar
Feb 1, 2008 - For the last 10 years, solutions were ..... explains this Gaussian redistribution. ...... studied in vivo for as long as one year, J. Neurophysiol.

A Representation of Programs for Learning and ... - Semantic Scholar
plexity is computer programs. This immediately raises the question of how programs are to be best repre- sented. We propose an answer in the context of ongo-.

Fiducial optimization for minimal target registration ... - Semantic Scholar
only locally optimal; 3) all methods use the analytic TRE estimation method ... markers placement with an interactive visualization and evaluation software ...... automatically using our program on the preoperative image of the last five patients.

Learning sequence kernels - Semantic Scholar
such as the hard- or soft-margin SVMs, and analyzed more specifically the ..... The analysis of this optimization problem helps us prove the following theorem.

Delay learning and polychronization for reservoir ... - Semantic Scholar
Feb 1, 2008 - bGoogle, 1600 Amphitheatre Pkwy, B1350-138B, Mountain View, CA 94043, USA. Available .... neuroscience and computer science, that precise timing of spike firing is a ..... output neuron and increment its delay (ю1 ms), except if dmax i

Delay learning and polychronization for reservoir ... - Semantic Scholar
Feb 1, 2008 - ... the computational power of synaptic delays and for monitoring the ... Keywords: Reservoir computing; Spiking neuron network; Synaptic ...

A Representation of Programs for Learning and ... - Semantic Scholar
plexity is computer programs. This immediately ... gorithmic agent AIXI, which in effect simulates all pos- ... and high resource-variance, one may of course raise the objection that .... For list types listT , the elementary functions are list. (an