检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹义亲[1] 谢舒慧 CAO Yiqin;XIE Shuhui(School of Software, East China Jiaotong University, Nanchang 330013, China)
机构地区:[1]华东交通大学软件学院
出 处:《交通信息与安全》2019年第5期78-83,93,共7页Journal of Transport Information and Safety
基 金:国家自然科学基金项目(61663009);江西省科技支撑计划重点项目(20161BBE50081)资助
摘 要:针对现有钢轨表面缺陷检测方法复杂度过高且精确率较低,提出基于Sigmoid对比度拉伸的距离正则化水平集算法。通过对数变换和均值操作对钢轨图像进行预处理;根据钢轨表面图像梯度变化,以Sigmoid对比度拉伸方法替换距离正则化水平集中的停止函数;根据初始轮廓曲线演化方向的特点,通过新的自适应速度函数替换距离正则化水平集中的演化速度常量;以曲线演化的最终轮廓提取缺陷区域。仿真实验显示,新算法在钢轨表面缺陷数据集中的精确率为99.07%,豪斯多夫距离平均值为6.64,检测缺陷用时为16.46s。与DRLSE、DCNNs和CTFM算法相比,改进的距离正则化水平集算法提升了检测的精确率和检测速度,对噪声具有一定的鲁棒性并适用小范围缺陷检测。Detection methods of rail surface defects concerning high complexity and low accuracy. An algorithm of distance regularized level set based on Sigmoid contrast stretching method is proposed. Firstly, preprocess images of rails through logarithm transform and mean operation. Then, according to gradient change of rail surface image, use Sigmoid contrast stretching method to replace edge stopping function of the distance regularized level set. Considering moving tendency and features of initial contour curve, a new adaptive velocity function is used to replace the evolution velocity constant of the distance regularized level set. Finally, defect areas are located by analyzing a final contour of curve evolution. The simulation shows the accuracy rate of the algorithm in data set of rail surface defects is 99.07%;the average value of Hausdorff distance is 6.64;and the detection defect time is 6.64 s. Comparing with DRLSE, DCNNs, and CTFM, the advanced distance regularized level set improves detection precision and testing speed. It has a more preferable robustness to noise and is suitable for small-scale defect detection.
关 键 词:轨道交通 钢轨表面 对比度拉伸 距离正则化水平集 缺陷提取 边缘停止函数
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.135.220.9