大气与环境光学学报 ›› 2026, Vol. 21 ›› Issue (4): 695-708.doi: 10.3969/j.issn.1673-6141.2026.04.013

• 光学遥感 • 上一篇    

融合局部特征提取与互补注意力的点云分类网络

张凌宸 1, 迟荣华 2, 李红旭 2*   

  1. 1 南京信息工程大学电子与信息工程学院, 江苏 南京 210044; 2 无锡学院江苏省通感融合光子器件及系统集成工程研究中心, 江苏 无锡 214105
  • 收稿日期:2024-10-15 修回日期:2024-12-13 接受日期:2024-12-16 出版日期:2026-07-28 发布日期:2026-07-28
  • 通讯作者: hongxuli@cwxu.edu.cn E-mail:hongxuli@cwxu.edu.cn
  • 作者简介:张凌宸 (2001- ), 江苏江阴人, 硕士研究生, 主要从事智能信号处理方面的研究。Email: zlc350114564@163.com
  • 基金资助:
    江苏省基础研究计划重点项目 (BK20243021), 江苏省产学研合作项目 (BY20230745), 江苏省高等学校基础科学研究面上项目 (22KJB510043), 无锡学院引进人才科研启动专项经费 (550222001, 550221028, 2023r012)

Point cloud classification network with local feature extraction and complementary attention

ZHANG Lingchen1, CHI Ronghua2, LI Hongxu2*   

  1. 1 School of Electronics and Information Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China; 2 Jiangsu Province Engineering Research Center of Photonic Devices and System Integration for Communication Sensing Convergence, Wuxi University, Wuxi 214105, China
  • Received:2024-10-15 Revised:2024-12-13 Accepted:2024-12-16 Online:2026-07-28 Published:2026-07-28
  • Contact: Hong-Xu LI E-mail:hongxuli@cwxu.edu.cn

摘要: 近年来, 随着三维传感技术的快速发展, 点云数据在环境光学遥感、自动驾驶等领域的应用日益广泛。然 而, 点云数据的无序性、稀疏性及现有方法对特征重要性差异的考虑不足, 导致其特征表示能力受限, 同时如何在低 复杂度下保持几何结构信息仍存在挑战。为解决这些问题, 本文提出了一种融合局部特征提取模块 (LFEM) 与锐-缓 互补注意力模块 (SGCAM) 的点云分类网络, 并配合投票分类机制增强模型的鲁棒性和分类精度。该分类网络通过协 同作用, 有效提取点云数据的全局与局部特征, 捕获不同通道的特征重要性, 并减少冗余信息, 同时充分保留几何结 构特征。在ModelNet10 和ModelNet40 两个数据集上的实验表明, 该方法在分类精度、鲁棒性和模型复杂度方面都具 有优异的表现。在ModelNet10 数据集上的分类精度达96.1%, 在ModelNet40 数据集上为93.0%。本方法为三维点云 分类任务提供了高效且精准的解决方案, 具有广阔的应用前景。

关键词: 激光雷达, 点云分类, 局部特征提取, 互补注意力

