302 search results - page 57 / 61 » Reducing graphs in graph cut segmentation |
CRV
2008
IEEE
15 years 6 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
111
Voted
IJCAI
2007
15 years 1 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
121
click to vote
ICIP
2000
IEEE
16 years 21 days ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
CGO
2003
IEEE
15 years 3 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration mode...