FoSA: F* Seed-growing Approach for crack-line detection from pavement images

被引:169
作者
Li, Qingquan [1 ,2 ]
Zou, Qin [1 ,2 ]
Zhang, Daqiang [3 ]
Mao, Qingzhou [1 ]
机构
[1] Wuhan Univ, Transportat Res Ctr, Wuhan 430079, Peoples R China
[2] Wuhan Univ, Sch Remote Sensing & Informat Engn, Wuhan 430079, Peoples R China
[3] Nanjing Normal Univ, Sch Comp Sci, Nanjing 210097, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Line detection; Pavement crack; Seed-growing; Dynamic programming; CURVILINEAR FEATURES; ROADS;
D O I
10.1016/j.imavis.2011.10.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most existing approaches for pavement crack line detection implicitly assume that pavement cracks in images are with high contrast and good continuity. This assumption does not hold in pavement distress detection practice, where pavement cracks are often blurry and discontinuous due to particle materials of road surface, crack degradation, and unreliable crack shadows. To this end, we propose in this paper FoSA - F* Seed-growing Approach for automatic crack-line detection, which extends the F* algorithm in two aspects. It exploits a seed-growing strategy to remove the requirement that the start and end points should be set in advance. Moreover, it narrows the global searching space to the interested local space to improve its efficiency. Empirical study demonstrates the correctness, completeness and efficiency of FoSA. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:861 / 872
页数:12
相关论文
共 40 条
[1]  
[Anonymous], P 5 IB S PATT REC LI
[2]  
[Anonymous], 2008, P 16 EUR SIGN PROC C
[3]  
[Anonymous], P INT C COMP EL ENG
[4]  
[Anonymous], 1889 INRIA HEBR U
[5]  
[Anonymous], 1956, NETWORK FLOW THEORY
[6]  
[Anonymous], ISPRS INT ARCH PHOTO
[7]  
[Anonymous], TRR J TRANSPORTATION
[8]  
[Anonymous], P INT C EL MEAS INST
[9]  
[Anonymous], J TRANSP ENG ASCE
[10]   Evaluating pavement cracks with bidimensional empirical mode decomposition [J].
Ayenu-Prah, Albert ;
Attoh-Okine, Nii .
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2008, 2008 (1)