LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Pattern Analysis and Machine Intelligence"
DOI: 10.1109/tpami.2016.2582165
Abstract: In our recent work, we showed that solving the LP relaxation of the pairwise min-sum labeling problem (also known as MAP inference in graphical models or discrete energy minimization) is not much easier than solving… read more here.
Keywords: relaxation; labeling problem; min sum; linear program ... See more keywords