2219 search results - page 69 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
EMMCVPR
2001
Springer
14 years 2 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
IPMI
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...
ISPD
2004
ACM
14 years 3 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
ACCV
2009
Springer
14 years 4 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...