A Convex Relaxation for Multi-Graph Matching

Swoboda, Paul; Kainmüller, Dagmar; Mokarian, Ashkan; Theobalt, Christian; Bernard, Florian

doi:10.1109/CVPR.2019.01141

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A Convex Relaxation for Multi-Graph Matching

MPS-Authors

/persons/resource/persons221924

Swoboda, Paul
Computer Vision and Machine Learning, MPI for Informatics, Max Planck Society;

/persons/resource/persons45610

Theobalt, Christian
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

Swoboda_A_Convex_Relaxation_for_Multi-Graph_Matching_CVPR_2019_paper.pdf
(Preprint), 879KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Swoboda, P., Kainmüller, D., Mokarian, A., Theobalt, C., & Bernard, F. (2019). A Convex Relaxation for Multi-Graph Matching. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 11156-11165). Piscataway, NJ: IEEE. doi:10.1109/CVPR.2019.01141.

Cite as: https://hdl.handle.net/21.11116/0000-0005-74B8-9

Abstract

There is no abstract available