Qualitative Obstacle Detection (1994) [7 citations — 3 self]
Abstract:
Three different algorithms for qualitative obstacle detection are presented in this paper. Each one is based on different assumptions. The first two algorithms are aimed at yes/no obstacle detection without indicating which points are obstacles. They have the advantage of fast determination of the existence of obstacles in a scene based on the solvability of a linear system. The first algorithm uses information about the ground plane, while the second algorithm only assumes that the ground is planar. The third algorithm continuously estimates the ground plane, and based on that determines the height of each matched point in the scene. Experimental results are presented for real and simulated data, and performances of the three algorithms under different noise levels are compared in simulation. We conclude that in terms of the robustness of performance, the third one works best. 1
Citations
| 482 | What can be seen in three dimensions with an uncalibrated stereo rig – FAUGERAS - 1992 |
| 236 | T.: Stereo from uncalibrated cameras – HARTLEY, GUPTA, et al. - 1992 |
| 95 | Motion and structure from motion in a piecewise planar environment – Faugeras, Lustman - 1988 |
| 48 | Obstacle detection by evaluation of optical flow fields from image sequences – Enkelmann - 1990 |
| 47 | Obstacle avoidance using flow field divergence – Nelson, Aloimonos - 1989 |
| 9 | Perception control for obstacle detection by a cross-country rover – Grandjean, Matthies - 1993 |
| 7 | Progress in computer vision at the University of Massachusetts – Hanson, Riseman, et al. - 1993 |
| 2 | Decomposition of A matrix – Zhang - 1994 |

