Generative adversarial network based on domain adaptation for crack segmentation in shadow environments

Precision segmentation of cracks is important in industrial non-destructive testing, but the presence of shadows in the actual environment can interfere with the segmentation results of cracks. To solve this problem, this study proposes a two-stage domain adaptation framework called GAN-DANet for crack segmentation in shadowed environments. In the first stage, CrackGAN uses adversarial learning to merge features from shadow-free and shadowed datasets, creating a new dataset with more domain-invariant features. In the second stage, the CrackSeg network innovatively integrates enhanced Laplacian filtering (ELF) into high-resolution net to enhance crack edges and texture features while filtering out shadow information. In this model, CrackGAN addresses domain shift by generating a new dataset with domain-invariant features, avoiding direct feature alignment between source and target domains. The ELF module in CrackSeg effectively enhances crack features and suppresses shadow interference, improving the segmentation model's robustness in shadowed environments. Experiments show that GAN-DANet improves the crack segmentation accuracy, with the mean intersection over union value increasing from 57.87 to 75.03, which surpasses the performance of existing state-of-the-art domain adaptation algorithms.

Authors

Institutions

Publication Details

Journal
Computer-Aided Civil and Infrastructure Engineering
Published
2025-03-05
DOI
https://doi.org/10.1111/mice.13451
Citations
9
Primary Topic
Infrastructure Maintenance and Monitoring
Type
article
Field-Weighted Citation Impact
8.58
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generative adversarial network based on domain adaptation for crack segmentation in shadow environments

Cheng Liu, Yingchao Zhang
9 citations
Computer-Aided Civil and Infrastructure Engineering
Infrastructure Maintenance and Monitoring
8.58
article

Generative adversarial network based on domain adaptation for crack segmentation in shadow environments

Cheng Liu, Yingchao Zhang
article en
9 citations

Abstract

Precision segmentation of cracks is important in industrial non-destructive testing, but the presence of shadows in the actual environment can interfere with the segmentation results of cracks. To solve this problem, this study proposes a two-stage domain adaptation framework called GAN-DANet for crack segmentation in shadowed environments. In the first stage, CrackGAN uses adversarial learning to merge features from shadow-free and shadowed datasets, creating a new dataset with more domain-invariant features. In the second stage, the CrackSeg network innovatively integrates enhanced Laplacian filtering (ELF) into high-resolution net to enhance crack edges and texture features while filtering out shadow information. In this model, CrackGAN addresses domain shift by generating a new dataset with domain-invariant features, avoiding direct feature alignment between source and target domains. The ELF module in CrackSeg effectively enhances crack features and suppresses shadow interference, improving the segmentation model's robustness in shadowed environments. Experiments show that GAN-DANet improves the crack segmentation accuracy, with the mean intersection over union value increasing from 57.87 to 75.03, which surpasses the performance of existing state-of-the-art domain adaptation algorithms.

Computer-Aided Civil and Infrastructure EngineeringVol. 40(24)
City University of Hong Kong (HK)
Openalex Percentile: Top 2%
Infrastructure Maintenance and Monitoring
8.58
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.