A U-Net-like full convolutional pavement crack segmentation network based on multi-layer feature fusion
Bibliographic record
Abstract
Cracks are an important indicator of pavement health, and it is difficult to achieve pixel-level segmentation of small and thin cracks. The existing network often experiences false segmentation and missed segmentation. Accordingly, a novel end-to-end U-Net-like full convolutional crack segmentation network is constructed. First, we propose a multi-layer feature fusion module to aggregate the texture and semantic features at each stage of encoder, so that the network can find smaller and thinner crack. Second, we design a novel residual structure with a pointwise convolution. Each stage of the encoder and decoder incorporates a residual structure to facilitate the fusion of feature maps with different spatial dimensions. It can also prevent the gradient vanish in the network training process. Finally, we utilise the maximum unpooling to restore spatial structure in up-sampling, which exploits the indices of maximum feature value in down-sampling. Therefore, high-frequency information is better preserved to help accurately restore the details of crack edges. To verify the proposed network performance, experiments are carried out on four open datasets, the proposed network can achieve better performance among five classical networks.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".