Paul Swoboda, Dagmar Kainmüller, Ashkan Mokarian, Christian Theobalt, Florian Bernard. A Convex Relaxation for Multi-Graph Matching. In IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2019, Long Beach, CA, USA, June 16-20, 2019. pages 11156-11165, Computer Vision Foundation / IEEE, 2019. [doi]
@inproceedings{SwobodaKMTB19,
title = {A Convex Relaxation for Multi-Graph Matching},
author = {Paul Swoboda and Dagmar Kainmüller and Ashkan Mokarian and Christian Theobalt and Florian Bernard},
year = {2019},
url = {http://openaccess.thecvf.com/content_CVPR_2019/html/Swoboda_A_Convex_Relaxation_for_Multi-Graph_Matching_CVPR_2019_paper.html},
researchr = {https://researchr.org/publication/SwobodaKMTB19},
cites = {0},
citedby = {0},
pages = {11156-11165},
booktitle = {IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2019, Long Beach, CA, USA, June 16-20, 2019},
publisher = {Computer Vision Foundation / IEEE},
}