SFL-NET: Slight Filter Learning Network for Point Cloud Semantic Segmentation

计算机科学 点云 分割 云计算 人工智能 深度学习 滤波器(信号处理) 卷积神经网络 数据挖掘 机器学习 计算机视觉 操作系统
作者
Xu Li,Zhenxin Zhang,Yong Li,Mingmin Huang,Jiaxin Zhang
出处
期刊:IEEE Transactions on Geoscience and Remote Sensing [Institute of Electrical and Electronics Engineers]
卷期号:61: 1-14 被引量:22
标识
DOI:10.1109/tgrs.2023.3313876
摘要

In recent years, point clouds have been widely used in powerline inspection, smart cities, autonomous driving, and other fields. Deep learning-based point cloud processing methods have achieved some impressive results in point cloud semantic segmentation, which has attracted more and more attention. However, there are still some problems that need to be solved, such as the efficiency of point cloud processing, inference speed, the parameter size of network, etc. We mainly study how to remove the redundancy of neural network for large-scale point cloud semantic segmentation. Now that the scale of point cloud dataset has rapidly increased, many recent works adapt to it via expanding the model capacity, which can lead to a sharp decline in the efficiency and speed of processing point cloud. To address the problem, we propose an efficient and lightweight deep neural network, namely Slight Filter Learning Network (SFL-Net), which can effectively extract semantic information and accelerate semantic segmentation for large-scale point clouds. The key to our approach is the proposed Slight Filter Convolution module (SFConv) and the Hourglass Block (HB). SFConv is designed to remove the redundancy of 3D convolution filters. HB can replace all multilayer perceptron (MLPs) in the neural network to expedite point cloud processing. To reduce the information loss during the subspace transformation, we introduce a new correlation loss function to constrain the parameter pairs in HB. On public indoor and outdoor datasets evaluation, SFL-Net performance reaches and even outperforms the state-of-the-art approaches. Moreover, the model parameters of SFL-Net are reduced 10× than the KPConv. The inference time of SFL-Net is only 45.8s for about 100 million points (N~10 8 ).
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
科研通AI6.2应助结实幼枫采纳,获得10
刚刚
XY完成签到,获得积分10
刚刚
刚刚
刚刚
梧桐发布了新的文献求助10
1秒前
Strongly完成签到,获得积分10
1秒前
1秒前
1秒前
2秒前
无花果应助氮源采纳,获得10
2秒前
Bsisoy发布了新的文献求助10
3秒前
情怀应助边缘人采纳,获得10
3秒前
加里完成签到 ,获得积分10
3秒前
yin发布了新的文献求助10
3秒前
wang完成签到 ,获得积分10
3秒前
4秒前
英俊的铭应助张帅要发sci采纳,获得10
4秒前
zjy1234发布了新的文献求助10
4秒前
5秒前
清爽的绮山完成签到,获得积分10
6秒前
LB发布了新的文献求助10
6秒前
曾经的贞发布了新的文献求助10
6秒前
Elaine发布了新的文献求助30
6秒前
yrx发布了新的文献求助10
6秒前
7秒前
8秒前
bkagyin应助xuxu采纳,获得10
9秒前
CH完成签到,获得积分10
9秒前
9秒前
独特芹菜完成签到,获得积分10
9秒前
汉堡包应助study55采纳,获得10
9秒前
jeff完成签到,获得积分10
10秒前
耗尽完成签到,获得积分10
10秒前
10秒前
科研通AI6.4应助LB采纳,获得10
11秒前
12秒前
12秒前
12秒前
13秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Navigating Normative Orders. Interdisciplinary Perspectives 800
A Psychological Understanding of Criticism and Mental Health 600
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7752067
求助须知:如何正确求助?哪些是违规求助? 9299294
关于积分的说明 20251434
捐赠科研通 7334307
什么是DOI,文献DOI怎么找? 3310121
关于科研通互助平台的介绍 2461554
邀请新用户注册赠送积分活动 2322879