396 search results - page 23 / 80 » A Graph Cut Algorithm for Generalized Image Deconvolution |
162
Voted
ESA
2005
Springer
15 years 12 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
156
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
184
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Current state-of-the-art image-based scene reconstruction
techniques are capable of generating high-fidelity 3D
models when used under controlled capture conditions.
However, th...
175
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
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...
210
click to vote
ISBI
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we propose a graph-based method for fullyautomatic segmentation of the left ventricle and atrium in 3D ultrasound (3DUS) volumes. Our method requires no user input ...