Skip to Main content Skip to Navigation
Journal articles

A Tensor-Based Algorithm for High-Order Graph Matching

Olivier Duchenne 1 Francis Bach 1 Kweon In-So 2 Jean Ponce 1 
1 WILLOW - Models of visual object recognition and scene understanding
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548
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 multi-dimensional 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Suha Kwak Connect in order to contact the contributor
Submitted on : Thursday, September 11, 2014 - 5:39:07 PM
Last modification on : Thursday, March 17, 2022 - 10:08:39 AM
Long-term archiving on: : Friday, December 12, 2014 - 10:56:44 AM


Files produced by the author(s)




Olivier Duchenne, Francis Bach, Kweon In-So, Jean Ponce. A Tensor-Based Algorithm for High-Order Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2011, 33 (12), pp.2383 - 2395. ⟨10.1109/TPAMI.2011.110⟩. ⟨hal-01063322⟩



Record views


Files downloads