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]

Authors

Paul Swoboda

This author has not been identified. Look up 'Paul Swoboda' in Google

Carsten Rother

This author has not been identified. Look up 'Carsten Rother' in Google

Hassan Abu Alhaija

This author has not been identified. Look up 'Hassan Abu Alhaija' in Google

Dagmar Kainmüller

This author has not been identified. Look up 'Dagmar Kainmüller' in Google

Bogdan Savchynskyy

This author has not been identified. Look up 'Bogdan Savchynskyy' in Google