Sciweavers

37 search results - page 2 / 8
» A New Framework for Approximate Labeling via Graph Cuts
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
EMMCVPR
1999
Springer
13 years 12 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
IPMI
2007
Springer
14 years 8 months ago
Active Mean Fields: Solving the Mean Field Approximation in the Level Set Framework
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
Kilian M. Pohl, Ron Kikinis, William M. Wells III
ICCV
2011
IEEE
12 years 7 months ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B...
CVPR
2010
IEEE
14 years 3 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...