Efficient Linear Programming for Dense CRFs

CVPR 2017 Thalaiyasingam AjanthanAlban DesmaisonRudy BunelMathieu SalzmannPhilip H. S. TorrM. Pawan Kumar

The fully connected conditional random field (CRF) with Gaussian pairwise potentials has proven popular and effective for multi-class semantic segmentation. While the energy of a dense CRF can be minimized accurately using a linear programming (LP) relaxation, the state-of-the-art algorithm is too slow to be useful in practice... (read more)

PDF Abstract


No code implementations yet. Submit your code now

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper