.png){kind=icon}
.png){kind=icon}
Return
Efficient data dimensionality reduction method for improving road crack classification algorithms
.png){kind=icon}
OA
AI
DOI：10.1111/mice.13014.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Automatic crack classification plays an essential role in road maintenance. Using many features for the classification is inefficient for implementing embedded systems with low computational resources makes it difficult. Therefore, this work proposes a new data dimensionality reduction (DDR) for crack classification algorithms (DDR4CC). DDR4CC reduces the required information about the cracks to only four features. Using these features, the images can be classified into longitudinal, transverse, and alligator cracks or healthy pavement. DDR4CC is compared with eight DDR methods, and the reduced set of features is analyzed using five different classification algorithms. Besides, five different datasets, generated by a combination of several public datasets, are used. We are proposing a simple DDR method with high interpretability of the data, obtaining very fast computation and high accuracy. Experiments show that DDR4CC enhances the results of the classification algorithms, providing almost perfect classifiers with a minimum computation time.
Keywords:
NEURAL DYNAMIC CLASSIFICATION
NETWORK
MODEL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
9.1
Papers:
2.0K
Citations:
10.0K