ML Anthology

Qualitative Obstacle Detection

Zhongfei Zhang, Richard S. Weiss, Allen R. Hanson
CVPR 1994 pp. 554-559
doi:10.1109/CVPR.1994.323881 /cvpr/1994/zhang1994cvpr-qualitative/

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

CVPR Semantic Scholar

Cite

Text

Zhang et al. "Qualitative Obstacle Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1994. doi:10.1109/CVPR.1994.323881

Markdown

[Zhang et al. "Qualitative Obstacle Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1994.](https://mlanthology.org/cvpr/1994/zhang1994cvpr-qualitative/) doi:10.1109/CVPR.1994.323881

BibTeX

@inproceedings{zhang1994cvpr-qualitative,
  title     = {{Qualitative Obstacle Detection}},
  author    = {Zhang, Zhongfei and Weiss, Richard S. and Hanson, Allen R.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1994},
  pages     = {554-559},
  doi       = {10.1109/CVPR.1994.323881},
  url       = {https://mlanthology.org/cvpr/1994/zhang1994cvpr-qualitative/}
}