2 code implementations • CVPR 2018 • D. Khuê Lê-Huu, Nikos Paragios
In this paper, we study a nonconvex continuous relaxation of MAP inference in discrete Markov random fields (MRFs).
2 code implementations • CVPR 2017 • D. Khuê Lê-Huu, Nikos Paragios
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions.