An Unsupervised Approach for Road Surface Crack Detection

Sadia Mubashshira, Md. Rasel Azam, Sk. Md. Masudul Ahsan
{"title":"An Unsupervised Approach for Road Surface Crack Detection","authors":"Sadia Mubashshira, Md. Rasel Azam, Sk. Md. Masudul Ahsan","doi":"10.1109/TENSYMP50017.2020.9231023","DOIUrl":null,"url":null,"abstract":"Road surface distress is one of the major concerns for safety in transportation management. Surface crack is the initial stage for the structural breakdown of the asphalt pavement which may gradually deteriorate to potholes resulting in huge reforming cost in the later stage. So, detection of road surface cracks needs a good extent of attention for avoiding these inconsistency of transportation sector. Traditional manual inspection usually performed through human visualization which requires huge amount of time. So, in order to automate this inspection, an unsupervised approach has been proposed in order to detect the pavement cracks. Therefore, a method has been proposed to detect the road surface domain on the basis of color histogram analysis of pavement surfaces. K-means clustering algorithm followed by Otsu thresholding has been done for segmentation purpose in order to detect cracks on 2D road surface image. The presented algorithm provides a satisfactory result in case of detecting and localizing the crack of an image. It can effectively remove the noise and preserve edges which is very useful to attain an accuracy of good extent.","PeriodicalId":6721,"journal":{"name":"2020 IEEE Region 10 Symposium (TENSYMP)","volume":"16 1","pages":"1596-1599"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Region 10 Symposium (TENSYMP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENSYMP50017.2020.9231023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Road surface distress is one of the major concerns for safety in transportation management. Surface crack is the initial stage for the structural breakdown of the asphalt pavement which may gradually deteriorate to potholes resulting in huge reforming cost in the later stage. So, detection of road surface cracks needs a good extent of attention for avoiding these inconsistency of transportation sector. Traditional manual inspection usually performed through human visualization which requires huge amount of time. So, in order to automate this inspection, an unsupervised approach has been proposed in order to detect the pavement cracks. Therefore, a method has been proposed to detect the road surface domain on the basis of color histogram analysis of pavement surfaces. K-means clustering algorithm followed by Otsu thresholding has been done for segmentation purpose in order to detect cracks on 2D road surface image. The presented algorithm provides a satisfactory result in case of detecting and localizing the crack of an image. It can effectively remove the noise and preserve edges which is very useful to attain an accuracy of good extent.
路面裂纹检测的一种无监督方法
路面破损是交通安全管理的主要问题之一。表面裂缝是沥青路面结构破坏的初始阶段,后期可能逐渐恶化为凹坑,造成巨大的改造成本。因此,为了避免交通部门的这些不一致,路面裂缝的检测需要得到很好的重视。传统的人工检测通常通过人工可视化来完成,这需要耗费大量的时间。因此,为了使这种检测自动化,提出了一种无监督的方法来检测路面裂缝。为此,提出了一种基于路面颜色直方图分析的路面域检测方法。为了检测二维路面图像上的裂纹,采用K-means聚类算法和Otsu阈值分割算法进行分割。该算法在图像裂纹的检测和定位中取得了满意的结果。它能有效地去除噪声并保持边缘,这对获得较好的精度非常有用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信