Weakly-Supervised Crack Detection
Yuki Inoue, Hiroto Nagayoshi

TL;DR
This paper introduces a data-driven annotation refinement method for weakly-supervised crack detection that significantly speeds up annotation while maintaining high detection accuracy across diverse datasets.
Contribution
It proposes a novel annotation refinement approach that leverages local visual features, improving weakly-supervised crack segmentation regardless of brightness distribution.
Findings
Speeds up annotation by factors of 10 to 30.
Maintains comparable detection accuracy across multiple datasets.
Effective for both crack and blood vessel segmentation.
Abstract
Pixel-level crack segmentation is widely studied due to its high impact on building and road inspections. While recent studies have made significant improvements in accuracy, they typically heavily depend on pixel-level crack annotations, which are time-consuming to obtain. In earlier work, we proposed to reduce the annotation cost bottleneck by reformulating the crack segmentation problem as a weakly-supervised problem -- i.e. the annotation process is expedited by sacrificing the annotation quality. The loss in annotation quality was remedied by refining the inference with per-pixel brightness values, which was effective when the pixel brightness distribution between cracks and non-cracks are well separated, but struggled greatly for lighter-colored cracks as well as non-crack targets in which the brightness distribution is less articulated. In this work, we propose an annotation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInfrastructure Maintenance and Monitoring · Asphalt Pavement Performance Evaluation · Concrete Corrosion and Durability
MethodsTest
