We present a new application of computer vision: continuous measurement of the geometrical visibility range on inter-urban roads, solely based on a monocular image acquisition system. To tackle this problem, we propose first a road segmentation scheme based on a Parzen-windowing of a color feature space with an original update that allows us to cope with heterogeneously paved-roads, shadows and reflections, observed under various and changing lighting conditions. Second, we address the under-constrained problem of retrieving the depth information along the road based on the flat word assumption. This is performed by a new region-fitting iterative least squares algorithm, derived from half-quadratic theory, able to cope with vanishing-point estimation, and allowing us to estimate the geometrical visibility range.
Backward Segmentation and Region Fitting for Geometrical Visibility Range Estimation
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
2007-01-01
10 pages
Article/Chapter (Book)
Electronic Resource
English
Mobile Robot , Road Region , Polynomial Curf , Pavement Material , Road Boundary Computer Science , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics , Pattern Recognition , Artificial Intelligence , Biometrics , Algorithm Analysis and Problem Complexity
Range Segmentation Using Visibility Constraints
British Library Online Contents | 2002
|Range segmentation using visibility constraints
IEEE | 2001
|Range Segmentation Using Visibility Constraints
British Library Conference Proceedings | 2001
|