7 search results - page 1 / 2 » Higher-Order Clique Reduction in Binary Graph Cut |
CVPR
2009
IEEE
15 years 1 days ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
CVPR
2009
IEEE
15 years 1 days ago
2009
IEEE
Higher order energy functions have the ability to encode
high level structural dependencies between pixels, which
have been shown to be extremely powerful for image labeling
pro...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...