A cross-scale constrained dynamic programming algorithm for stereo matching

2017 ◽  
Author(s):  
Sipei Cheng ◽  
Feipeng Da ◽  
Jian Yu ◽  
Yuan Huang ◽  
Shaoyan Gai
2013 ◽  
Vol 709 ◽  
pp. 527-533 ◽  
Author(s):  
Xin Hui Jiang ◽  
Shao Jun Yu ◽  
Xing Jiang

The disparity map of dynamic programming method is poor. To overcome it, a stereo matching method based on multi-scale plane set is proposed in this paper. This method converts the structural model into the plane set. Define the key plane. Then the key planes are in a high-scale. The other planes are in the low scale. Stereo matching the multi-scale plane set using dynamic programming method. The experimental results show that: this method can solve the dynamic programming algorithm`s problem that disparity map has low matching accuracy and a lot of stripes error.


Author(s):  
A. Meghdari ◽  
H. Sayyaadi

Abstract An optimization technique based on the well known Dynamic Programming Algorithm is applied to the motion control trajectories and path planning of multi-jointed fingers in dextrous hand designs. A three fingered hand with each finger containing four degrees of freedom is considered for analysis. After generating the kinematics and dynamics equations of such a hand, optimum values of the joints torques and velocities are computed such that the finger-tips of the hand are moved through their prescribed trajectories with the least time or/and energy to reach the object being grasped. Finally, optimal as well as feasible solutions for the multi-jointed fingers are identified and the results are presented.


Sign in / Sign up

Export Citation Format

Share Document