310 search results - page 31 / 62 » Cutting two graphs simultaneously |
156
click to vote
CVPR
2007
IEEE
16 years 5 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...
143
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
115
click to vote
GBRPR
2007
Springer
15 years 9 months ago
2007
Springer
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
107
click to vote
CVGIP
2008
15 years 3 months ago
2008
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...
171
click to vote
IJCV
2008
15 years 3 months ago
2008
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...