S.N. Maheshwari

Inference in Higher Order MRF-MAP Problems With Small and Large Cliques

Higher Order MRF-MAP formulation has been a popular technique for solving many problems in computer vision. Inference in a general MRF-MAP problem is NP Hard, but can be performed in polynomial time for the special case when potential functions are submodular. Two popular combinatorial approaches fo…