396 search results - page 6 / 80 » A Graph Cut Algorithm for Generalized Image Deconvolution |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
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...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
MEMICS
2010
13 years 2 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...