OUR-Net: A Multi-Frequency Network With Octave Max Unpooling and Octave Convolution Residual Block for Pavement Crack Segmentation

倍频程(电子) 卷积(计算机科学) 残余物 块(置换群论) 计算机科学 声学 数学 算法 人工智能 物理 几何学 人工神经网络
作者
Pengtao Li,Meihua Wang,Zhun Fan,Han Huang,Guijie Zhu,Jiafan Zhuang
出处
期刊:IEEE Transactions on Intelligent Transportation Systems [Institute of Electrical and Electronics Engineers]
卷期号:25 (10): 13833-13848 被引量:29
标识
DOI:10.1109/tits.2024.3405995
摘要

Cracks are among the most common, most likely, and earliest of all pavement distresses. Detecting and repairing cracks as early as possible can help extend the service life of pavements. However, Detecting cracks with precision can be challenging due to their varied structural characteristics and complex background interference. In this paper, a new convolutional neural network architecture, OUR-Net, is designed to more efficiently treat both high-and low-frequency visual image features. An Ocatve Convolution is incorporated into the proposed network as an enhancement to conventional convolution. In particular, an Octave Convolution Residual Block (OCRB) is embedded in the encoder to replace the convolutional layer of the classical encoder. Moerover, we propose Octave Max Unpooling (OMU) as the upsampling operation of the decoder, enabling the neural network to learn how to decode multi-spatial frequency features. Compared with models using traditional convolution, OUR-Net has better capability of processing multi-scale information, thus simultaneously improving model performance while saving computational costs by reducing spatial redundancy. We evaluate the superiority of the proposed method by comparing it to state-of-the-art crack segmentation methods on four public datasets (CrackLS315, CFD, Crack200, DeepCrack), which encompass cracks of various widths. Comprehensive experimental results reveal that the proposed method performs excellently, which achieves F1-score and mIoU of 0.9112, 0.9271, 0.8106, 0.9318, and 0.8369, 0.8644, 0.6815, 0.8723, respectively, on the four datasets. A lightweight version of the proposed network is constructed using depthwise separable convolution that achieves excellent performance with only 0.88M parameters.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
丸子吖发布了新的文献求助10
刚刚
刚刚
共享精神的应助被咕咕采纳,获得10
刚刚
小小发布了新的文献求助10
1秒前
1秒前
1秒前
学术雷锋发布了新的文献求助20
2秒前
2秒前
秋风的应助被希忘采纳,获得10
3秒前
秋风的应助被希忘采纳,获得10
3秒前
yyy完成签到 ,获得积分10
3秒前
TTYF发布了新的文献求助10
3秒前
大爱发布了新的文献求助10
3秒前
自然雅寒发布了新的文献求助10
3秒前
4秒前
赘婿的应助被听风采纳,获得10
4秒前
上官若男的应助被布丁采纳,获得10
4秒前
呆萌斩发布了新的文献求助10
4秒前
p1发布了新的文献求助10
4秒前
雪白语海发布了新的文献求助10
4秒前
honda完成签到,获得积分10
4秒前
ImMedicalSuo的应助被风中安筠采纳,获得30
5秒前
英姑的应助被发10篇SCI采纳,获得10
5秒前
xy完成签到,获得积分10
6秒前
酷酷的炎彬完成签到,获得积分10
6秒前
豆包不当干粮完成签到,获得积分10
7秒前
7秒前
9秒前
华仔的应助被丸子吖采纳,获得10
9秒前
小马甲的应助被p1采纳,获得10
9秒前
9秒前
Winky发布了新的文献求助10
9秒前
030发布了新的文献求助30
10秒前
无花果的应助被咎如天采纳,获得10
11秒前
11秒前
l_qw完成签到,获得积分10
11秒前
科研通AI6.2的应助被小小采纳,获得10
11秒前
salary发布了新的文献求助10
12秒前
12秒前
zty发布了新的文献求助30
13秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Das Matthäusevangelium: Kapitel 1:1–17 1000
Les Mots du discours 600
OREDA手册2009年第5版 500
A Consideration on Use of Material Grades for Hull Structural Members Based on Fracture Toughness(Second Report) 500
AI Disclosure in Annual Reports: Evolution, Determinants, and Capital Market Participants’ Perceptions 500
5th World Conference on Detergents: Reinventing the Industry : Opportunities and Challenges 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8112940
求助须知:如何正确求助?哪些是违规求助? 9519702
关于积分的说明 21525724
捐赠科研通 7690856
什么是DOI,文献DOI怎么找? 3412685
关于科研通互助平台的介绍 2539213
邀请新用户注册赠送积分活动 2452570