396 search results - page 6 / 80 » A Graph Cut Algorithm for Generalized Image Deconvolution |
147
click to vote
CVPR
2004
IEEE
16 years 6 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...
151
click to vote
ECCV
2006
Springer
16 years 6 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...
219
click to vote
CVPR
2011
IEEE
14 years 11 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ï¬...
136
click to vote
ICCV
2007
IEEE
16 years 6 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...
167
click to vote
MEMICS
2010
14 years 11 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...