A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching

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]

Abstract

Abstract is missing.