Adaptive Discrete Hypergraph Matching
Lists
Only you see this
Abstract
This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an m-circle sequence under moderate conditions, where m is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.
BibTeX
@article{yan2018adaptive,
author = {Junchi Yan and Changsheng Li and Yin Li and Guitao Cao},
title = {{Adaptive Discrete Hypergraph Matching}},
journal = {IEEE Trans. Cybernetics},
year = {2018},
url = {https://openreview.net/forum?id=NnLKMSGloQRJ},
}Loading related content...