Sciweavers

2219 search results - page 34 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ACIVS
2006
Springer
14 years 3 months ago
Stereo Matching Using Scanline Disparity Discontinuity Optimization
We propose a scanline energy minimization algorithm for stereo vision. The proposed algorithm differs from conventional energy minimization techniques in that it focuses on the re...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
ICRA
2003
IEEE
125views Robotics» more  ICRA 2003»
14 years 2 months ago
Online footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
ECCV
2002
Springer
14 years 11 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
14 years 2 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
ICPR
2002
IEEE
14 years 10 months ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...