Abstract: Objective With the rapid advancement of 3D sensing technologies, point cloud data have been widely used in applications such as remote sensing, autonomous driving, and robotic navigation. Unlike 2D images, point clouds preserve precise geometric structures, offering unique advantages for representing complex scenes. However, their inherent unorderedness, sparsity, and non-uniform density pose significant challenges to feature extraction and classification. Although deep learning has made progress, existing methods still suffer from several critical limitations: inadequate capture of local feature, neglect of the importance of inter-channel features, difficulty in balancing geometric detail preservation and computational efficiency, and high complexity that limits their deployment on resource-constrained devices. To address these issues, this paper proposes a novel point cloud classification network that integrates local feature extraction with a complementary attention mechanism, aiming to achieve high accuracy, strong robustness, and low model complexity simultaneously. Methods The proposed network is built upon two core modules: Local Feature Extraction Module (LFEM) and Sharp- Gentle Complementary Attention Module (SGCAM), as well as a voting-based classification mechanism, all of which work synergistically to extract discriminative features from raw point clouds. LFEM first applies the K-nearest neighbor algorithm to aggregate neighborhood features for each point, forming local patches that encode relative spatial relationships. Then, it introduces an Efficient Channel Attention mechanism that uses fast one-dimensional convolution to capture local crosschannel interactions without dimensionality reduction, thereby adaptively assigning weights along the channel dimension. This design enhances local structure representation while maintaining a lightweight architecture suitable for real-time applications. SGCAM, based on graph signal processing theory, constructs an adjacency matrix based on point cloud geometry and decomposes point cloud features into two complementary components: the sharp-variation (high-frequency) components corresponding to edges, corners, and rapid geometric changes, and the gentle-variation (low-frequency) components corresponding to smooth surfaces and gradual transitions. Individual attention weights for each component are computed using learnable nonlinear mappings implemented by multi-layer perceptrons, and then these weighted components are fused with the original point cloud features. This decomposition and reweighting strategy effectively reduces data redundancy, enhances the representation of critical geometric details, and captures complementary semantic information often missed by conventional attention mechanisms. The voting mechanism adopts a soft voting strategy under multiple random perturbations, including random scaling, translation, rotation, and additive noise, to average the output probability distributions of different perturbed versions of the same input, so as to improve classification stability and robustness, while reducing the impact of single prediction errors. Results and Discussion Extensive experiments were conducted on two benchmark datasets: ModelNet10 (10 categories, 4, 899 models) and ModelNet40 (40 categories, 12, 311 models). The proposed method achieves overall classification accuracies of 96.1% on ModelNet10 and 93.0% on ModelNet40, outperforming mainstream models such as PointNet, PointNet++ , DGCNN, PointCNN, KPConv, and even the latest GateNet on ModelNet10. It is worth noting that although GateNet achieves a slightly higher accuracy (93.3%) on ModelNet40, its model complexity is significantly higher. Compared to GateNet, our method is more suitable for resource-constrained scenarios. Robustness tests demonstrate that when the number of input points is reduced from 1024 to 256, the classification accuracy of our method only drops by 1.6% (from 93.0% to 91.4%), while comparative methods such as Point-TnT and DGCNN decline by 5.9% and 45.8% respectively under the same conditions, indicating that our method has strong resistance to sparsity and noise. Model complexity analysis reveals that the proposed network only has 0.94 million (M) parameters and 20.30 GFLOPs of floating-point operations, achieving an excellent trade-off between accuracy and computational cost compared to DGCNN (1.81M parameters) and Point-TnT (3.94M parameters). The training time of our method on ModelNet40 is only 11 hours, which is notably shorter than that of PointNet++ (20 hours), PointCNN (15 hours), and DGCNN (25 hours), demonstrating efficient convergence and fast training of our method. Ablation studies confirm that LFEM, SGCAM, and the voting mechanism all contribute significantly to overall performance, and their synergistic integration forms an efficient system for feature extraction and decision optimization. Specifically, removing LFEM reduces accuracy by 1.5%, removing SGCAM reduces accuracy by 2.0%, and removing the voting mechanism reduces accuracy by 0.4%. Conclusion The network proposed in this work effectively addresses key limitations of existing methods, including inadequate local feature capture, neglect of inter-channel importance, difficulty in preserving geometric structures, and high complexity. Through the synergistic integration of Local Feature Extraction Module (LFEM), Sharp-Gentle Complementary Attention Module (SGCAM), and soft voting, the method achieves a favorable balance between accuracy, robustness, and complexity. Experimental results on ModelNet10 and ModelNet40 demonstrate its superiority over many existing approaches. This work provides an efficient and accurate solution for 3D point cloud classification, with broad applications in autonomous driving, remote sensing, and robotic perception. Future work will explore more efficient modules, learning strategies, and model compression techniques, including knowledge distillation, pruning, and quantization, to reduce deployment requirements on edge devices.

Key words: laser radar, point cloud classification, local feature extraction, complementary attention 708

中图分类号: