2219 search results - page 132 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
107
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
115
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
132
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
128
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
133
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...