A Tensor-Based Algorithm for High-Order Graph Matching

Citations Over TimeTop 1% of 2011 papers

Abstract

This paper addresses the problem of establishing correspondences between two sets of visual features using higher order constraints instead of the unary or pairwise ones used in classical methods. Concretely, the corresponding hypergraph matching problem is formulated as the maximization of a multilinear objective function over all permutations of the features. This function is defined by a tensor representing the affinity between feature tuples. It is maximized using a generalization of spectral techniques where a relaxed problem is first solved by a multidimensional power method and the solution is then projected onto the closest assignment matrix. The proposed approach has been implemented, and it is compared to state-of-the-art algorithms on both synthetic and real data.

Related Papers

• → Unconditionally Converging Multilinear Operators(2001)13 cited
• → Boundedness of multilinear operators on generalized Morrey spaces(2014)7 cited
• → Pure Unary Relational Structures(2018)
• → Multiple Weighted Estimates for Multilinear Commutators of Multilinear Singular Integrals with Generalized Kernels(2023)