724 search results - page 4 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
105
click to vote
CPM
2006
Springer
15 years 3 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a quantitative evaluation of SE-MinCut, a novel segmentation algorithm based on spectral embedding and minimum cut. We use human segmentations from the Berkeley Segment...
GLVLSI
2009
IEEE
15 years 3 months ago
2009
IEEE
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
101
click to vote
PAMI
2010
14 years 10 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...