Solving Markov random fields using second order cone programming relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solving MRFS is NP-hard, we propose a second order cone programming relaxation scheme which solves a closely related (convex)...
| Auteurs principaux: | , , |
|---|---|
| Format: | Conference item |
| Langue: | English |
| Publié: |
IEEE
2006
|