Skip to content
naulon
Not checkedNot checked for notices yet.

Automatic Pavement Crack Detection and Classification Using Multiscale Feature Attention Network

Weidong Song, Guohui Jia, Di Jia and 1 more

IEEE Access · 2019

doi:10.1109/access.2019.2956191 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Pavement crack detection and characterization is a fundamental part of road intelligent maintenance systems. Due to the high non-uniformity of cracks, topological complexity, and similar noise from crack texture, the challenge arises in this domain with automated crack detection and classification in a complex environment. In this work, an overarching framework for a universal and robust automatic method that simultaneously characterizes the type of crack and its severity level was developed. For crack detection, we propose a novel and efficient crack detection network that captures the crack context information by establishing a multiscale dilated convolution module. On this foundation, an attention mechanism is introduced to further refine the high-level features. Moreover, the rich features at different levels are fused in an upsampling module to generate more detailed crack detection results. For crack classification, a novel characterization algorithm is developed to classify the type of crack after detection. The crack segment branches are then merged and classified into four types: transversal, longitudinal, block, and alligator; the severity levels of cracks are assessed by calculating the average width and distance between the crack branches. The proposed crack detection method effectively detects crack information in a complex environment, and achieves the current state-of-the-art accuracy. Compared to manual classification results, the classification accuracy of transversal and longitudinal cracks is higher than 95%, and the classification accuracy of block and alligator is above 86%.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.