<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">24405</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2022.024405</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Automated Crack Detection via Semantic Segmentation Approaches Using Advanced U-Net Architecture</article-title><alt-title alt-title-type="left-running-head">Automated Crack Detection via Semantic Segmentation Approaches Using Advanced U-Net Architecture</alt-title><alt-title alt-title-type="right-running-head">Automated Crack Detection via Semantic Segmentation Approaches Using Advanced U-Net Architecture</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Ji</surname><given-names>Honggeun</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Kim</surname><given-names>Jina</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Hwang</surname><given-names>Syjung</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Park</surname><given-names>Eunil</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
<xref ref-type="aff" rid="aff-4">4</xref><email>eunilpark@skku.edu</email>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Applied Artificial Intelligence, Sungkyunkwan University</institution>, <addr-line>Seoul, 03063</addr-line>, <country>Korea</country></aff>
<aff id="aff-2"><label>2</label><institution>AI Research Team</institution>, <addr-line>Scalawox, Seoul, 08589</addr-line>, <country>Korea</country></aff>
<aff id="aff-3"><label>3</label><institution>R&#x0026;D Team, Raon Data</institution>, <addr-line>Seoul, 03073</addr-line>, <country>Korea</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Interaction Science, Sungkyunkwan University</institution>, <addr-line>Seoul, 03063</addr-line>, <country>Korea</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Eunil Park. Email: <email>eunilpark@skku.edu</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-04-13"><day>13</day>
<month>04</month>
<year>2022</year></pub-date>
<volume>34</volume>
<issue>1</issue>
<fpage>593</fpage>
<lpage>607</lpage>
<history>
<date date-type="received"><day>15</day><month>10</month><year>2021</year></date>
<date date-type="accepted"><day>05</day><month>1</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Ji et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Ji et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_24405.pdf"></self-uri>
<abstract>
<p>Cracks affect the robustness and adaptability of various infrastructures, including buildings, bridge piers, pavement, and pipelines. Therefore, the robustness and the reliability of automated crack detection are essential. In this study, we conducted image segmentation using various crack datasets by applying the advanced architecture of U-Net. First, we collected and integrated crack datasets from prior studies, including the cracks in buildings and pavements. For effective localization and detection of cracks, we used U-Net-based neural networks, ResU-Net, VGGU-Net, and EfficientU-Net. The models were evaluated by the five-fold cross-validation using several evaluation metrics including mean pixel accuracy (MPA), mean intersection over union (MIoU), and confusion matrix. The results of the integrated dataset showed that ResU-Net (68.47&#x0025;) achieves the highest MIoU with a relatively low number of parameters compared to VGGU-Net (67.71&#x0025;) and EfficientU-Net (68.07&#x0025;). In addition to the performance, ResU-Net showed the lowest test runtime, 40 milliseconds per single image, and the highest true positive rate of 45.00&#x0025; in the pixel-wise recognition test. As the models were trained and validated with diverse surfaces, the proposed approach can be used as a pre-trained model in the task with relatively few data sources. Furthermore, both practical and managerial implications are discussed herein.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Crack detection</kwd>
<kwd>semantic segmentation</kwd>
<kwd>deep learning</kwd>
<kwd>fully convolutional network</kwd>
<kwd>U-Net</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>In industrial infrastructures, cracks are repeatedly generated due to various factors such as corrosion, poor construction, and/or loading [<xref ref-type="bibr" rid="ref-1">1</xref>]. Over the past few years, several locations have suffered notable physical damage owing to cracks occurring in roads and transport pipes [<xref ref-type="bibr" rid="ref-2">2</xref>]. To prevent potential accidents caused by such cracks, significant efforts have been devoted toward detecting abnormalities using numerous different technical and administrative approaches. Traditionally, when well-trained experts conduct comprehensive investigations of specific structures, such as pipes, they utilize various datasets collected via diverse pathways from the structures (e.g., sensors) to compute and estimate the exact location or extent of specific cracks, as well as to determine the need for structural reinforcements [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. However, this approach has significant limitations. In general, a majority of traditional approaches require labor-intensive and time-consuming tasks [<xref ref-type="bibr" rid="ref-5">5</xref>&#x2013;<xref ref-type="bibr" rid="ref-7">7</xref>].</p>
<p>To address this issue, a number of remarkable techniques based on computer vision and machine learning theories have been introduced for realizing efficient crack detection and classification tasks [<xref ref-type="bibr" rid="ref-8">8</xref>&#x2013;<xref ref-type="bibr" rid="ref-10">10</xref>]. In-line with this trend, a majority of previous studies have proposed the use of deep-learning-based architectures with a convolutional neural network (CNN) to detect specific cracks [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>]. For instance, Fan et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] and Zhang et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] introduced CNN-based models with supervised learning approaches for detecting cracks in pavements and roads, respectively. In addition to deep learning models applying a CNN for road/pavement crack detection, several researchers have explored semantic segmentation approaches with models to more accurately classify whether each pixel is included in the crack dimensions [<xref ref-type="bibr" rid="ref-14">14</xref>]. Zhang et al. [<xref ref-type="bibr" rid="ref-2">2</xref>] proposed a vision-oriented crack detection system with a deep semantic segmentation network. Additionally, Lee et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] argued that a crack detection network involving image segmentation approaches can be helpful for robust crack detection tasks.</p>
<p>Based on the findings of previous studies, the current study aims to explore whether comprehensive image segmentation architectures can be employed to detect cracks in diverse surfaces, regardless of both objects and environments. With this aim, we collected integrated datasets including diverse crack images. Subsequently, three deep learning models based on the U-Net network architecture were employed to localize and detect crack positions. The remainder of this paper is organized as follows: Section 2 introduces several examples of crack detection via image-based deep learning techniques. Sections 3 and 4 describe the study methodologies and performances of the employed deep learning models, respectively. Both the implications and limitations of this study, as well as the scope for future research, are presented in Section 5.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Studies</title>
<p>Deep learning approaches using image datasets constitute an important research topic in the fields of computer science and artificial intelligence. Several previous studies have employed both digital images and deep learning architectures to solve specific industrial problems [<xref ref-type="bibr" rid="ref-16">16</xref>]. This indicates that deep learning models can be more effective and efficient when employing image datasets, as compared with traditional machine learning models [<xref ref-type="bibr" rid="ref-17">17</xref>]. Deep learning-based representation approaches employing a neural network architecture have been widely used in image classification, object detection, image captioning, and semantic segmentation [<xref ref-type="bibr" rid="ref-18">18</xref>]. In addition to deep learning approaches, the collection of large-scale image datasets (e.g., ImageNet [<xref ref-type="bibr" rid="ref-19">19</xref>]) has enabled several researchers and practitioners to successfully complete numerous large-scale visual recognition tasks.</p>
<p>In general, a CNN is organized in three dimensions (width&#x2009;&#x00D7;&#x2009;height&#x2009;&#x00D7;&#x2009;depth) with three main layers (convolutional, pooling, and connected layers). Based on this architecture, a number of CNN-based image processing models have been introduced to utilize image datasets and extract valuable features [<xref ref-type="bibr" rid="ref-20">20</xref>]. Similar to other deep learning models applied to image datasets, the detection of cracks in specific structures (so-called crack detection) is one of the adaptation domains using deep learning models. Thus, several prior studies have focused on crack detection using deep learning networks; this approach is classified into three techniques: image classification-, bounding-box-, and image segmentation-based techniques [<xref ref-type="bibr" rid="ref-21">21</xref>]. <xref ref-type="table" rid="table-1">Tab. 1</xref> summarizes prior studies.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Summary of prior studies on crack detection using deep learning models (FWIoU: Frequency Weighted Intersection over Union)</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Sources</th>
<th align="left">Method</th>
<th align="left">Dataset</th>
<th align="left">Results</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Wang et al. [<xref ref-type="bibr" rid="ref-22">22</xref>]</td>
<td align="left">CNN and principal component analysis</td>
<td align="left">30,000 pavement crack images</td>
<td align="left">Correct rate: 97.2&#x0025; (longitudinal crack), 97.6&#x0025; (transverse crack), 90.1&#x0025; (alligator crack)</td>
</tr>
<tr>
<td align="left">Chen et al. [<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td align="left">CNN and Na&#x00EF;ve Bayes-based fusion model</td>
<td align="left">147,344 crack images, 149,460 non-crack images</td>
<td align="left">Hit rate: 98.3&#x0025;</td>
</tr>
<tr>
<td align="left">Cha et al. [<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td align="left">Faster R-CNN</td>
<td align="left">2,366 crack images</td>
<td align="left">Mean average precision: 87.8&#x0025;</td>
</tr>
<tr>
<td align="left">Yang et al. [<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td align="left">FCN</td>
<td align="left">More than 800 crack images</td>
<td align="left">Accuracy: 97.96&#x0025;, Precision: 81.73&#x0025;, Recall: 78.97&#x0025;, F1 score: 79.95&#x0025;</td>
</tr>
<tr>
<td align="left">Dung et al. [<xref ref-type="bibr" rid="ref-1">1</xref>]</td>
<td align="left">VGG network, FCN with VGG backbone</td>
<td align="left">40,000 (classification), 600 crack images (segmentation)</td>
<td align="left">Accuracy: 99.9&#x0025; (classification), Average precision 89.3&#x0025; (segmentation)</td>
</tr>
<tr>
<td align="left">Zhang et al. [<xref ref-type="bibr" rid="ref-2">2</xref>]</td>
<td align="left">FCN with dilated convolution</td>
<td align="left">600 crack images</td>
<td align="left">Pixel accuracy: 96.84&#x0025;, Mean pixel accuracy: 92.55&#x0025;, MIoU: 86.05&#x0025;, FWIoU: 94.22&#x0025;</td>
</tr>
<tr>
<td align="left">Pan et al. [<xref ref-type="bibr" rid="ref-26">26</xref>]</td>
<td align="left">SCHNet (Spatial-Channel Hierarchical Network)</td>
<td align="left">11,000 pavement and concrete images</td>
<td align="left">MIoU: 85.31&#x0025;</td>
</tr>
<tr>
<td align="left">Ji et al. [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td align="left">DeepLabv3&#x002B;</td>
<td align="left">300 pavement crack images</td>
<td align="left">MIoU: 73.31&#x0025;</td>
</tr>
<tr>
<td align="left">Liu et al. [<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td align="left">ResNet based U-Net with YOLO detector</td>
<td align="left">7,104 pavement crack images</td>
<td align="left">F1 score: 90.58&#x0025; (detection), 95.75&#x0025; (segmentation)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The traditional application of a CNN architecture involves an image classification task to determine whether an image includes a distinguishable crack. Using this approach and task, the classifier is generally organized into an input layer, convolutional layers (for extracting specific characteristics), pooling layers (for reducing the number of dimensions), and connected layers. Wang et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] used a CNN architecture and component analyses to classify pavement cracks, achieving accuracies of 97.2&#x0025;, 97.6&#x0025;, and 90.1&#x0025; for longitudinal, diagonal, and alligator cracks, respectively. Chen et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] introduced a deep learning model with both CNN and na&#x00EF;ve Bayes-based fusion schemes for detecting cracks on the surface of a nuclear power plant, achieving a hit rate of 98.3&#x0025; per frame.</p>
<p>One of the notable approaches using a CNN architecture for crack detection is a bounding box task. This task aims to specify certain sliding windows for crack locations. Cha et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] proposed a visual inspection method with a faster region-based CNN (Faster R-CNN) for detecting cracks in concrete and steel surfaces. Based on 2,366 collected images, the proposed method yielded precision rates of 90.6&#x0025;, 83.4&#x0025;, 82.1&#x0025;, 98.1&#x0025;, and 84.7&#x0025; when detecting five different types of damage in concrete and steel surfaces, respectively.</p>
<p>Although deep learning models for image classification and bounding box tasks have achieved excellent performance, the models for these tasks have notable limitations in terms of their practical applicability. As one of the most representative limitations, the models for these tasks are unable to precisely indicate crack regions. In addition, large crack shapes occur on diverse surfaces, which needs to be addressed and considered in crack detection tasks [<xref ref-type="bibr" rid="ref-2">2</xref>]. To address the abovementioned limitations, a semantic segmentation task that focuses on both crack detection and image classification, while also considering each pixel, is required. In general, a fully convolutional network (FCN) is employed for pixel-wise classification. For instance, Yang et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] utilized the FCN architecture for detecting diversely categorized cracks with an accuracy of 97.96&#x0025;. In addition, Dung et al. [<xref ref-type="bibr" rid="ref-1">1</xref>] proposed an FCN-based model using a VGG network as the backbone. To successfully detect concrete cracks, the implemented FCN with pre-trained VGG-16 models was employed, achieving a precision ratio of 90&#x0025;. Zhang et al. [<xref ref-type="bibr" rid="ref-2">2</xref>] employed both an FCN and a dilated convolutional layer to observe concrete cracks; this model, validated on 600 images, resulted in a mean pixel accuracy (MPA) of 92.55&#x0025; and a mean intersection over union (MIoU) of 86.05&#x0025;. Pan et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] proposed SCHNet, a segmentation model for concrete crack based on VGG-19 with self-attention mechanism. With the data augmentation method, SCHNet achieved MIoU of 85.31&#x0025;.</p>
<p>Encoder-decoder architectures have been employed to achieve better performance than general deep learning models [<xref ref-type="bibr" rid="ref-27">27</xref>]. Thus, researchers have focused on U-Net, which is an FCN with an encoder-decoder architecture, for image segmentation [<xref ref-type="bibr" rid="ref-28">28</xref>]. Ji et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] applied the DeepLabV3&#x002B; with the encoder-decoder architecture to asphalt pavements. The model, trained for 250 images, recorded 0.8342 MIoU for validation data and 0.7331 for an external validation set with 80 images. Liu et al. [<xref ref-type="bibr" rid="ref-30">30</xref>] proposed a detection and segmentation method using ResNet-34 based U-Net with a YOLO detector. The proposed two-step approaches scored 90.58&#x0025;, 95.75&#x0025; f-1 score in detection and segmentation. In general, U-Net can be employed to present more accurate image locations by delivering feature matrices from the encoder to the corresponding decoder. Therefore, this study employs U-Net-based approaches to explore whether comprehensive image segmentation architectures can be employed to detect cracks in diverse surfaces, regardless of both objects and environments.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Methods</title>
<p>In this study, to explore crack outlines, three U-Net-based models designed for semantic segmentation tasks were employed. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> provides an overview of the proposed architecture. Each U-Net model employed was trained using the datasets of crack images and subsequently validated using test datasets.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Overview of the proposed architecture</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_24405-fig-1.png"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Dataset</title>
<p>We employed crack image datasets of diverse surfaces such as pavements or concrete<xref ref-type="fn" rid="fn1"><sup>1</sup></xref><fn id="fn1"><label>1</label><p><uri link="https://github.com/khanhha/crack_segmentation">https://github.com/khanhha/crack_segmentation</uri></p></fn>. This dataset includes more than 11,200 RGB and annotated masked crack images [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-31">31</xref>&#x2013;<xref ref-type="bibr" rid="ref-35">35</xref>]. We also used the additional road-crack image dataset [<xref ref-type="bibr" rid="ref-1">1</xref>], which is organized into 11,449 images in total (pavement: 4650, concrete: 6,799). All the images were then resized to 224&#x2009;&#x00D7;&#x2009;224, and each pixel was normalized to between zero and 1 (<xref ref-type="fig" rid="fig-2">Fig. 2</xref>).</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Examples of original and ground truth images from combined dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_24405-fig-2.png"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Semantic Segmentation Models</title>
<p>To detect cracks in diverse materials using a large-scale dataset, we employed three U-Net based models: VGGU-Net, ResU-Net [<xref ref-type="bibr" rid="ref-36">36</xref>], and EfficientU-Net [<xref ref-type="bibr" rid="ref-37">37</xref>]. Moreover, <xref ref-type="table" rid="table-2">Tab. 2</xref> shows the number of parameters and layers in this study.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Comparison of parameters and layers of each model</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Model</th>
<th align="left">Number of parameters</th>
<th align="left">Number of layers</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">VGGU-Net</td>
<td align="left">3,903,489</td>
<td align="left">39</td>
</tr>
<tr>
<td align="left">ResU-Net</td>
<td align="left">4,723,057</td>
<td align="left">95</td>
</tr>
<tr>
<td align="left">EfficientU-Net</td>
<td align="left">11,472,361</td>
<td align="left">443</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>VGGU-Net</title>
<p>VGGU-Net was proposed by Simonyan et al. [<xref ref-type="bibr" rid="ref-37">37</xref>]. This model is organized using U-Net architecture and a VGG network as the encoder. As a feature extraction component, the VGG network reduces a set of high-dimensional features in raw images to low-dimensional features with multiple convolutional and pooling layers. In general, the extracted features in the VGG network are linked to a fully connected layer. Thereafter, the output of the layer is estimated and obtained via the activation function.</p>
<p>However, in this study, the feature extraction component of the VGG network, i.e., the multiple convolutional and pooling layers, were used. Subsequently, the decoding components, including the de-convolutional, convolutional, and up-sampling layers, were added. The architecture of the proposed VGGU-Net is presented in <xref ref-type="fig" rid="fig-4">Fig. 4a</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Models employed in this study. (a) It represents the structure of VGGU-Net, which utilizes the VGG network as an encoder. (b) It represents the structure of ResU-Net with a residual block in the encoder and decoder. (c) It represents the structure of EfficientU-Net, which comprises an EfficientNet encoder, a decoder, and an enhanced skip connection</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_24405-fig-4.png"/>
</fig>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>ResU-Net</title>
<p>ResU-Net, which includes a residual block to exclude issues regarding training degradation in deeper hidden layers [<xref ref-type="bibr" rid="ref-38">38</xref>], was employed [<xref ref-type="bibr" rid="ref-36">36</xref>]. The residual block was based on the assumption that, for the input <italic>x</italic>, it is more efficient and beneficial to optimize residual mapping issues, <italic>F</italic>(<italic>x</italic>) :&#x003D; <italic>H</italic>(<italic>x</italic>) &#x2212; <italic>x</italic>, as compared to optimizing the original mapping, <italic>H</italic>(<italic>x</italic>). As presented in <xref ref-type="fig" rid="fig-3">Fig. 3a</xref>, the operation in the residual block is represented as <italic>F</italic>(<italic>x</italic>) &#x002B; <italic>x</italic> (<italic>shortcut connection</italic>). The residual block in ResU-Net is organized as two convolutional layers with 2 kernels of 3&#x2009;&#x00D7;&#x2009;3 with batch normalization in the main flow, and a single convolutional layer with 1 kernel of 1&#x2009;&#x00D7;&#x2009;1 in <italic>shortcut connection</italic>. <xref ref-type="fig" rid="fig-4">Fig. 4b</xref> depicts the model architecture.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Residual and dense blocks</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_24405-fig-3.png"/>
</fig>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>EfficientU-Net</title>
<p>EfficientU-Net, which is an advanced model of UNet&#x002B;&#x002B; [<xref ref-type="bibr" rid="ref-26">26</xref>], and EfficientNet B4 [<xref ref-type="bibr" rid="ref-39">39</xref>] as the backbone encoder are applied. UNet&#x002B;&#x002B; is a refined architecture of U-Net, achieved by updating the <italic>skip connection</italic> with a dense block of DenseNet [<xref ref-type="bibr" rid="ref-40">40</xref>]. Moreover, DenseNet is connected among all the layers (<xref ref-type="fig" rid="fig-3">Fig. 3b</xref>). Thus, the vanishing gradient problem was addressed using the model with dense blocks.</p>
<p><xref ref-type="fig" rid="fig-4">Fig. 4c</xref> presents the model architecture of EfficientU-Net. In particular, the architecture of EfficientU-Net is organized by the enhanced <italic>skip connection</italic> (indicated in green blocks) between the encoding component as a contracting path and the decoding component as an expansive path (indicated in black arrows). Specifically, the skip connections (indicated by green and blue) integrate the feature maps of all previous blocks. An equation of the layer connection rule is described in the following <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, where <italic>H</italic> indicates the operation of block <italic>X</italic>, <italic>x</italic> stands for the output of block <italic>X</italic>, <italic>u</italic> denotes the up-sampling, and [ ] represents a concatenating operation. Moreover, <italic>i</italic> and <italic>j</italic> refer to the vertical and horizontal orders of blocks. Each block <italic>X</italic> mainly consists of two 3&#x2009;&#x00D7;&#x2009;convolution layers with batch normalization and a leaky ReLU activation function.<disp-formula id="eqn-1"><label>(1)</label>

<mml:math id="mml-eqn-1" display="block"><mml:msup><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mi>H</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>H</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:msubsup><mml:mo stretchy="false">]</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>u</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>j</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Loss Function and Optimization</title>
<p>We employed a binary cross entropy (BCE) as a loss function, which is widely used for pixel-wise binary classification (<xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>). Here, <italic>&#x03B8;</italic> is the model parameter, and <italic>n</italic>, <italic>i</italic> and <italic>j</italic> are the pixel locations. In addition, <italic>N</italic>, <italic>W</italic>, and <italic>H</italic> denote the batch size, width, and height of the input, respectively; <italic>y</italic><sub><italic>nij</italic></sub> &#x2208; &#x007B;0, 1&#x007D; represents the presence of the crack, and <italic>&#x0177;</italic> denotes the probability of the predicted class.<disp-formula id="eqn-2"><label>(2)</label>

<mml:math id="mml-eqn-2" display="block"><mml:mi>J</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>H</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>W</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>H</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>We used the adaptive moment estimation (Adam) optimization algorithm with a learning rate <italic>&#x03B7;</italic> of 0.001, <italic>&#x03B2;</italic><sub>1</sub> of 0.9, and <italic>&#x03B2;</italic><sub>2</sub> of 0.999 [<xref ref-type="bibr" rid="ref-41">41</xref>]. The batch size was set to 16.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Metrics</title>
<p>Two widely used evaluation metrics for semantic segmentation tasks were employed to evaluate the proposed models: MPA and MIoU [<xref ref-type="bibr" rid="ref-42">42</xref>]. MPA is the mean of the ratio of pixels correctly classified for each class (<xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>), where <italic>n<sub>c</sub></italic> is the number of classes, <italic>t<sub>i</sub></italic> is the total number of pixels in a specific class <italic>i</italic>, <italic>n<sub>ii</sub></italic> is the number of correctly classified pixels, and <italic>n<sub>ji</sub></italic> is the number of pixels incorrectly classified.<disp-formula id="eqn-3"><label>(3)</label>

<mml:math id="mml-eqn-3" display="block"><mml:mi>M</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>i</mml:mi></mml:munder><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p>In addition, MIoU is the mean of the overlapping area over the union between the prediction and ground truth images (<xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>).<disp-formula id="eqn-4"><label>(4)</label>

<mml:math id="mml-eqn-4" display="block"><mml:mi>M</mml:mi><mml:mi>I</mml:mi><mml:mi>o</mml:mi><mml:mi>U</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>i</mml:mi></mml:munder><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p>Also, typical evaluation metrics for classification tasks were utilized to evaluate pixel-wise crack recognition performance of the proposed models; confusion matrix, TPR (true positive rate) and FPR (false positive rate). The confusion matrix is a table layout that can visualize the performance of the model. Each row of the matrix represents a real class, and each column represents a prediction class. The confusion matrix consists of the number of <italic>TN</italic> (true negative), <italic>FP</italic> (false positive), <italic>FN</italic> (false negative), and <italic>TP</italic> (true positive). The TPR is used to measure the proportion of actual positives which are correctly identified (<xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>).<disp-formula id="eqn-5"><label>(5)</label>

<mml:math id="mml-eqn-5" display="block"><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>The FPR is a measure of false positives for whole positive predictions (<xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>).<disp-formula id="eqn-6"><label>(6)</label>

<mml:math id="mml-eqn-6" display="block"><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>The FNR is the measure that true positive is omitted by the test (<xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>).<disp-formula id="eqn-7"><label>(7)</label>

<mml:math id="mml-eqn-7" display="block"><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>Also, the TNR is the ratio that the true negative is predicted to be negative (<xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>).<disp-formula id="eqn-8"><label>(8)</label>

<mml:math id="mml-eqn-8" display="block"><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Model Training</title>
<p>We applied five-fold cross-validation procedures to validate the performance and robustness of the proposed models. The following procedures were conducted [<xref ref-type="bibr" rid="ref-43">43</xref>]: First, the entire dataset was divided into five folds, four of which were used for the training set. The last fold was employed as the testing dataset. Thereafter, the testing datasets were changed to other folds that were not previously included as the testing datasets. The average results of the five evaluations were then computed. As the current study employed 11,449 images, each fold had 2290 images; the last fold included 2289 images. We used Python language to implement all U-Net-based models based on deep learning frameworks, Tensorflow and Keras. We trained the model on an Ubuntu 18.04 machine equipped with RTX2080Ti GPU.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and Discussion</title>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> shows the results of the cross-validation procedures. ResU-Net achieved the highest convergence speed, followed by VGGU-Net and EfficientU-Net (<xref ref-type="fig" rid="fig-5">Fig. 5a</xref>). Although the BCE loss of VGGU-Net was greater than that of EfficientU-Net during the early stages of the training procedures, the BCE (Binary Cross Entropy) loss rapidly decreased.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Performance of each model with respect to training epochs. Each graph was obtained by averaging the results of the five-fold cross-validation for the employed models. (a) It depicts the variations in BCE loss. (b) It shows the changes in MPA. (c) It shows the changes in MIoU</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_24405-fig-5.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5b</xref> shows the average MPA. ResU-Net demonstrated the highest accuracy (99.02&#x0025;), followed by VGGU-Net (98.97&#x0025;) and EfficientU-Net (98.87&#x0025;). Although VGGU-Net showed the lowest training accuracy among the models during the early stage of training, after 30 epochs, it achieved accuracies higher than those of EfficientU-Net.</p>
<p><xref ref-type="fig" rid="fig-5">Fig. 5c</xref> shows the MIoU during training. The overall trend was similar to those of the BCE loss and MPA. ResU-Net showed the highest MIoU (74.86&#x0025;), followed by VGGU-Net (72.67&#x0025;) and EfficientU-Net (70.24&#x0025;). The difference in performance among the models was not significant at the beginning of training; however, as training progressed, significant differences were observed in the results of the models.</p>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> shows the average results of the five-fold cross-validation procedures for concrete images, pavement images, and the integrated images. During testing for the all images, EfficientU-Net showed the lowest BCE loss (0.04), followed by VGGU-Net (0.06) and ResU-Net (0.07). Moreover, EfficientU-Net exhibited the highest MPA (98.55&#x0025;), as compared with the other models (ResU-Net: 98.47&#x0025;, VGGU-Net: 98.46&#x0025;). However, ResU-Net achieved superior performance in terms of the MIoU (68.47&#x0025;), as compared with the other models (EfficientU-Net: 68.07&#x0025;; VGGU-Net: 67.72&#x0025;).</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Average test performance determined via five-fold cross-validation</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Dataset</th>
<th align="left">&#x0023; of images</th>
<th align="left">Model</th>
<th align="left">BCE loss</th>
<th align="left">MPA (%)</th>
<th align="left">MIoU (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left" rowspan="3">Pavement images</td>
<td align="left" rowspan="3">4,650</td>
<td align="left">VGGU-Net</td>
<td align="left">0.1339</td>
<td align="left">97.3183</td>
<td align="left">64.9058</td>
</tr>
<tr>
<td align="left">ResU-Net</td>
<td align="left">0.1565</td>
<td align="left">97.3618</td>
<td align="left">65.9357</td>
</tr>
<tr>
<td align="left">EfficientU-Net</td>
<td align="left">0.0837</td>
<td align="left"><bold>97.5103</bold></td>
<td align="left"><bold>66.6365</bold></td>
</tr>
<tr>
<td align="left" rowspan="3">Concrete images</td>
<td align="left" rowspan="3">6,799</td>
<td align="left">VGGU-Net</td>
<td align="left">0.0224</td>
<td align="left">99.2424</td>
<td align="left">69.6318</td>
</tr>
<tr>
<td align="left">ResU-Net</td>
<td align="left">0.0233</td>
<td align="left">99.2396</td>
<td align="left"><bold>70.2162</bold></td>
</tr>
<tr>
<td align="left">EfficientU-Net</td>
<td align="left">0.0168</td>
<td align="left"><bold>99.2666</bold></td>
<td align="left">69.0531</td>
</tr>
<tr>
<td align="left" rowspan="3">All images concrete &#x0026; pavement images</td>
<td align="left" rowspan="3">11,499</td>
<td align="left">VGGU-Net</td>
<td align="left">0.0676</td>
<td align="left">98.4621</td>
<td align="left">67.7175</td>
</tr>
<tr>
<td align="left">ResU-Net</td>
<td align="left">0.0773</td>
<td align="left">98.4777</td>
<td align="left"><bold>68.4787</bold></td>
</tr>
<tr>
<td align="left">EfficientU-Net</td>
<td align="left">0.0422</td>
<td align="left"><bold>98.5541</bold></td>
<td align="left">68.0750</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In the case of 4,650 pavement images, the EfficientU-Net showed the highest performance, achieving 66.63&#x0025; in MIoU and 97.51% in MPA, followed by ResUNet achieving 65.93&#x0025;, 97.36&#x0025; in terms of MIoU and MPA. However, for the concrete with 6,799 images, ResU-Net achieved 70.21&#x0025; in MIoU, showing significantly higher performance than other models (VGGU-Net: 69.63&#x0025;, EfficientU-Net: 69.05&#x0025;). Meanwhile, we could confirm that there is no significant performance gap between the three models in MPA (VGGU-Net: 69.63&#x0025;, ResU-Net: 99.23&#x0025;, EfficientU-Net: 69.05&#x0025;).</p>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> depicts the original, ground truth, and predicted images. Overall, the results of the semantic segmentation tasks using ResU-Net and EfficientU-Net were similar. It indicates that both models can be employed to effectively detect cracks in various surfaces, whereas VGGU-Net can involve notable limitations in detecting cracks that are considerably long and thin. Moreover, VGGU-Net tends to be unsuitable for detecting cracks on diverse surfaces owing to the generalized issues of the results.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Segmentation results. The original image, ground truth image, and segmentation results were obtained by employing the last fold as the test set</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_24405-fig-6.png"/>
</fig>
<p><xref ref-type="table" rid="table-4">Tab. 4</xref> shows the test runtime of each model. As ResU-Net is composed of the residual blocks, it requires 40.6250 milliseconds to process a single image, which is 1.23, 1.69 times faster than VGGU-Net (49.9998&#x2005;ms) and EfficientU-Net (68.7599&#x2005;ms).</p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>Test runtime of the employed models</title></caption>
<table><colgroup><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Model</th>
<th align="left">Test runtime (ms)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">VGGU-Net</td>
<td align="left">49.9998</td>
</tr>
<tr>
<td align="left">ResU-Net</td>
<td align="left"><bold>40.6250</bold></td>
</tr>
<tr>
<td align="left">EfficientU-Net</td>
<td align="left">68.7599</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> shows the confusion matrix calculated for each pixel of the ground truths and predicted images, and their TNR (true negative rate), FPR (false positive rate), FNR (false negative rate), and TPR (true positive rate). As shown in the first row of each confusion matrix, all models accurately predicted TN. It means that the non-crack pixels were appropriately classified as non-crack (VGGU-Net: 560,890,680, ResU-Net:560,484,708, EfficientU-Net: 561,072,993). Similarly, in TNR and FPR scores, there is no significant difference between the models. (VGGU-Net, 99.56&#x0025;, 00.44&#x0025;; ResU-Net, 99.49&#x0025;, 00.51&#x0025;; EfficientU-Net, 99.59&#x0025;, 00.41&#x0025;).</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Confusion matrix for employed segmentation models (a) It represents the confusion matrix of VGGU-Net. (b) It indicates the confusion matrix of ResU-Net. (c) It shows the confusion matrix of EfficientU-Net</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_24405-fig-7.png"/>
</fig>
<p>However, there is a huge performance gap in predicting crack pixels. As depicted in the second row of the confusion matrices, ResU-Net, which classified 4,790,667 and 5,855,140 pixels in terms of TP and FN, recognized the crack pixel accurately compared to other models. Also, ResU-Net achieved the highest TPR (45.00&#x0025;) and the lowest FNR (55.00&#x0025;) scores, which are crucial indicators in recognition of risk. It implies that ResU-Net is not only superior to other competing models in crack detection but also robust in misrecognition, i.e., judging crack pixels as non-crack.</p>
<p>EfficientU-Net yielded the highest MPA, as compared with the other U-Net-based models. In addition, ResU-Net presented the highest MIoU and TPR, as compared with the other models. Based on the experimental results, it was confirmed that ResU-Net is a more efficient and effective deep learning model for crack-related image segmentation tasks, compared with the other U-Net-based models.</p>
<p>To sum up the aforementioned results, the technical and experimental merits of using ResU-Net for various tasks can be detailed as follows:<list list-type="bullet"><list-item>
<p>The number of required parameters for ResU-Net is approximately 51&#x0025; less than that for EfficientU-Net.</p></list-item><list-item>
<p>The processing speed of ResU-Net is 1.69 times faster than that of EfficientU-Net.</p></list-item><list-item>
<p>The convergence time of ResU-Net is faster than that of the other U-Net-based models.</p></list-item><list-item>
<p>The true positive rate of ResU-Net showed the highest rate, 45.00&#x0025;.</p></list-item></list></p>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>The detection of cracks on specific surfaces is essential for efficiently maintaining and managing different types of structures. In this study, we integrated several datasets consisting of diverse surfaces such as concrete walls and pavements, in order to enhance the generalization ability of crack detection models. Three U-Net-based deep learning models, VGGU-Net, ResU-Net, and EfficientU-Net, were validated with five-fold cross-validation using several evaluation metrics including MPA, MIoU, and confusion matrix. Based on the findings of the current study, several practical and managerial implications are presented. As the proposed models are trained, implemented, and tested using datasets that are organized based on images of diverse surfaces, the models can be applied to different surfaces and structures, without being limited to specific environments such as concrete structures or pavements. It implies that the proposed models are more flexible and comprehensive than other models, when addressing more general issues than crack detection. For example, the proposed model can be used as a pretrained model in the domain such as the pipeline transportation [<xref ref-type="bibr" rid="ref-16">16</xref>], where limited data is available [<xref ref-type="bibr" rid="ref-44">44</xref>].</p>
<p>Despite the contributions of this study, a few limitations remain unaddressed. First, this study did not consider the characteristics of surfaces (e.g., material) and cracks (e.g., depth and extent). Thus, the performance of the proposed models can be further improved if characteristics of specific surface images and cracks are extracted and reflected as key features in the models. Second, recurrent-oriented schemes were not employed when designing the advanced U-Net models. Future research should focus on addressing and resolving these issues.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> This research was supported by KICT (Korea Institute of Civil Engineering and Building Technology) Grant Number [KICT 2021-13]. This research was also supported by the Korea Agency for Infrastructure Technology Advancement (KAIA) grant funded by the Ministry of Land, Infrastructure and Transport [21ATOG-C161932-01].</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. V.</given-names> <surname>Dung</surname></string-name> and <string-name><given-names>L. D.</given-names> <surname>Anh</surname></string-name></person-group>, &#x201C;<article-title>Autonomous concrete crack detection using deep fully convolutional neural network</article-title>,&#x201D; <source>Automation in Construction</source>, vol. <volume>99</volume>, pp. <fpage>52</fpage>&#x2013;<lpage>58</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>X. -G.</given-names> <surname>Yue</surname></string-name></person-group>, &#x201C;<article-title>Concrete cracks detection based on FCN with dilated convolution</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>9</volume>, pp. <fpage>2686</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Goktepe</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Ege</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Bayri</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Atalay</surname></string-name></person-group>, &#x201C;<article-title>Non-destructive crack detection using GMI sensor</article-title>,&#x201D; <source>Physica Status Solidi</source>, vol. <volume>1</volume>, pp. <fpage>3436</fpage>&#x2013;<lpage>3439</lpage>, <year>2004</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Dogaru</surname></string-name> and <string-name><given-names>S. T.</given-names> <surname>Smith</surname></string-name></person-group>, &#x201C;<article-title>Edge crack detection using a giant magneto resistance based eddy current sensor</article-title>,&#x201D; <source>Nondestructive Testing and Evaluation</source>, vol. <volume>16</volume>, pp. <fpage>31</fpage>&#x2013;<lpage>53</lpage>, <year>2000</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>J. -R.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Glazier</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Novel approach to pavement cracking detection based on fuzzy set theory</article-title>,&#x201D; <source>Journal of Computing in Civil Engineering</source>, vol. <volume>13</volume>, pp. <fpage>270</fpage>&#x2013;<lpage>280</lpage>, <year>1999</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Glazier</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Shi</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Novel approach to pavement cracking detection based on neural network</article-title>,&#x201D; <source>Transportation Research Record</source>, vol. <volume>1764</volume>, pp. <fpage>119</fpage>&#x2013;<lpage>127</lpage>, <year>2001</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Subirats</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Dumoulin</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Legeay</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Barba</surname></string-name></person-group>, &#x201C;<article-title>Automation of pavement surface crack detection using the continuous wavelet transform</article-title>,&#x201D; in <conf-name>Proc. of 2006 Int. Conf. on Image Processing</conf-name>, <conf-loc>New York, NY, USA</conf-loc>, pp. <fpage>3037</fpage>&#x2013;<lpage>3040</lpage>, <year>2006</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Dorafshan</surname></string-name>, <string-name><given-names>R. J.</given-names> <surname>Thomas</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Maguire</surname></string-name></person-group>, &#x201C;<article-title>Benchmarking image processing algorithms for unmanned aerial system-assisted crack detection in concrete structures</article-title>,&#x201D; <source>Infrastructures</source>, vol. <volume>4</volume>, pp. <fpage>19</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Koch</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Brilakis</surname></string-name></person-group>, &#x201C;<article-title>Pothole detection in asphalt pavement images</article-title>,&#x201D; <source>Advanced Engineering Informatics</source>, vol. <volume>25</volume>, pp. <fpage>507</fpage>&#x2013;<lpage>515</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>LeCun</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Bengio</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Hinton</surname></string-name></person-group>, &#x201C;<article-title>Deep learning</article-title>,&#x201D; <source>Nature</source>, vol. <volume>521</volume>, pp. <fpage>436</fpage>&#x2013;<lpage>444</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y. -J.</given-names> <surname>Cha</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Choi</surname></string-name> and <string-name><given-names>O.</given-names> <surname>B&#x00FC;y&#x00FC;k&#x00F6;zt&#x00FC;rk</surname></string-name></person-group>, &#x201C;<article-title>Deep learning-based crack damage detection using convolutional neural networks</article-title>,&#x201D; <source>Computer-Aided Civil and Infrastructure Engineering</source>, vol. <volume>32</volume>, pp. <fpage>361</fpage>&#x2013;<lpage>378</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Y. D.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>Y. J.</given-names> <surname>Zhu</surname></string-name></person-group>, &#x201C;<article-title>Road crack detection using deep convolutional neural network</article-title>,&#x201D; in <conf-name>Proc. of 2016 IEEE Int. Conf. on Image Processing</conf-name>, <conf-loc>New York, NY</conf-loc>, pp. <fpage>3708</fpage>&#x2013;<lpage>3712</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="web"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Fan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lu</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Automatic pavement crack detection based on structured prediction with the convolutional neural network</article-title>,&#x201D; <year>2018</year>. [Online]. Available: <uri xlink:href="https://arxiv.org/abs/1802.02208">https://arxiv.org/abs/1802.02208</uri>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="web"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Zhao</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Highly efficient forward and backward propagation of convolutional neural networks for pixel wise classification</article-title>,&#x201D; <year>2014</year>. [Online]. Available: <uri xlink:href="https://arxiv.org/abs/1412.4526">https://arxiv.org/abs/1412.4526</uri>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Kim</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Lee</surname></string-name></person-group>, &#x201C;<article-title>Robust concrete crack detection using deep learning-based semantic segmentation</article-title>,&#x201D; <source>International Journal of Aeronautical and Space Sciences</source>, vol. <volume>20</volume>, pp. <fpage>287</fpage>&#x2013;<lpage>299</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Fang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Luo</surname></string-name> and <string-name><given-names>P. E.</given-names> <surname>Love</surname></string-name></person-group>, &#x201C;<article-title>Falls from heights: A computer vision-based approach for safety harness detection</article-title>,&#x201D; <source>Automation in Construction</source>, vol. <volume>91</volume>, pp. <fpage>53</fpage>&#x2013;<lpage>61</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Shen</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Wu</surname></string-name> and <string-name><given-names>H. -I.</given-names> <surname>Suk</surname></string-name></person-group>, &#x201C;<article-title>Deep learning in medical image analysis</article-title>,&#x201D; <source>Annual Review of Biomedical Engineering</source>, vol. <volume>19</volume>, pp. <fpage>221</fpage>&#x2013;<lpage>248</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Ker</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Rao</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Lim</surname></string-name></person-group>, &#x201C;<article-title>Deep learning applications in medical image analysis</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, pp. <fpage>9375</fpage>&#x2013;<lpage>9389</lpage>. <year>2017</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Deng</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Socher</surname></string-name>, <string-name><given-names>L. -J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Li</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Imagenet: A large-scale hierarchical image database</article-title>,&#x201D; in <conf-name>Proc. of the 2009 IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <conf-loc>New York</conf-loc>, <publisher-name>IEEE</publisher-name>, pp. <fpage>248</fpage>&#x2013;<lpage>255</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Voulodimos</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Doulamis</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Doulamis</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Protopapadakis</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for computer vision: A brief review</article-title>,&#x201D; <source>Computational Intelligence and Neuroscience</source>, vol. <volume>2018</volume>, pp. <fpage>7068349</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Mohan</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Poobal</surname></string-name></person-group>, &#x201C;<article-title>Crack detection using image processing: A critical review and analysis</article-title>,&#x201D; <source>Alexandria Engineering Journal</source>, vol. <volume>57</volume>, pp. <fpage>787</fpage>&#x2013;<lpage>798</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Grid-based pavement crack analysis using deep learning</article-title>,&#x201D; in <conf-name>Proc. of the 2017 4th Int. Conf. on Transportation Information and Safety</conf-name>, <conf-loc>New York, NY</conf-loc>, pp. <fpage>917</fpage>&#x2013;<lpage>924</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. -C.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>M. R.</given-names> <surname>Jahanshahi</surname></string-name></person-group>, &#x201C;<article-title>Nb-cnn: Deep learning-based crack detection using convolutional neural network and na&#x00EF;ve Bayes data fusion</article-title>,&#x201D; <source>IEEE Transactions on Industrial Electronics</source>, vol. <volume>65</volume>, pp. <fpage>4392</fpage>&#x2013;<lpage>4400</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y. -J.</given-names> <surname>Cha</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Choi</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Suh</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mahmoudkhani</surname></string-name> and <string-name><given-names>O.</given-names> <surname>B&#x00FC;y&#x00FC;k&#x00F6;zt&#x00FC;rk</surname></string-name></person-group>, &#x201C;<article-title>Autonomous structural visual inspection using region-based deep learning for detecting multiple damage types</article-title>,&#x201D; <source>Computer-Aided Civil and Infrastructure Engineering</source>, vol. <volume>33</volume>, pp. <fpage>731</fpage>&#x2013;<lpage>747</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Huang</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Automatic pixel-level crack detection and measurement using fully convolutional network</article-title>,&#x201D; <source>Computer-Aided Civil and Infrastructure Engineering</source>, vol. <volume>33</volume>, pp. <fpage>1090</fpage>&#x2013;<lpage>1109</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Pan</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>A Spatial-channel hierarchical deep learning network for pixel-level automated crack detection</article-title>,&#x201D; <source>Automation in Construction</source>, vol. <volume>119</volume>, pp. 103357, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>M. M. R.</given-names> <surname>Siddiquee</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Tajbakhsh</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Liang</surname></string-name></person-group>, &#x201C;<chapter-title>Unet&#x002B;&#x002B;: A nested u-net architecture for medical image segmentation</chapter-title>,&#x201D; in <source>Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support</source>, <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>3</fpage>&#x2013;<lpage>11</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>O.</given-names> <surname>Ronneberger</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Fischer</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Brox</surname></string-name></person-group>, &#x201C;<chapter-title>U-net: Convolutional networks for biomedical image segmentation</chapter-title>, in <source>Medical Image Computing and Computer-Assisted Intervention&#x2013;MICCAI 2015</source>, <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>234</fpage>&#x2013;<lpage>241</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Ji</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Xue</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Luo</surname></string-name>, and <string-name><given-names>W.</given-names> <surname>Xue</surname></string-name></person-group>, &#x201C;<article-title>An integrated approach to automatic pixel-level crack detection and quantification of asphalt pavement</article-title>,&#x201D; <source>Automation in Construction</source>, vol. <volume>114</volume>, pp. <fpage>103176</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Lau</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Luo</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Automated pavement crack detection and segmentation based on two-step convolutional neural network</article-title>,&#x201D; <source>Computer-Aided Civil and Infrastructure Engineering</source>, vol. <volume>35</volume>, pp. <fpage>1291</fpage>&#x2013;<lpage>1305</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Prokhorov</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Mei</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Feature pyramid and hierarchical boosting network for pavement crack detection</article-title>,&#x201D; <source>IEEE Transactions on Intelligent Transportation Systems</source>, vol. <volume>21</volume>, pp. <fpage>1525</fpage>&#x2013;<lpage>1535</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Eisenbach</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Stricker</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Seichter</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Amende</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Debes</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>How to get pavement distress detection ready for deep learning? a systematic approach</article-title>,&#x201D; in <conf-name>Proc. of the Int. Joint Conf. on Neural Networks</conf-name>, <conf-loc>New York, NY</conf-loc>, <publisher-name>IEEE</publisher-name>, pp. <fpage>2039</fpage>&#x2013;<lpage>2047</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Shi</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Cui</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Qi</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Meng</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Automatic road crack detection using random structured forests</article-title>,&#x201D; <source>IEEE Transactions on Intelligent Transportation Systems</source>, vol. <volume>17</volume>, pp. <fpage>3434</fpage>&#x2013;<lpage>3445</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Amhaz</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Chambon</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Idier</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Baltazart</surname></string-name></person-group>, &#x201C;<article-title>Automatic crack detection on two-dimensional pavement images: An algorithm based on minimal path selection</article-title>,&#x201D; <source>IEEE Transactions on Intelligent Transportation Systems</source>, vol. <volume>17</volume>, pp. <fpage>2718</fpage>&#x2013;<lpage>2729</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Zou</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Mao</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Cracktree: Automatic crack detection from pavement images</article-title>,&#x201D; <source>Pattern Recognition Letters</source>, vol. <volume>33</volume>, pp. <fpage>227</fpage>&#x2013;<lpage>238</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Road extraction by deep residual u-net</article-title>,&#x201D; <source>IEEE Geoscience and Remote Sensing Letters</source>, vol. <volume>15</volume>, pp. <fpage>749</fpage>&#x2013;<lpage>753</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="web"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Simonyan</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Zisserman</surname></string-name></person-group>, &#x201C;<article-title>Very deep convolutional networks for large-scale image recognition</article-title>,&#x201D; <year>2014</year>. [Online]. Available: <uri xlink:href="https://arxiv.org/abs/1409.1556">https://arxiv.org/abs/1409.1556</uri>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>He</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ren</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Deep residual learning for image recognition</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <conf-loc>New York, NY</conf-loc>, <publisher-name>IEEE</publisher-name>, pp. <fpage>770</fpage>&#x2013;<lpage>778</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="web"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Tan</surname></string-name> and <string-name><given-names>Q. V.</given-names> <surname>Le</surname></string-name></person-group>, &#x201C;<article-title>Efficientnet: Rethinking model scaling for convolutional neural networks</article-title>,&#x201D; <year>2019</year>. [Online]. Available: <uri xlink:href="https://arxiv.org/abs/1905.11946">https://arxiv.org/abs/1905.11946</uri>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Van Der Maaten</surname></string-name> and <string-name><given-names>K. Q.</given-names> <surname>Weinberger</surname></string-name></person-group>, &#x201C;<article-title>Densely connected convolutional networks</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <conf-loc>New York, NY</conf-loc>, <publisher-name>IEEE</publisher-name>, pp. <fpage>4700</fpage>&#x2013;<lpage>4708</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="web"><person-group person-group-type="author"><string-name><given-names>D. P.</given-names> <surname>Kingma</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Ba</surname></string-name></person-group>, &#x201C;<article-title>Adam: A method for stochastic optimization</article-title>,&#x201D; <year>2014</year>. [Online]. Available: <uri xlink:href="https://arxiv.org/abs/1412.6980">https://arxiv.org/abs/1412.6980</uri>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Long</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Shelhamer</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Darrell</surname></string-name></person-group>, &#x201C;<article-title>Fully convolutional networks for se-mantic segmentation</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <conf-loc>New York, NY</conf-loc>, <publisher-name>IEEE</publisher-name>, pp. <fpage>3431</fpage>&#x2013;<lpage>3440</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. D.</given-names> <surname>Rodriguez</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Perez</surname></string-name> and <string-name><given-names>J. A.</given-names> <surname>Lozano</surname></string-name></person-group>, &#x201C;<article-title>Sensitivity analysis of k-fold cross validation in prediction error estimation</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>, vol. <volume>32</volume>, pp. <fpage>569</fpage>&#x2013;<lpage>575</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Jafari</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Razvarz</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Gegov</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Vatchova</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for pipeline damage detection: An overview of the concepts and a survey of the state-of-the-art</article-title>,&#x201D; in <conf-name>Proc. of the 2020 IEEE 10th Int. Conf. on Intelligent Systems (IS)</conf-name>, <conf-loc>New York, NY</conf-loc>, <publisher-name>IEEE</publisher-name>, pp. <fpage>178</fpage>&#x2013;<lpage>182</lpage>, <year>2020</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>