English

Candidate Constrained CRFs for Loss-Aware Structured Prediction

Computer Vision and Pattern Recognition 2014-12-11 v1

Abstract

When evaluating computer vision systems, we are often concerned with performance on a task-specific evaluation measure such as the Intersection-Over-Union score used in the PASCAL VOC image segmentation challenge. Ideally, our systems would be tuned specifically to these evaluation measures. However, despite much work on loss-aware structured prediction, top performing systems do not use these techniques. In this work, we seek to address this problem, incorporating loss-aware prediction in a manner that is amenable to the approaches taken by top performing systems. Our main idea is to simultaneously leverage two systems: a highly tuned pipeline system as is found on top of leaderboards, and a traditional CRF. We show how to combine high quality candidate solutions from the pipeline with the probabilistic approach of the CRF that is amenable to loss-aware prediction. The result is that we can use loss-aware prediction methodology to improve performance of the highly tuned pipeline system.

Keywords

Cite

@article{arxiv.1412.3369,
  title  = {Candidate Constrained CRFs for Loss-Aware Structured Prediction},
  author = {Faruk Ahmed and Daniel Tarlow and Dhruv Batra},
  journal= {arXiv preprint arXiv:1412.3369},
  year   = {2014}
}

Comments

20 pages including Supplement

R2 v1 2026-06-22T07:26:43.587Z