Road lane segmentation using dynamic programming for active safety vehicles

82Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Vision-based systems for finding road lanes have to operate robustly under a wide variety of environmental conditions including large amount of scene clutters. This paper presents a method to find the lane boundaries by combining a local line extraction method and dynamic programming . The line extractor obtains an initial position of road lane boundaries from the noisy edge fragments. Then, dynamic programming improves the initial approximation to an accurate configuration of lane boundaries. Input image frame is divided into sub-regions along the vertical direction. The local line extractor extracts candidate lines of road lanes in the sub-region. Most prominent lines are found among candidate lines by dynamic programming that minimizes the functional which measures the deviation from a virtual straight line. The search framework based on DP method reduces computational cost. Experimental results using images of real road scenes demonstrate the feasibility of the proposed algorithm. © 2003 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Kang, D. J., & Jung, M. H. (2003). Road lane segmentation using dynamic programming for active safety vehicles. Pattern Recognition Letters, 24(16), 3177–3185. https://doi.org/10.1016/j.patrec.2003.08.003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free