A Tensor-Based Algorithm for High-Order Graph Matching

作者：Duchenne Olivier^*; Bach Francis; Kweon Inso; Ponce Jean

来源：IEEE-Computer-Society Conference on Computer Vision and Pattern Recognition Workshops, 2009-06-20 to 2009-06-25.

DOI：10.1109/cvpr.2009.5206619

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.

• 出版日期2009