Paul Swoboda, Carsten Rother, Hassan Abu Alhaija, Dagmar Kainmüller, Bogdan Savchynskyy. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. In 2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017. pages 7062-7071, IEEE Computer Society, 2017. [doi]
@inproceedings{SwobodaRAKS17,
title = {A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching},
author = {Paul Swoboda and Carsten Rother and Hassan Abu Alhaija and Dagmar Kainmüller and Bogdan Savchynskyy},
year = {2017},
doi = {10.1109/CVPR.2017.747},
url = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2017.747},
researchr = {https://researchr.org/publication/SwobodaRAKS17},
cites = {0},
citedby = {0},
pages = {7062-7071},
booktitle = {2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017},
publisher = {IEEE Computer Society},
isbn = {978-1-5386-0457-1},
}