Paper
8 July 2011 Negative obstacle detection from image sequences
Tingbo Hu, Yiming Nie, Tao Wu, Hangen He
Author Affiliations +
Proceedings Volume 8009, Third International Conference on Digital Image Processing (ICDIP 2011); 80090Y (2011) https://doi.org/10.1117/12.896288
Event: 3rd International Conference on Digital Image Processing, 2011, Chengdu, China
Abstract
Negative obstacle detection has been a challenging topic. In the previous researches, the distance that negative obstacles can be detected is so near that vehicles have to travel at a very low speed. In this paper, a negative obstacle detection algorithm from image sequences is proposed. When negative obstacles are far from the vehicle, color appearance models are used as the cues of detecting negative obstacles, while negative obstacles get closer, geometrical cues are extracted from stereo vision. Furthermore, different cues are combined in a Bayesian framework to detect obstacles in image sequences. Massive experiments show that the proposed negative obstacle detection algorithm is quite effective. The alarming distance for 0.8 m width negative obstacle is 18m, and the confirming distance is 10 m. This supplies more space for vehicles to slow down and avoid obstacles. Then, the security of the UGV running in the field can be improved remarkably.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tingbo Hu, Yiming Nie, Tao Wu, and Hangen He "Negative obstacle detection from image sequences", Proc. SPIE 8009, Third International Conference on Digital Image Processing (ICDIP 2011), 80090Y (8 July 2011); https://doi.org/10.1117/12.896288
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications and 2 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Edge detection

3D image processing

Sensors

Cameras

Copper

Image segmentation

Back to Top