Sciweavers

843 search results - page 8 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
ISBI
2009
IEEE
14 years 2 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin
CVPR
2006
IEEE
14 years 1 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
CVPR
2004
IEEE
14 years 9 months ago
Window-Based, Discontinuity Preserving Stereo
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, ...
Motilal Agrawal, Larry S. Davis
CVPR
2009
IEEE
14 years 5 months ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...