A convex relaxation for multi-graph matching

P Swoboda, A Mokarian, C Theobalt… - Proceedings of the …, 2019 - openaccess.thecvf.com
We present a convex relaxation for the multi-graph matching problem. Our formulation
allows for partial pairwise matchings, guarantees cycle consistency, and our objective …
被引用次数：44 相关文章

A Convex Relaxation for Multi-Graph Matching

P Swoboda, D Kainmüller, A Mokarian… - 2019 IEEE/CVF …, 2019 - ieeexplore.ieee.org
We present a convex relaxation for the multi-graph matching problem. Our formulation
allows for partial pairwise matchings, guarantees cycle consistency, and our objective …

A convex relaxation for multi-graph matching

P Swoboda, D Kainmüller, A Mokarian… - Proceedings of the …, 2019 - edoc.mdc-berlin.de
We present a convex relaxation for the multi-graph matching problem. Our formulation
allows for partial pairwise matchings, guarantees cycle consistency, and our objective …

A Convex Relaxation for Multi-Graph Matching

P Swoboda, D Kainmuller, A Mokarian… - 2019 IEEE/CVF …, 2019 - computer.org
We present a convex relaxation for the multi-graph matching problem. Our formulation
allows for partial pairwise matchings, guarantees cycle consistency, and our objective …
[PDF] mpg.de

[PDF][PDF] A Convex Relaxation for Multi-Graph Matching

P Swoboda, D Kainmüller, A Mokarian… - 32nd IEEE Conference …, 2019 - pure.mpg.de
We present a convex relaxation for the multi-graph matching problem. Our formulation
allows for partial pairwise matchings, guarantees cycle consistency, and our objective …

A convex relaxation for multi-graph matching

P Swoboda, D Kainmüller, A Mokarian… - Proceedings of the …, 2019 - edoc.mdc-berlin.de
We present a convex relaxation for the multi-graph matching problem. Our formulation
allows for partial pairwise matchings, guarantees cycle consistency, and our objective …