z-logo
open-access-imgOpen Access
Robust detection system of illegal lane changes based on tracking of feature points
Author(s) -
Lee Heesin,
Jeong Sunghwan,
Lee Joonwhoan
Publication year - 2013
Publication title -
iet intelligent transport systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.579
H-Index - 45
eISSN - 1751-9578
pISSN - 1751-956X
DOI - 10.1049/iet-its.2011.0210
Subject(s) - feature (linguistics) , artificial intelligence , tracking (education) , computer vision , heading (navigation) , computer science , feature extraction , segmentation , salient , tracking system , computation , pattern recognition (psychology) , engineering , algorithm , kalman filter , aerospace engineering , psychology , pedagogy , philosophy , linguistics
This study proposes a robust real‐time system to detect vehicles that change lanes illegally based on tracking feature points. The algorithm in the system does not need to switch depending on the illumination conditions, such as day and night. The camera is assumed to be heading in the opposite direction to the traffic flow. Before starting, the system manager should initially designate several regions that are utilised for detection. Then, the proposed algorithm consists of three stages, such as extracting feature points of corners, tracking the feature points attached to vehicles and detecting a vehicle that violates legal lane changes. For the feature extraction stage, the authors used a robust and fast algorithm that can provide stable corners without distinguishing between day and night or weather conditions. Salient points are selected among the corner points for registration and tracking. Normalised cross‐correlation is used to track the registered feature points. Finally, illegal change‐of‐lane is determined by the information obtained from the tracked corners without grouping them for segmentation. The proposed system showed excellent performance in terms of the accuracy and the computation speed.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here