Sciweavers

433 search results - page 14 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
CVPR
2005
IEEE
14 years 11 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
ECCV
2006
Springer
14 years 11 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
WDAG
2001
Springer
122views Algorithms» more  WDAG 2001»
14 years 2 months ago
Computation Slicing: Techniques and Theory
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
Neeraj Mittal, Vijay K. Garg
CVPR
2004
IEEE
14 years 11 months ago
Multigrid and Multi-Level Swendsen-Wang Cuts for Hierarchic Graph Partition
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
Adrian Barbu, Song Chun Zhu
CVPR
2008
IEEE
14 years 11 months ago
High resolution motion layer decomposition using dual-space graph cuts
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...
Thomas Schoenemann, Daniel Cremers