Zhe Li, Tuo Zhang, Yi Miao, Jiupeng Zhang, Mehran Eskandari Torbaghan, Yinzhang He, Jiasheng Dai
{"title":"自动量化沥青路面的裂缝长度和宽度","authors":"Zhe Li, Tuo Zhang, Yi Miao, Jiupeng Zhang, Mehran Eskandari Torbaghan, Yinzhang He, Jiasheng Dai","doi":"10.1111/mice.13344","DOIUrl":null,"url":null,"abstract":"<p>Rapid, accurate, and fully automated estimation of both length and width of asphalt pavement cracks, essential for achieving a proactive asset management, presents a significant challenge, primarily due to limitations in the effectiveness of automatic image segmentation and the accuracy of crack width and length estimation algorithms. To address this challenge, this paper introduces the Branch Growing (BG) algorithm, specifically designed for crack length estimation in asphalt pavements, along with an optimized OrthoBoundary algorithm tailored for crack width estimation. Leveraging four widely adopted deep learning models for asphalt pavement crack segmentation, four distinct sets of image segmentation results have been produced. Subsequently, a comprehensive evaluation has been conducted to assess the effectiveness of both crack dimensions estimation algorithms. The findings demonstrate that the integration of the BG algorithm, the optimized OrthoBoundary algorithm, and the fully convolutional network with the HRNet backbone achieve a prediction accuracy of 80.21% for crack length estimation and 84.32% for average width estimation. Moreover, the image processing speed, at a resolution of 3024 × 3024, can be maintained at approximately 5 s, with average width estimation observed to be up to 9.1-fold faster than the unoptimized OrthoBoundary algorithm. These results signify advancements in automated crack quantification methodologies, with implications for enhancing civil infrastructure maintenance practices.</p>","PeriodicalId":156,"journal":{"name":"Computer-Aided Civil and Infrastructure Engineering","volume":"39 21","pages":"3317-3336"},"PeriodicalIF":8.5000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/mice.13344","citationCount":"0","resultStr":"{\"title\":\"Automated quantification of crack length and width in asphalt pavements\",\"authors\":\"Zhe Li, Tuo Zhang, Yi Miao, Jiupeng Zhang, Mehran Eskandari Torbaghan, Yinzhang He, Jiasheng Dai\",\"doi\":\"10.1111/mice.13344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Rapid, accurate, and fully automated estimation of both length and width of asphalt pavement cracks, essential for achieving a proactive asset management, presents a significant challenge, primarily due to limitations in the effectiveness of automatic image segmentation and the accuracy of crack width and length estimation algorithms. To address this challenge, this paper introduces the Branch Growing (BG) algorithm, specifically designed for crack length estimation in asphalt pavements, along with an optimized OrthoBoundary algorithm tailored for crack width estimation. Leveraging four widely adopted deep learning models for asphalt pavement crack segmentation, four distinct sets of image segmentation results have been produced. Subsequently, a comprehensive evaluation has been conducted to assess the effectiveness of both crack dimensions estimation algorithms. The findings demonstrate that the integration of the BG algorithm, the optimized OrthoBoundary algorithm, and the fully convolutional network with the HRNet backbone achieve a prediction accuracy of 80.21% for crack length estimation and 84.32% for average width estimation. Moreover, the image processing speed, at a resolution of 3024 × 3024, can be maintained at approximately 5 s, with average width estimation observed to be up to 9.1-fold faster than the unoptimized OrthoBoundary algorithm. These results signify advancements in automated crack quantification methodologies, with implications for enhancing civil infrastructure maintenance practices.</p>\",\"PeriodicalId\":156,\"journal\":{\"name\":\"Computer-Aided Civil and Infrastructure Engineering\",\"volume\":\"39 21\",\"pages\":\"3317-3336\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1111/mice.13344\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer-Aided Civil and Infrastructure Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1111/mice.13344\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Civil and Infrastructure Engineering","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/mice.13344","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Automated quantification of crack length and width in asphalt pavements
Rapid, accurate, and fully automated estimation of both length and width of asphalt pavement cracks, essential for achieving a proactive asset management, presents a significant challenge, primarily due to limitations in the effectiveness of automatic image segmentation and the accuracy of crack width and length estimation algorithms. To address this challenge, this paper introduces the Branch Growing (BG) algorithm, specifically designed for crack length estimation in asphalt pavements, along with an optimized OrthoBoundary algorithm tailored for crack width estimation. Leveraging four widely adopted deep learning models for asphalt pavement crack segmentation, four distinct sets of image segmentation results have been produced. Subsequently, a comprehensive evaluation has been conducted to assess the effectiveness of both crack dimensions estimation algorithms. The findings demonstrate that the integration of the BG algorithm, the optimized OrthoBoundary algorithm, and the fully convolutional network with the HRNet backbone achieve a prediction accuracy of 80.21% for crack length estimation and 84.32% for average width estimation. Moreover, the image processing speed, at a resolution of 3024 × 3024, can be maintained at approximately 5 s, with average width estimation observed to be up to 9.1-fold faster than the unoptimized OrthoBoundary algorithm. These results signify advancements in automated crack quantification methodologies, with implications for enhancing civil infrastructure maintenance practices.
期刊介绍:
Computer-Aided Civil and Infrastructure Engineering stands as a scholarly, peer-reviewed archival journal, serving as a vital link between advancements in computer technology and civil and infrastructure engineering. The journal serves as a distinctive platform for the publication of original articles, spotlighting novel computational techniques and inventive applications of computers. Specifically, it concentrates on recent progress in computer and information technologies, fostering the development and application of emerging computing paradigms.
Encompassing a broad scope, the journal addresses bridge, construction, environmental, highway, geotechnical, structural, transportation, and water resources engineering. It extends its reach to the management of infrastructure systems, covering domains such as highways, bridges, pavements, airports, and utilities. The journal delves into areas like artificial intelligence, cognitive modeling, concurrent engineering, database management, distributed computing, evolutionary computing, fuzzy logic, genetic algorithms, geometric modeling, internet-based technologies, knowledge discovery and engineering, machine learning, mobile computing, multimedia technologies, networking, neural network computing, optimization and search, parallel processing, robotics, smart structures, software engineering, virtual reality, and visualization techniques.