English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems

MPS-Authors
/persons/resource/persons214986

Bernard,  Florian
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45610

Theobalt,  Christian
Computer Graphics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bernard, F., Theobalt, C., & Moeller, M. (2018). DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 4310-4319). Piscataway, NJ: IEEE. doi:10.1109/CVPR.2018.00453.


Cite as: http://hdl.handle.net/21.11116/0000-0002-E92F-4
Abstract
There is no abstract available