Name
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... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TCYB.2017.2655538 | IEEE Transactions on Cybernetics |
Keywords | Field | DocType |
Annealing,Convergence,Tensile stress,Iterative methods,Optimization,Complexity theory,Cybernetics | Convergence (routing),Mathematical optimization,Iterative method,Hypergraph,Algorithm,Matching (graph theory),Solver,Jump,Cybernetics,Mathematics | Journal |
Volume | Issue | ISSN |
48 | 2 | 2168-2267 |
Citations | PageRank | References |
15 | 0.51 | 53 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junchi Yan | 1 | 891 | 83.36 |
| Changsheng Li | 2 | 108 | 9.64 |
| Yin Li | 3 | 797 | 35.85 |
| Guitao Cao | 4 | 55 | 15.03 |