A robust negative obstacle detection method using seed-growing and dynamic programming for visually-impaired/blind persons
暂无分享,去创建一个
[1] Radim Sára,et al. Finding the Largest Unambiguous Component of Stereo Matching , 2002, ECCV.
[2] Richard Szeliski,et al. Stereo Matching with Nonlinear Diffusion , 1998, International Journal of Computer Vision.
[3] Sebastian Thrun,et al. Stanley: The robot that won the DARPA Grand Challenge , 2006, J. Field Robotics.
[4] J P Frisby,et al. PMF: A Stereo Correspondence Algorithm Using a Disparity Gradient Limit , 1985, Perception.
[5] Pietro Perona,et al. Learning and prediction of slip from visual information , 2007, J. Field Robotics.
[6] Tae-Seok Jin,et al. Optimal moving windows for real-time road image processing , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[7] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[8] Carlo Tomasi,et al. Depth Discontinuities by Pixel-to-Pixel Stereo , 1999, International Journal of Computer Vision.
[9] Karim Faez,et al. Effective Parameters in Search Space Reduction Used in a Fast Edge-based Stereo Matching , 2005, J. Circuits Syst. Comput..
[10] Syedur Rahman. Obstacle Detection for Mobile Robots Using Computer Vision , 2005 .
[11] Yeong-Ho Ha,et al. Stereo matching algorithm based on modified wavelet decomposition process , 1997, Pattern Recognit..