138 search results - page 7 / 28 » Efficient Planar Graph Cuts with Applications in Computer Vi... |
120
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
114
click to vote
CVPR
2009
IEEE
16 years 6 months 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...
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
A new approach is presented for 3D shape recovery of local planar surface patches from two shift/spacevariant defocused images. It is based on a recently proposed technique for in...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...