首页|结合通道剪枝和通道注意力的轻量型车辆点云补全网络

结合通道剪枝和通道注意力的轻量型车辆点云补全网络

扫码查看
针对现有的点云补全网络多关注于补全的精度而忽视补全效率问题,提出了一种轻量型点云补全网络来准确、高效地修复自动驾驶中的不完整车辆点云。为了提高网络推理效率,采用一种高效的一次性通道剪枝技术提高网络的补全效率;在特征提取阶段,网络加入通道注意力模块,将加权特征与全局特征拼接,通过两层多维特征信息提取,得到最终的特征向量;将特征向量传入双解码器结构中,分别通过全连接层和多层感知机生成稠密的粗糙点云和输入点云偏差值;将粗糙点云与输入点云偏差值相加得到最终的精细化完整点云。在PCN数据集和KITTI数据集上进行实验,实验结果表明在补全缺失车辆信息的实时性上有着显著的提升,并且在补全精度上也有不错的表现。
Lightweight Vehicle Point Cloud Completion Network Combined with Channel Pruning and Channel Attention
A lightweight point cloud completion network is proposed to accurately and efficiently repair incomplete vehicle point clouds in autonomous driving scenarios,addressing the efficiency issue often overlooked by existing point cloud completion networks that primarily focus on accuracy.Firstly,to enhance inference efficiency,an efficient one-shot channel pruning technique is employed to improve the completion speed of the network.Secondly,a channel attention module is integrated into the network during the feature extraction phase,which combines weighted features with global features.This dual-layered multidimensional feature extraction yields the final feature vector.Subsequently,the feature vector is fed into a dual decoder structure,generating dense coarse point clouds and input point cloud deviation values through fully connected layers and multi-layer perceptron,respectively.Finally,by adding the coarse point cloud and input point cloud deviation values,a refined and complete point cloud is obtained.Experimental evaluations conducted on the PCN dataset and KITTI dataset demonstrate significant improvements in real-time completion of missing vehicle information.Moreover,favorable results are achieved in terms of completion accuracy as well.

point cloud completionchannel pruningchannel attentionlightweightdeep learning

杨晓文、冯泊栋、韩慧妍、况立群、韩燮、何黎刚

展开 >

中北大学 计算机科学与技术学院,太原 030051

机器视觉与虚拟现实山西省重点实验室,太原 030051

山西省视觉信息处理及智能机器人工程研究中心,太原 030051

华威大学计算机科学系,英国考文垂CV4 7AL

展开 >

点云补全 通道剪枝 通道注意力 轻量型 深度学习

2025

计算机工程与应用
华北计算技术研究所

计算机工程与应用

北大核心
影响因子:0.683
ISSN:1002-8331
年,卷(期):2025.61(1)