This paper proposes an efficient approach for vision-based lane-markings tracking. A robust and fast detection method is used to initialize the location of the lane-markings in the first frame of consecutive video sequences, and then process the lane-markings tracking phase. Due to the little change of the lane-markings location between consecutive frames in high sampling rate, Kalman filter is utilized to predict the lane-markings location of the next frame, and update the predicted lane-markings location via simple lane boundary detection. Therefore, the trend of lane-markings should be tracked robustness in the same frame and be applied to real-time intelligent vehicles. The experiments show that the proposed method is satisfactory to shadowy, non-continuous and continuous with curvature lane-markings.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Robust lane-markings tracking algorithm based on boundary detection and Kalman filter


    Contributors:


    Publication date :

    2008


    Size :

    4 Seiten, 12 Bilder, 7 Quellen



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Real-Time Robust Lane Marking Detection and Tracking for Degraded Lane Markings

    Smart, Michael / Vaishnav, Satish / Waslander, Steven | British Library Conference Proceedings | 2017


    Real-Time Robust Lane Marking Detection and Tracking for Degraded Lane Markings

    Smart, Michael / Vaishnav, Satish / Waslander, Steven | SAE Technical Papers | 2017


    The Detection of Lane Boundary Markings Using the Modified Spoke Filter

    Haga, T. / Sasakawa, K. / Kuroda, S. et al. | British Library Conference Proceedings | 1995


    Robust lane markings detection and road geometry computation

    López, A. / Serrat, J. / Cañero, C. et al. | Springer Verlag | 2010


    Robust lane markings detection and road geometry computation

    López, A. / Serrat, J. / Cañero, C. et al. | Online Contents | 2010