Sciweavers

2219 search results - page 8 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ECCV
2000
Springer
14 years 9 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
ICPR
2008
IEEE
14 years 2 months ago
Dynamic Oscillating Search algorithm for feature selection
Petr Somol, Jana Novovicová, Jiri Grim, Pav...
CVPR
2000
IEEE
14 years 9 months ago
Improved Motion Stereo Matching Based on a Modified Dynamic Programming
A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization prob...
Mikhail Mozerov, Vitaly Kober, Tae-Sun Choi
ICCV
2005
IEEE
14 years 9 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
CVPR
2005
IEEE
14 years 9 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler