mlsanityData to 14 Oct 2026

An Iteratively Optimized Patch Label Inference Network for Automatic Pavement Distress Detection

arXiv 2005.13298 ↗First posted 27 May 2020cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

We present a novel deep learning framework named the Iteratively Optimized Patch Label Inference Network (IOPLIN) for automatically detecting various pavement distresses that are not solely limited to specific ones, such as cracks and potholes. IOPLIN can be iteratively trained with only the image label via the Expectation-Maximization Inspired Patch Label Distillation (EMIPLD) strategy, and accomplish this task well by inferring the labels of patches from the pavement images. IOPLIN enjoys many desirable properties over the state-of-the-art single branch CNN models such as GoogLeNet and EfficientNet. It is able to handle images in different resolutions, and sufficiently utilize image information particularly for the high-resolution ones, since IOPLIN extracts the visual features from unrevised image patches instead of the resized entire image. Moreover, it can roughly localize the pavement distress without using any prior localization information in the training phase. In order to better evaluate the effectiveness of our method in practice, we construct a large-scale Bituminous Pavement Disease Detection dataset named CQU-BPDD consisting of 60,059 high-resolution pavement images, which are acquired from different areas at different times. Extensive results on this dataset demonstrate the superiority of IOPLIN over the state-of-the-art image classification approaches in automatic pavement distress detection. The source codes of IOPLIN are released on urlhttps://github.com/DearCaat/ioplin, and the CQU-BPDD dataset is able to be accessed on urlhttps://dearcaat.github.io/CQU-BPDD/.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 May 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 1; 2025: 3.

7 papers.