On partial optimality in multi-label MRFs
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as an integer linear programming and relax the integrality constraints. The approach we consider in this paper is to first...
Những tác giả chính: | Kohli, P, Shekhovtsov, A, Rother, C, Kolmogorov, V, Torr, P |
---|---|
Định dạng: | Conference item |
Ngôn ngữ: | English |
Được phát hành: |
Association for Computing Machinery
2008
|
Những quyển sách tương tự
-
Reduce, reuse and recycle: efficiently solving multi-label MRFs
Bằng: Alahari, K, et al.
Được phát hành: (2008) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
Bằng: Pawan Kumar, M, et al.
Được phát hành: (2009) -
Dynamic hybrid algorithms for MAP inference in discrete MRFs
Bằng: Alahari, K, et al.
Được phát hành: (2009) -
A tiered move-making algorithm for general pairwise MRFs
Bằng: Vineet, V, et al.
Được phát hành: (2012) -
Integrating vision modules with coupled MRFs
Bằng: Poggio, Tomaso
Được phát hành: (2008)