ML Anthology

What Is Optimized in Tight Convex Relaxations for Multi-Label Problems?

Christopher Zach, Christian Hane, Marc Pollefeys
CVPR 2012 pp. 1664-1671
doi:10.1109/CVPR.2012.6247860 /cvpr/2012/zach2012cvpr-optimized/
CVPR Semantic Scholar

Cite

Text

Zach et al. "What Is Optimized in Tight Convex Relaxations for Multi-Label Problems?." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012. doi:10.1109/CVPR.2012.6247860

Markdown

[Zach et al. "What Is Optimized in Tight Convex Relaxations for Multi-Label Problems?." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012.](https://mlanthology.org/cvpr/2012/zach2012cvpr-optimized/) doi:10.1109/CVPR.2012.6247860

BibTeX

@inproceedings{zach2012cvpr-optimized,
  title     = {{What Is Optimized in Tight Convex Relaxations for Multi-Label Problems?}},
  author    = {Zach, Christopher and Hane, Christian and Pollefeys, Marc},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2012},
  pages     = {1664-1671},
  doi       = {10.1109/CVPR.2012.6247860},
  url       = {https://mlanthology.org/cvpr/2012/zach2012cvpr-optimized/}
}