English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

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 Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
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: http://hdl.handle.net/21.11116/0000-0005-74B8-9
Abstract
There is no abstract available