A Tensor-Based Algorithm for High-Order Graph Matching

Authors:
Olivier Duchenne;Francis Bach;In-So Kweon;Jean Ponce
Affiliations:
École Normale Supérieure de Paris and the Willow project team (CNRS/ENS/INRIA UMR 8548);INRIA and the Sierra team, Laboratoire d'Informatique de École Normale Supérieure de Paris (CNRS/ENS/INRIA UMR 8548);KAIST, Daejeon;École Normale Supérieure de Paris and the Willow project team (CNRS/ENS/INRIA UMR 8548)
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2011

Citing 0
Cited 4

Graph matching via sequential monte carlo

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Uncertainty-Based feature learning for skin lesion matching using a high order MRF optimization framework

MICCAI'12 Proceedings of the 15th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Efficient and scalable 4th-order match propagation

ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part I
Robust point pattern matching based on spectral context

Pattern Recognition

Quantified Score

Hi-index	0.14

Visualization

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.