用高维位置编码和非局部MLP提升点云处理效率与性能
Efficient Point Cloud Processing with High-Dimensional Positional Encoding and Non-Local MLPs
- 提出分阶段抽象与精炼框架,用非局部MLP替代耗时的局部MLP
- 在多个数据集上实现更高精度,同时减少超40%的计算量
- 模块可插拔,适合追求高效点云模型的研究者与工程师
多层感知机(MLP)是当前点云处理的核心架构,但其复杂结构掩盖了性能来源,限制了应用。本文提出两阶段抽象与精炼(ABS-REF)视角,揭示早期模型侧重抽象阶段,而近期方法通过复杂精炼阶段获得优势。为此,我们设计高维位置编码(HPE)模块,显式利用点云内在位置信息,可无缝集成于MLP及基于Transformer的方法中。在此框架下,我们重新思考局部聚合机制,以高效的非局部MLP替代耗时的局部MLP,结合HPE实现更优的局部特征表达。基于此构建了HPENets系列网络,采用可扩展的HPE精炼阶段。在七个公开数据集、四类任务上的实验表明,HPENets在效率与效果间取得优异平衡:相比PointNeXt,在ScanObjectNN、S3DIS、ScanNet、ShapeNetPart上分别提升1.1% mAcc、4.0% mIoU、1.8% mIoU、0.2% Cls. mIoU,同时仅需50.0%、21.5%、23.1%、44.4%的FLOPs。源码已开源。
原文摘要 · Abstract (English)
Multi-Layer Perceptron (MLP) models are the foundation of contemporary point cloud processing. However, their complex network architectures obscure the source of their strength and limit the application of these models. In this article, we develop a two-stage abstraction and refinement (ABS-REF) view for modular feature extraction in point cloud processing. This view elucidates that whereas the early models focused on ABS stages, the more recent techniques devise sophisticated REF stages to attain performance advantages. Then, we propose a High-dimensional Positional Encoding (HPE) module to explicitly utilize intrinsic positional information, extending the ``positional encoding'' concept from Transformer literature. HPE can be readily deployed in MLP-based architectures and is compatible with transformer-based methods. Within our ABS-REF view, we rethink local aggregation in MLP-based methods and propose replacing time-consuming local MLP operations, which are used to capture local relationships among neighbors. Instead, we use non-local MLPs for efficient non-local information updates, combined with the proposed HPE for effective local information representation. We leverage our modules to develop HPENets, a suite of MLP networks that follow the ABS-REF paradigm, incorporating a scalable HPE-based REF stage. Extensive experiments on seven public datasets across four different tasks show that HPENets deliver a strong balance between efficiency and effectiveness. Notably, HPENet surpasses PointNeXt, a strong MLP-based counterpart, by 1.1% mAcc, 4.0% mIoU, 1.8% mIoU, and 0.2% Cls. mIoU, with only 50.0%, 21.5%, 23.1%, 44.4% of FLOPs on ScanObjectNN, S3DIS, ScanNet, and ShapeNetPart, respectively. Source code is available at https://github.com/zouyanmei/HPENet_v2.git.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。