基于启发式搜索的车道线识别算法研究

计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (31): 206-209.

基于启发式搜索的车道线识别算法研究

陈军¹,赵玉凡²,徐友春²,彭永胜²,袁一²

1.天津大学机械工程学院,天津 300072
2.军事交通学院汽车工程系,天津 300161

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-01 发布日期:2007-11-01
通讯作者: 陈军

Study on lane mark identification algorithm based on heuristic search

CHEN Jun¹,ZHAO Yu－fan²,XU You－chun²,PENG Yong－sheng²,YUAN Yi²

1.School of Mechanical Engineering,Tianjin University,Tianjin 300072,China
2.Department of Automobile,Military Transportation Institute,Tianjin 300161,China

Received:1900-01-01 Revised:1900-01-01 Online:2007-11-01 Published:2007-11-01
Contact: CHEN Jun

摘要/Abstract

摘要： 在车道边界识别中,边界点的提取是关键,常用的边界点提取方法因对噪声的抑制能力不强产生较多噪声点,从而影响识别效果。提出一种边界点启发式搜索算法,根据梯形匹配模型、车道线灰度变化特征和实际车道宽度约束,确定搜索的起始点,从起始点根据度量代价准则函数搜索车道边界点。采用直线道路模型结合Hough变换来拟合车道边界。实验表明,该算法实时性好、可靠性强、鲁棒性高。

Abstract: Extracting the lane edge point is the key technology for lane marks identification.The method in common use often produces many noise points for lacking of restraint ability to noise.In that way it will bring departure during the lane boundary matching process and the identification result is bad.In this paper the tracking algorithm based on heuristic search is proposed.The starting point is positioned according to the trapezia matching model,gray change property of lane markings and the restraint of real lane width.Then we search the lane edge point from the start point with the tolerance cost rule function.The lane boundary is matched by Hough transform with linear model.Experimental results prove that the algorithm is robust and can fulfill the real time requirement of road identification.

陈军¹,赵玉凡²,徐友春²,彭永胜²,袁一². 基于启发式搜索的车道线识别算法研究[J]. 计算机工程与应用, 2007, 43(31): 206-209.

CHEN Jun¹,ZHAO Yu－fan²,XU You－chun²,PENG Yong－sheng²,YUAN Yi². Study on lane mark identification algorithm based on heuristic search[J]. Computer Engineering and Applications, 2007, 43(31): 206-209.