Skip to Content
SensorsSensors
  • Article
  • Open Access

16 July 2026

GeoSeqNet: A Geometry-Aware Sequential Network for Robust 3D Point Cloud Analysis

,
,
,
and
1
School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
2
Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, Shenzhen 518110, China
*
Author to whom correspondence should be addressed.
This article belongs to the Section Intelligent Sensors

Abstract

3D point cloud understanding plays a vital role in remote sensing, robotic perception and intelligent scene analysis. However, real-world point cloud data are often affected by sensing noise, incomplete geometry, occlusion, and irregular sampling, posing significant challenges to reliable geometric representation learning and long-range contextual modeling. Existing methods typically rely on fixed neighborhood aggregation or computationally expensive global interaction mechanisms, leaving considerable room for improvement in terms of robustness and efficiency under complex sensing conditions. To address these challenges, we propose GeoSeqNet, a geometry-aware contextual learning framework for robust 3D point cloud analysis. Specifically, an Enhanced Local Operator (ELO) is introduced to strengthen local geometric representation, while a Geometric Encoding Module (GEM) is employed to preserve spatial geometric information during long-range feature interactions. In addition, an Adaptive Gate Fusion (AGF) module is designed to effectively integrate Gate-Scaled LSTM and GRU branches, enabling efficient long-range contextual modeling. By jointly exploiting local geometric cues and long-range contextual information, GeoSeqNet achieves robust feature learning with low computational overhead. Extensive experiments on ModelNet40, ScanObjectNN, and ShapeNetPart demonstrate the effectiveness of GeoSeqNet. The proposed method achieves competitive performance while maintaining a favorable efficiency–accuracy trade-off and exhibits strong robustness in complex real-world scenarios. These results indicate that GeoSeqNet provides an effective and reliable solution for point cloud understanding in challenging sensing environments.

1. Introduction

3D point cloud analysis is a fundamental problem in computer vision and robotics, with broad applications in remote sensing, autonomous driving, robotic perception, augmented reality, and industrial inspection [1,2,3,4]. Unlike images and videos defined on regular grids, point clouds consist of irregular and unordered 3D samples that directly preserve geometric and spatial structures of real-world environments. Such characteristics provide rich spatial representation capability while also making robust point cloud understanding highly challenging under complex sensing conditions.
In real-world scenarios, point cloud data are often affected by noise, occlusion, incomplete geometry, and irregular sampling. Therefore, an effective point cloud model should not only capture fine-grained local geometric structures but also establish robust contextual relationships across spatially distant regions. Early point cloud learning methods, represented by PointNet [5] and its variants [6,7], treat point clouds as unordered sets and achieve permutation invariance through symmetric aggregation functions. Although these methods demonstrate effectiveness in global representation learning, their capability for local geometric modeling remains limited. To alleviate this issue, PointNet++ [6] and subsequent approaches introduced hierarchical sampling and neighborhood grouping mechanisms to improve local structure learning [8,9,10,11]. More recently, graph-based interaction methods and geometry-aware convolution operators further enhanced local geometric representation through dynamic graph construction and adaptive neighborhood aggregation.
Despite notable progress in local geometric modeling, most existing approaches still mainly rely on local neighborhood aggregation and short-range feature interaction. As a result, establishing robust long-range contextual relationships under complex geometric environments remains challenging. To address this issue, Transformer-based architectures [12,13,14,15] have recently attracted considerable attention in point cloud analysis. By introducing self-attention mechanisms, these methods can explicitly capture global dependencies among point features. However, self-attention operations usually incur quadratic computational and memory complexity with respect to the number of points, limiting their efficiency in large-scale point cloud analysis. In addition, similarity-based attention mechanisms often exhibit limited robustness under noisy observations, incomplete geometry, and irregular sampling conditions [16]. Sequential modeling provides an alternative paradigm for long-range dependency learning by propagating contextual information along ordered feature representations, offering lower computational complexity than self-attention-based approaches.
Although existing methods have introduced geometric information into local operators, attention mechanisms, or sequence construction strategies, how to consistently preserve and coordinate explicit spatial geometric context during efficient long-range feature interaction remains insufficiently explored. In real-world point clouds, spatial geometric information may gradually weaken as feature interaction becomes increasingly dominated by abstract semantic representations. Preserving geometric sensitivity during contextual learning is therefore important for robust point cloud understanding under complex sensing environments.
Meanwhile, although point clouds are inherently unordered, sequential modeling has recently emerged as an efficient alternative for long-range contextual learning. Instead of explicitly modeling all pairwise feature interactions, sequential modeling establishes contextual dependencies through progressive information propagation, thereby significantly reducing computational overhead. Such a property is particularly attractive for large-scale point cloud analysis, where efficient long-range contextual interaction is required under limited computational budgets. Motivated by these observations, we propose GeoSeqNet, a geometry-aware contextual learning framework for robust 3D point cloud analysis. Unlike existing hybrid frameworks that mainly combine local feature extraction with global attention-, sequential-, or SSM-based modeling, GeoSeqNet constructs geometry-enhanced representations and preserves explicit spatial geometric cues during lightweight sequential contextual interaction. Specifically, the proposed framework tightly integrates local geometric feature refinement, spatial geometric context supplementation, and efficient contextual interaction within a unified architecture.
At the local level, an Enhanced Local Operator (ELO) is introduced to refine neighborhood feature responses through selective local weighting, thereby suppressing redundant local interference and improving robustness under noisy and irregular point cloud conditions. To further preserve spatial geometric context during long-range feature interaction, a lightweight Geometric Encoding Module (GEM) is proposed to supplement geometric information during contextual learning. Different from existing geometry-aware methods that mainly incorporate geometric information during local feature extraction or attention weighting, the proposed GEM reintroduces spatial geometric context during long-range feature interaction. Furthermore, an Adaptive Gate Fusion (AGF) module collaboratively integrates Gate-Scaled LSTM (GSLSTM) and GRU branches to achieve efficient long-range contextual learning with relatively low computational overhead.
We conduct extensive evaluations on several mainstream benchmarks, including ModelNet40, ScanObjectNN, and ShapeNetPart. Experimental results demonstrate that GeoSeqNet achieves competitive performance while maintaining favorable efficiency–accuracy trade-offs on both classification and part segmentation tasks. Notably, GeoSeqNet achieves an overall accuracy (OA) of 88.8% on the challenging ScanObjectNN benchmark, demonstrating strong robustness under noisy observations, incomplete geometry, and irregular sampling conditions.
The main contributions of this work are summarized as follows:
1.
We propose GeoSeqNet, a unified geometry-aware contextual learning framework for robust 3D point cloud analysis, which integrates local geometric refinement, spatial context supplementation, and efficient long-range contextual propagation within a progressive information flow.
2.
We design an Enhanced Local Operator (ELO) and a lightweight Geometric Encoding Module (GEM) to improve local feature robustness and preserve explicit spatial geometric context during long-range feature interaction.
3.
We develop an Adaptive Gate Fusion module that collaboratively integrates Gate-Scaled LSTM and GRU branches for efficient long-range contextual learning, enabling favorable efficiency–accuracy trade-offs on multiple point cloud benchmarks.

3. Proposed Method

3.1. Overview of GeoSeqNet

The overall architecture of GeoSeqNet is illustrated in Figure 1. GeoSeqNet is a geometry-aware contextual learning framework designed for robust and efficient point cloud analysis under complex sensing environments. The proposed framework organizes local geometric refinement, explicit spatial context supplementation, and long-range contextual propagation into a progressive information flow. It mainly consists of three components: Enhanced Local Operator (ELO), Geometric Encoding Module (GEM), and Adaptive Gate Fusion (AGF). Specifically, ELO refines unreliable neighborhood responses through selective local weighting, thereby improving the robustness of local geometric representation under noisy and irregular point cloud conditions. GEM further supplements coordinate-aware geometric context before long-range feature interaction, which helps preserve the spatial structure of point clouds during contextual modeling. AGF performs efficient contextual interaction through collaborative fusion between Gate-Scaled LSTM and GRU branches, enabling complementary dependency modeling with relatively low computational overhead. Through this coordinated design, GeoSeqNet captures both fine-grained local geometric structures and cross-region contextual dependencies. The learned representations are finally aggregated for downstream tasks such as classification and part segmentation.
Figure 1. Overall architecture of GeoSeqNet. The framework consists of three key components: Enhanced Local Aggregation for local feature extraction, Geometric Encoding for explicit spatial prior injection, and Adaptive Gate Fusion module for joint long- and short-range dependency learning. The learned features are used for both classification and part segmentation.

3.2. Enhanced Local Operator

In practical sensing environments, local neighborhoods may be affected by noisy observations, incomplete geometry, and irregular sampling patterns. As a result, direct neighborhood aggregation may introduce unstable local responses and reduce the robustness of local geometric representations. To address this issue, we propose an ELO, which refines neighborhood responses before local aggregation through a lightweight spatial weighting mechanism.
Unlike attention-based neighborhood aggregation methods that explicitly model pairwise relations among neighboring points, ELO performs reliability-aware neighborhood response refinement before local pooling. Existing attention pooling mechanisms, such as those used in Point Transformer [24], or edge-attention variants related to DGCNN-style neighborhood modelingcite [20], usually assign aggregation weights according to point-to-point relations or edge feature correlations. In contrast, ELO does not formulate neighborhood aggregation as a pairwise attention process. Instead, after local feature transformation, a lightweight spatial weighting branch generates response-level modulation weights for different neighboring positions, which are then applied to neighborhood features before max pooling. In this way, ELO can selectively weaken unstable neighborhood responses while preserving discriminative local geometric cues, thereby providing a simple and effective feature refinement mechanism for irregular and noisy local regions.
Given an input point cloud
P = p i i = 1 N p , p i R 3 ,
hierarchical sampling and neighborhood grouping are first performed to construct local regions around sampled centers. The grouped local feature tensor is represented as
X R B × G × S × C ,
where B denotes the batch size, G denotes the number of sampled local regions, S represents the number of neighboring points in each local region, and C denotes the input feature dimension.
Consistent with the implementation, the grouped tensor is first permuted into
X ¯ R B × C × G × S .
Then, two shared 1 × 1 convolution layers are used for local feature transformation:
F = ϕ 2 ( ϕ 1 ( X ¯ ) ) ,
where ϕ 1 and ϕ 2 denote feature transformation blocks consisting of 1 × 1 convolution, Batch Normalization, and LeakyReLU activation. The transformed local feature representation is given by
F R B × C × G × S ,
where C denotes the output feature dimension.
To adaptively refine neighborhood responses, a lightweight spatial weighting branch is introduced:
W = σ ( Conv 1 × 1 ( F ) ) ,
where
W R B × 1 × G × S ,
and σ ( · ) denotes the sigmoid activation function. The weighted neighborhood responses are computed as
F ˜ = F W ,
where ⊙ denotes element-wise multiplication, and W is broadcast along the channel dimension. This operation is consistent with the implementation, where the learned spatial weights are applied to the transformed neighborhood features before aggregation.
Max pooling is then performed along the neighborhood dimension:
H b , c , g = max 1 s S F ˜ b , c , g , s ,
where H R B × C × G . Here, b, c, g, and s index the batch, channel, local region, and neighboring point dimensions, respectively. Finally, the local feature representation is rearranged as H R B × G × C .
The spatial weighting mechanism is intended to refine unstable neighborhood responses caused by uneven sampling, noise, outliers, or incomplete local structures. In these cases, direct max pooling may retain strong but less reliable responses, thereby affecting the stability of local feature aggregation. By introducing learnable weights before pooling, ELO adaptively adjusts the contributions of different neighboring positions and reduces the influence of unreliable responses. This response refinement process helps provide more stable local geometric representations for subsequent contextual modeling.

3.3. Geometric Encoding Module

Although local aggregation effectively captures neighborhood geometric structures, spatial geometric context may gradually weaken as features are progressively abstracted and propagated through long-range contextual interactions. Preserving geometry-awareness during contextual learning is therefore critical for robust point cloud understanding under complex sensing environments. Existing positional encoding strategies are typically introduced at the feature initialization stage to provide spatial cues for subsequent feature interaction. In contrast, the proposed Geometric Encoding Module (GEM) is not intended to encode positional information for initialization. Instead, GEM explicitly reintroduces coordinate-aware geometric context during the contextual learning stage, enabling geometric information to be continuously preserved throughout long-range feature propagation.
Let Q R B × M × 3 denote the coordinates of sampled centers, and H R B × M × C denote the locally refined features generated by ELO. A lightweight coordinate encoder composed of two linear layers is employed:
G = ψ 2 ( ψ 1 ( Q ) ) ,
where ψ 1 and ψ 2 denote transformation blocks consisting of Linear, LayerNorm, and LeakyReLU operations. The resulting geometric representation is
G R B × M × C g .
The geometric representation is fused with local features through channel-wise concatenation:
H ^ = Concat ( H , G ) ,
yielding
H ^ R B × M × ( C + C g ) .
Unlike conventional positional encoding methods that mainly provide spatial awareness during feature initialization, GEM continuously injects coordinate-aware geometric context into the contextual learning process. This design alleviates the progressive loss of geometric information during feature abstraction and long-range propagation, thereby improving robustness under noisy observations, incomplete geometry, and irregular sampling conditions. It should be noted that GEM serves as a geometry context preservation mechanism rather than a conventional positional encoding strategy. While positional encoding primarily facilitates spatially aware feature initialization, GEM focuses on maintaining geometric consistency during long-range contextual interaction.

3.4. Adaptive Gate Fusion Module

Given the geometry-enhanced token representation produced by GEM,
H ^ = { h ^ k } k = 1 M , h ^ k R D s ,
where M denotes the number of sampled local regions and h ^ k represents the geometry-enhanced feature of the k-th local region. The token dimension is defined as
D s = C + C g .
where C denotes the channel dimension of the local feature representation, and C g denotes the channel dimension of the coordinate-aware geometric encoding feature generated by GEM. Each token corresponds to a geometry-enhanced local region obtained through hierarchical sampling, neighborhood aggregation, and geometric encoding, and the resulting token sequence serves as the input to the subsequent sequential contextual learning module. Therefore, the sequence used in GeoSeqNet is not constructed from arbitrary permutations of raw points, but from structured local region representations with explicit geometric context. Based on these geometry-enhanced tokens, we further design an Adaptive Gate Fusion (AGF) module to model long-range dependencies across local regions in the point cloud sequence. Instead of relying on self-attention to explicitly construct global pairwise interactions, AGF performs sequential dependency learning through progressive contextual propagation and adaptive multi-source fusion. Its overall architecture consists of three components: a Gate-Scaled LSTM branch for long-range context accumulation, a GRU branch for complementary compact contextual transition modeling, and a lightweight gating network for adaptive fusion of multiple information streams.
The motivation behind using both Gate-Scaled LSTM and GRU branches is to exploit their complementary modeling characteristics rather than simply increasing the model capacity. The Gate-Scaled LSTM branch introduces an explicit memory cell and a gate-scaled state updating mechanism, making it more suitable for preserving long-range contextual dependencies and stable global geometric trends across distant local regions. Therefore, this branch mainly contributes to long-range context accumulation during sequential feature propagation. In contrast, the GRU branch adopts a more compact gated structure with update and reset gates, which can efficiently capture local feature variations between neighboring region tokens while filtering redundant sequential information. Therefore, the GRU branch mainly contributes to lightweight local feature variation modeling. By adaptively integrating these two branches with the current input token, AGF combines long-range context preservation, local feature variation modeling, and direct geometric information retention within a unified sequential interaction module. This complementary design is also consistent with the ablation results, where the complete AGF module achieves better performance than using a single branch alone.

3.4.1. Gate-Scaled LSTM Branch

To enhance the flexibility of context accumulation during sequential propagation, we first introduce a Gate-Scaled LSTM branch. The network structure of the Gate-Scaled LSTM branch is illustrated by the red dashed box in Figure 1. For the k-th position in the point cloud sequence, given the current input token h ^ k and the hidden and cell states propagated from the previous sequence position ( h k 1 L , c k 1 L ) , the combined representation is formulated as
u k = [ h ^ k ; h k 1 L ] ,
where [ · ; · ] denotes channel-wise concatenation. Based on u k , the input and forget gates are computed as
i k = σ ( W i u k ) γ , f k = σ ( W f u k ) γ ,
where W i and W f are learnable linear transformations, γ R D L is a learnable gate scaling vector, σ ( · ) denotes the sigmoid activation function, and ⊙ denotes element-wise multiplication. The term “Gate-Scaled” indicates that the gate responses are adaptively scaled before sigmoid activation. Compared with standard LSTM gating, the scaling vector explicitly modulates the responses of the input and forget gates, enabling the state update process to better adapt to different structural contexts along the point cloud sequence. The candidate cell state and output gate are computed as
c ˜ k = tanh ( W c u k ) , o k = σ ( W o u k ) ,
where W c and W o are learnable linear mappings. The cell state and hidden state are then updated by
c k L = f k c k 1 L + i k c ˜ k ,
h k L = o k tanh ( c k L ) .
Here, h k L R D L and c k L R D L denote the hidden and cell states of the Gate-Scaled LSTM branch, respectively. In our implementation, D L = 2 D s , which provides a higher-capacity state space for long-range context modeling.

3.4.2. Adaptive Gated Fusion

In parallel with the Gate-Scaled LSTM branch, a GRU branch is employed to capture complementary local variation patterns between adjacent sequence positions:
h k G = GRU ( h ^ k , h k 1 G ) ,
where h k G R D s denotes the hidden state of the GRU branch. To make the outputs of the two sequential branches compatible for fusion, a dimension-aligned long-range context representation is obtained as
h ¯ k L = Π ( h k L ) ,
where Π ( · ) denotes the dimension alignment operation. In our implementation, Π ( · ) selects the first D s channels of h k L .
The current input token, the aligned Gate-Scaled LSTM representation, and the GRU representation are concatenated to compute adaptive fusion weights:
r k = [ h ^ k ; h ¯ k L ; h k G ] ,
where r k R 3 D s . In our implementation, the lightweight gating network is shared across all sequence positions and is implemented as a two-layer MLP:
s k = W 2 δ ( W 1 r k + b 1 ) + b 2 ,
where W 1 R D g × 3 D s , W 2 R 3 × D g . Here, D g denotes the hidden dimension of the gating network. δ ( · ) denotes the LeakyReLU activation function with a negative slope of 0.2. The output s k R 3 represents the fusion logits for the three information sources. The adaptive fusion weights are then obtained by applying a softmax operation along the source dimension:
α k = Softmax ( s k ) ,
where α k = [ α k ( 1 ) , α k ( 2 ) , α k ( 3 ) ] R 3 denotes the fusion coefficients for the aligned Gate-Scaled LSTM representation, the GRU representation, and the current input token, respectively. The fused sequential output at the k-th sequence position is computed as
z k = α k ( 1 ) h ¯ k L + α k ( 2 ) h k G + α k ( 3 ) h ^ k .
By stacking the fused outputs over all sequence positions, the final sequential representation is obtained as
Z = { z k } k = 1 M , Z R B × M × D s .
It is worth noting that GeoSeqNet does not rely on a strict ordering rule for raw points. Since sequential dependency learning is performed on geometry-enhanced local region representations rather than individual points, and geometric information is continuously preserved by GEM, the proposed framework reduces the influence of sequence ordering while maintaining geometric consistency during contextual learning. In addition to preserving geometric consistency, AGF also provides a more efficient alternative to self-attention-based contextual interaction. For an input sequence of length M and feature dimension D s , self-attention-based methods typically require pairwise token interactions, leading to a computational complexity of O ( M 2 D s ) with respect to the sequence length. In contrast, the proposed AGF module performs contextual modeling through sequential feature propagation. Since the Gate-Scaled LSTM and GRU branches process the sequence step by step, the overall computational complexity of AGF can be approximated as O ( M D s 2 ) when the hidden-state dimension is comparable to D s . The lightweight gating network introduces only a small additional cost and does not change the asymptotic complexity. Therefore, AGF grows linearly with the sequence length M, enabling efficient long-range contextual modeling while avoiding the quadratic token-to-token interaction overhead associated with self-attention mechanisms.
Overall, AGF integrates long-range context accumulation, adjacent-position variation perception, and direct input preservation into a unified sequential dependency learning framework. Compared with single-branch sequential modeling, the proposed design provides a more flexible mechanism for balancing different information sources during sequence propagation.Compared with self-attention-based contextual interaction, AGF captures cross-region contextual dependencies with lower computational complexity and memory overhead, making it more suitable for efficient and robust point cloud analysis.

4. Experiments

In this section, we first introduce the datasets and implementation details used in our experiments. We then compare the performance of GeoSeqNet with existing methods on several benchmark datasets. Finally, we conduct a series of ablation studies to validate the effectiveness of the proposed modules.

4.1. Experimental Settings

Datasets. To comprehensively evaluate the effectiveness of the proposed method under different spatial perception scenarios, experiments are conducted on three widely used benchmark datasets, including ModelNet40 [44], ScanObjectNN [45], and ShapeNetPart [46]. ModelNet40 is a synthetic CAD-based benchmark dataset for 3D object classification, containing 12,311 clean and uniformly sampled models from 40 object categories. Following the standard experimental protocol, 9843 samples are used for training and 2468 samples are used for testing. Since the dataset contains relatively regular geometric structures and limited sensing interference, it is mainly adopted to evaluate the global geometric representation capability of the proposed method under ideal spatial conditions. ScanObjectNN is a real-world scanned point cloud benchmark containing severe background clutter, occlusions, incomplete structures, and irregular sampling distributions. Following previous works, experiments are conducted on the PB_T50_RS split, which is considered one of the most challenging real-world point cloud benchmarks. Although ScanObjectNN is not a remote sensing dataset, its noisy and irregular scanning characteristics are highly consistent with practical LiDAR sensing scenarios in remote sensing applications. Therefore, this dataset is particularly suitable for evaluating the robustness and contextual propagation capability of the proposed method under complex sensing conditions. ShapeNetPart is a large-scale benchmark for point cloud part segmentation, containing 16 object categories and 50 part labels. The dataset provides fine-grained part-level annotations for evaluating local geometric decomposition capability and contextual structural understanding. Following the standard setting, each shape is uniformly sampled into 2048 points during both training and testing.
Implementation Details. All experiments were conducted using the PyTorch framework on two NVIDIA Tesla P40 GPUs (24 GB memory per GPU). Unless otherwise specified, all efficiency-related results, including inference speed and computational cost evaluations, were obtained under this hardware configuration. The AdamW optimizer is adopted with an initial learning rate of 0.001 and a batch size of 32. A cosine annealing scheduler is used for learning rate decay. During training, random rotation, scaling, and jittering are applied for data augmentation. GeoSeqNet is trained for 350 epochs on classification tasks and 300 epochs on part segmentation tasks. In all experiments, only the raw 3D coordinates ( x , y , z ) are used as network input. we follow standard input settings: 1024 points are used for ModelNet40, while 2048 points are sampled for both ScanObjectNN and ShapeNetPart. To ensure a fair comparison, all compared methods are evaluated under the same supervised learning setting. We follow standard benchmarks in point cloud classification and segmentation. Methods relying on large-scale pretraining or external datasets are not included in the comparison, as they adopt different training paradigms.
Evaluation Metrics. For classification tasks, overall accuracy (OA) and mean class accuracy (mAcc) are adopted as evaluation metrics. For part segmentation, mean Intersection-over-Union (mIoU) and instance-average Intersection-over-Union (Ins.mIoU) are reported. In addition to recognition performance, model efficiency is further evaluated using parameter counts and floating-point operations (FLOPs). These metrics are particularly important for large-scale spatial perception and remote sensing applications, where computational efficiency and robust contextual interaction are both critical requirements.

4.2. Classification Results on ModelNet40

Table 1 reports the classification results on ModelNet40. GeoSeqNet achieves an overall accuracy (OA) of 93.9% and a mean class accuracy (mAcc) of 91.8% while maintaining relatively low computational complexity. Compared with PointNet and PointNet++, GeoSeqNet achieves substantial performance improvements, demonstrating the effectiveness of geometry-aware contextual learning in extracting discriminative geometric representations. GeoSeqNet also achieves competitive performance relative to representative graph-based and Transformer-based methods, such as DGCNN and PCT, suggesting that preserving spatial geometric context during long-range contextual interaction facilitates more effective feature learning than relying solely on local aggregation or self-attention-based relation modeling. It should be noted that GeoSeqNet does not achieve the highest OA on ModelNet40. Some recent methods obtain comparable or higher classification accuracy on this benchmark. For example, DuGREAT achieves the highest OA of 94.6%, but its parameter size and computational cost reach 19.16M and 30 GFLOPs, respectively. In contrast, GeoSeqNet achieves competitive recognition performance with only 5.72M parameters and 2.0 GFLOPs. Therefore, the practical significance of GeoSeqNet on ModelNet40 does not lie in absolute accuracy superiority, but in achieving a favorable efficiency–accuracy trade-off. This result indicates that when both classification accuracy and computational cost are considered, GeoSeqNet can provide a relatively compact and efficient solution.
Table 1. Classification results on ModelNet40 dataset.

4.3. Classification Results on ScanObjectNN

Unlike ModelNet40, ScanObjectNN is constructed from real-world scanned objects and contains severe sensing degradation, including noisy observations, background clutter, partial occlusion, and irregular point distributions. Therefore, performance on this benchmark more directly reflects the robustness and generalization capability of point cloud models under complex real-world sensing conditions. The quantitative comparisons on ScanObjectNN are summarized in Table 2. To provide a more stable evaluation of GeoSeqNet, we conducted three independent runs under the same experimental setting. The obtained OA values are 88.81%, 88.74%, and 88.76%, resulting in an average OA of ( ( 88.77 ± 0.04 ) % ), which is reported as 88.8% in Table 2. GeoSeqNet achieves the best overall performance, obtaining an OA of 88.8% and an mAcc of 88.0%, while maintaining a relatively low computational cost of 2.0 GFLOPs and 5.72M parameters. Compared with Transformer-based methods such as PCT and PointConT, GeoSeqNet consistently achieves higher recognition accuracy with fewer parameters and lower computational overhead. This indicates that preserving spatial geometric context during long-range contextual interaction is more effective than relying solely on self-attention-based global relation modeling under noisy and irregular point cloud conditions. GeoSeqNet also outperforms several recent state-space-based methods, including PointMamba, SI-Mamba, and Mamba3D. Although these approaches improve computational efficiency through sequential or state-space modeling mechanisms, their ability to maintain stable geometric representations under sensing degradation remains limited when explicit geometric context is insufficiently preserved during feature interaction. In contrast, GeoSeqNet jointly integrates local neighborhood refinement, coordinate-aware geometric context preservation, and adaptive contextual propagation, resulting in more stable geometric representation learning under challenging real-world sensing environments.
Table 2. Classification results on ScanObjectNN dataset.
To further illustrate the trade-off between recognition accuracy and computational efficiency, Figure 2 presents a bubble chart comparison on ScanObjectNN, where the bubble area is proportional to FLOPs. It can be observed that several methods with substantially larger computational costs, such as PointMLP and DuGREAT, still fail to achieve better recognition performance than GeoSeqNet. This phenomenon suggests that simply increasing model complexity or global interaction capacity does not necessarily improve robustness under noisy observations, incomplete geometry, and irregular point distributions. In contrast, GeoSeqNet is located in the upper region of the accuracy–efficiency space with a relatively small bubble size, demonstrating that the proposed geometry-aware contextual learning strategy achieves a more favorable balance between robustness and computational efficiency. These empirical observations are also consistent with the theoretical complexity analysis presented in the method section, further supporting the efficiency advantage of the proposed AGF module. Overall, the results in Table 2 and Figure 2 consistently demonstrate that GeoSeqNet not only achieves competitive classification performance but also maintains superior computational efficiency under complex real-world sensing conditions. We attribute this advantage to the collaborative interaction among three complementary components: ELO suppresses unreliable neighborhood responses caused by irregular sampling and sensing noise, GEM continuously preserves spatial geometric context during long-range contextual interaction, and AGF enables stable contextual propagation with relatively low computational overhead.
Figure 2. Comparison of overall accuracy (OA) and computational complexity of different point cloud classification methods on the ScanObjectNN dataset. Bubble area is proportional to FLOPs. GeoSeqNet achieves the highest OA with low computational complexity, demonstrating a favorable accuracy–efficiency trade-off.
Finally, to analyze the learned feature representations of the model, we introduce t-SNE visualization of feature embeddings. As shown in Figure 3, it can be observed that PCT and PointMLP exhibit a certain degree of class overlap in the feature space, whereas GeoSeqNet presents a more clearly separated class structure with significantly reduced inter-class mixing. This result indicates that GeoSeqNet learns more discriminative feature representations. Its geometry-aware encoding and long-range contextual modeling contribute to improved separability and discriminability in the feature space, thereby enhancing overall model performance.
Figure 3. Comparison of learned feature embeddings visualized by t-SNE on the ScanObjectNN dataset, where different colors represent different object categories.

4.4. Part Segmentation Results on ShapeNetPart

The part segmentation results on ShapeNetPart are summarized in Table 3. GeoSeqNet achieves an instance mIoU of 86.0%, demonstrating strong competitiveness against existing methods. Compared with recent strong baselines such as PointMLP and DSACNN, GeoSeqNet further achieves consistent performance improvements, indicating that geometry-aware contextual learning remains beneficial for fine-grained structural understanding. From the category-wise results, GeoSeqNet achieves the best performance on bag, cap, guitar, knife, and mug, while obtaining tied-best performance on laptop and skateboard. These categories usually require joint modeling of local geometric details and long-range structural consistency. The experimental results indicate that GeoSeqNet is capable of maintaining stable contextual interaction across spatially separated structural components. Meanwhile, GeoSeqNet does not yet achieve the best results on categories with more drastic shape variations or highly slender structures, such as rocket and lamp. This suggests that further improvements in geometric sensitivity and adaptive contextual interaction remain possible for extremely complex geometric structures. Qualitative visualization results are shown in Figure 4. GeoSeqNet produces structurally consistent segmentation boundaries and demonstrates robust part discrimination ability across different object categories.
Table 3. The experimental results for part segmentation on the ShapeNet Parts dataset were compared.
Figure 4. Visualization results for part segmentation using GeoSeqNet. Points are marked with different colors based on the parts to which they belong. The first row shows the model’s predicted results, and the second row displays the Ground Truth.

4.5. Ablation Study

To further validate the effectiveness of the proposed framework, extensive ablation studies are conducted on ScanObjectNN. Compared with ModelNet40 and ShapeNetPart, ScanObjectNN contains more severe sensing degradation, including noisy observations, background clutter, partial occlusions, and irregular point distributions, thereby providing a more challenging benchmark for evaluating module effectiveness. The increased geometric complexity and sensing uncertainty in ScanObjectNN enable a more rigorous assessment of the individual contributions of ELO, GEM, and AGF than relatively clean benchmark datasets.

4.5.1. Overall Module Ablation

Table 4 presents the overall module ablation analysis on ScanObjectNN. The pure MLP baseline achieves an OA of 81.5%, indicating that feature transformation alone is insufficient for robust geometric representation learning under complex sensing conditions. Introducing ELO improves the OA to 86.6%, demonstrating that explicitly refining neighborhood responses helps suppress unreliable local geometric interference caused by irregular sampling and sensing noise. Incorporating GEM further improves the OA to 86.9%, suggesting that preserving coordinate-aware spatial context is beneficial for stabilizing geometric representation learning during long-range contextual interaction. Among all individual modules, AGF achieves the most significant performance gain, increasing the OA to 87.9%. This indicates that long-range contextual interaction plays an important role in point cloud understanding under noisy and irregular real-world sensing conditions. Further combining ELO or GEM with AGF consistently improves performance. Specifically, ELO+AGF and GEM+AGF achieve 88.2% and 88.4% OA, respectively, and the complete GeoSeqNet achieves the best performance of 88.8%. These results show that local geometry refinement, geometric context preservation, and adaptive long-range contextual interaction provide complementary benefits for robust point cloud understanding.
Table 4. Overall module ablation analysis of GeoSeqNet on the ScanObjectNN benchmark.
To further examine the interaction between ELO and GEM, we analyze their combination with and without AGF. When AGF is absent, ELO+GEM achieves an OA of 87.1%, which is only slightly higher than ELO alone (86.6%) and GEM alone (86.9%). This indicates that directly combining local geometric refinement and geometric encoding brings limited additional benefit without long-range contextual propagation. In contrast, when AGF is introduced, both ELO and GEM further improve the model performance. ELO+AGF improves the OA to 88.2%, while GEM+AGF achieves a higher OA of 88.4%. This suggests that the contribution of GEM becomes more evident in the presence of long-range contextual interaction, since the coordinate-aware geometric information preserved by GEM can be more effectively utilized during cross-region feature propagation. Meanwhile, ELO provides refined local geometric features that can support more reliable AGF-based contextual modeling.
In addition, we report the additional parameter cost introduced by each module in Table 5. ELO and GEM introduce only 0.0682M and 0.0090M additional parameters, respectively, while AGF accounts for the major parameter increase due to its sequential contextual modeling structure. Combined with the ablation results, these parameter statistics show that ELO, GEM, and AGF contribute to performance improvement with reasonable module-level parameter costs. Overall, the results indicate that the three modules are complementary: ELO focuses on local geometric enhancement, GEM preserves geometric context, and AGF performs long-range contextual interaction.
Table 5. Additional parameter cost introduced by each module in GeoSeqNet.

4.5.2. Ablation on Contextual Interaction Components

Table 6 compares different contextual interaction strategies. Using only the GSLSTM branch achieves better performance than using only GRU, indicating that stable long-range contextual propagation plays an important role in robust geometric representation learning. Compared with the more locally oriented contextual updating behavior of GRU, GSLSTM maintains more continuous contextual propagation across larger spatial regions, which is beneficial for preserving cross-region geometric consistency. Further combining GSLSTM and GRU leads to additional performance improvements, suggesting that long-range contextual consistency and local structural variation provide complementary information.
Table 6. Comparison of different sequential modeling components on the ScanObjectNN dataset.
In addition, we further compare the proposed long-range contextual interaction strategy with conventional LSTM and BiLSTM architectures. As shown in Table 7, the proposed GSLSTM achieves more stable and superior performance. This indicates that conventional fixed gating mechanisms are less effective at dynamically adjusting contextual propagation strength according to different geometric structures in complex point cloud scenes. By contrast, the proposed gate scaling strategy enables more flexible long-range contextual interaction through learnable gate scaling vectors, making it more suitable for complex 3D geometric structure modeling.
Table 7. Comparison of different long-range contextual interaction strategies on ScanObjectNN.
Finally, we conduct an ablation study on the adaptive gated fusion mechanism. As shown in Table 8, equal-weight fusion performs noticeably worse than adaptive fusion. This suggests that different spatial regions exhibit varying dependencies on local geometric details and global contextual information. The adaptive gated fusion mechanism dynamically adjusts the importance of different feature branches according to the current geometric context, thereby enabling more stable and robust contextual interaction.
Table 8. Ablation on fusion weighting strategy in Adaptive Gate Fusion Block on ScanObjectNN.

4.5.3. Ablation on Spatial Weighting in Enhanced Local Operator

Table 9 evaluates the effectiveness of the spatial weighting mechanism in ELO. Removing spatial weighting leads to a noticeable performance drop, indicating that selective neighborhood response refinement is important for suppressing unreliable geometric responses under irregular point distributions and noisy observations. This is mainly because neighboring points in real-world point clouds often exhibit inconsistent geometric quality due to sensing noise, density variation, and incomplete observations. Directly aggregating all neighborhood features with equal importance may therefore introduce unstable local responses. By contrast, the proposed spatial weighting mechanism dynamically adjusts neighborhood contributions according to geometric relevance, enabling the network to emphasize structurally informative regions while suppressing unreliable geometric interference. The results further demonstrate that geometry-aware neighborhood refinement substantially improves robust point cloud understanding under complex sensing conditions.
Table 9. Comparison between Local Operator and Enhanced Local Operator on ScanObjectNN.

4.5.4. Effect of Sequence Ordering Strategies

To investigate the influence of sequence ordering on GeoSeqNet, we evaluate several sequence construction strategies, including sorting along the x-axes, y-axes, and z-axes, random ordering, and the default sequence configuration. The results are summarized in Table 10. It can be observed that GeoSeqNet achieves consistently strong performance under different axis-based ordering strategies. The performance variation among x-axis, y-axis, and z-axis ordering remains within 0.1%, indicating that the proposed framework is not sensitive to a specific geometric ordering strategy. Although random ordering leads to a slight decrease in performance, the degradation is limited, suggesting that GeoSeqNet still maintains effective contextual learning capability without relying on a strict sequence arrangement. We attribute this robustness to the geometry-aware design of the proposed framework. Specifically, ELO extracts stable local geometric representations, while GEM continuously preserves spatial geometric context during feature interaction. Consequently, sequential learning is performed on geometry-enhanced local region representations rather than arbitrarily ordered raw points, making the model less sensitive to sequence ordering while preserving effective long-range contextual dependencies.
Table 10. Influence of Sequence Ordering Strategies on Model Performance.

4.5.5. Effect of Geometric Encoding and Fusion Strategy

To further analyze the rationality of the GEM design, we conduct additional ablation experiments on different geometric encoding methods and feature fusion strategies. Since GEM aims to reintroduce coordinate-aware geometric context during long-range feature interaction, the choice of coordinate encoder and fusion strategy directly affects the effectiveness of the geometric prior. Table 11 presents the experimental results of different geometric encoding methods. Compared with sinusoidal positional encoding and learnable Fourier feature encoding, the MLP-based encoding adopted in this work achieves the best performance. This result indicates that directly introducing frequency-based coordinate representations is not necessarily the most suitable choice for GEM. Sinusoidal positional encoding relies on fixed frequency bases and has limited adaptability to different point cloud distributions. Although learnable Fourier feature encoding introduces trainable frequency projections and provides stronger representational flexibility, it may also emphasize certain high-frequency coordinate variations, which are not necessarily beneficial for region-level geometric context modeling. In contrast, the two-layer MLP encoder can learn compact nonlinear geometric representations from raw coordinates, adaptively encoding coordinate information according to the training objective while avoiding excessive positional complexity. Table 12 further compares the influence of different fusion strategies in GEM. Additive fusion with learnable weights and gated fusion achieve OA values of 88.2% and 88.6%, respectively. The performance of these two fusion strategies is still slightly lower than that of the concatenation-based fusion adopted in this work. A possible reason is that additive fusion directly adds semantic features and geometric features after projecting them into the same feature space, which may weaken their independent complementary information. Although gated fusion can adaptively control the introduction of geometric features, it may also suppress some useful geometric cues at an early stage. In contrast, concatenation-based fusion does not force the two types of features to be immediately mixed. Instead, it preserves the original feature representation and the geometric encoding representation before subsequent feature transformation, enabling the subsequent network layers to exploit their complementary information more flexibly. Therefore, this work adopts the two-layer MLP encoder and concatenation-based fusion as the final design of GEM.
Table 11. Effect of different geometric encoding strategies in GEM.
Table 12. Effect of different feature fusion strategies in GEM.

4.6. Robustness Analysis

To evaluate the robustness of the proposed method, we conduct experiments on the ScanObjectNN dataset under three representative point cloud corruption settings, including point dropout, density variation, and uniform noise perturbation. The results are illustrated in Figure 5. A clear distinction can be observed between structural perturbations (point dropout and density variation) and coordinate-level perturbations (uniform noise). Under structural corruption, the model exhibits only slight performance degradation. Specifically, even when 70% of points are removed, the accuracy decreases marginally from 88.8% to 86.9%. Similarly, under density variation, the performance decreases smoothly, and the model still achieves 85.7% accuracy when only 25% of points are retained, indicating strong robustness to incomplete and sparse geometric observations. In contrast, uniform noise leads to a more pronounced performance drop, where accuracy decreases from 88.8% to 64.2% as the noise level increases. This suggests that coordinate-level perturbations have a significantly stronger impact on feature representation than structural corruption. This behavior can be attributed to the fact that the proposed method relies on local neighborhood construction and hierarchical geometric feature encoding, which are sensitive to accurate relative spatial relationships. Structural perturbations preserve the overall geometric topology, enabling stable feature aggregation. However, uniform noise directly disrupts coordinate consistency, leading to incorrect neighborhood construction and degraded geometric representation. Overall, the proposed method demonstrates strong robustness to structural corruption, while being more sensitive to coordinate-level noise. This indicates that the model effectively models geometric structure consistency, but its robustness to high-frequency coordinate perturbations remains limited.
Figure 5. Robustness analysis of the proposed method under different point cloud corruption settings on the ScanObjectNN dataset, including point dropout, density variation, and uniform noise perturbation. The curves illustrate the performance degradation trends as the severity of each perturbation increases.

5. Conclusions

In this work, we propose GeoSeqNet, a geometry-aware contextual learning framework for efficient and robust 3D point cloud analysis. Different from methods that mainly rely on fixed local aggregation or computationally expensive global interaction mechanisms, GeoSeqNet aims to preserve spatial geometric context during long-range contextual interaction. Specifically, the proposed framework integrates an Enhanced Local Operator (ELO), a Geometric Encoding Module (GEM), and an Adaptive Gate Fusion (AGF) module within a unified architecture. Through the collaboration of local geometry refinement, coordinate-aware geometric context preservation, and adaptive contextual propagation, GeoSeqNet effectively captures both fine-grained local structures and cross-region dependencies while maintaining relatively low computational overhead. Extensive experiments on ModelNet40, ScanObjectNN, and ShapeNetPart demonstrate the effectiveness of the proposed method. GeoSeqNet achieves competitive performance with a favorable efficiency–accuracy trade-off. In particular, its strong performance on the real-world ScanObjectNN benchmark indicates improved robustness under incomplete geometry, background interference, and irregular sampling conditions. These results suggest that preserving spatial geometric context during long-range interaction is beneficial for robust point cloud understanding in complex real-world sensing environments. Beyond classification and segmentation, this work also highlights the potential of geometry-aware contextual propagation for point cloud representation learning. Compared with purely attention-based architectures, the combination of explicit geometric modeling and lightweight long-range contextual learning provides a suitable inductive bias for complex 3D geometric data. In future work, we will further investigate more robust neighborhood construction and geometry-aware contextual interaction strategies under sparse observations and severe sensing degradation. Extending GeoSeqNet to dynamic point cloud perception, large-scale sensing applications, and pretraining-based representation learning also remains an important direction for future research.

Author Contributions

Conceptualization, D.L.; methodology, D.L.; software, D.L.; validation, D.L., and Y.D.; formal analysis, D.L., H.W. and Y.D.; investigation, D.L. and H.W.; resources, J.Z. and S.F.; data curation, D.L. and Y.D.; writing—original draft preparation, D.L.; writing—review and editing, S.F.; visualization, D.L. and Y.D.; supervision, J.Z. and S.F.; project administration, J.Z. and S.F.; funding acquisition, J.Z. and S.F. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China (no. 62473078).

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Yang, Y.; Liu, J.; Liu, H.; Jiang, G. MKFusion: Multi-Modal Knowledge Distillation for 4D Radar Point Cloud Segmentation in Autonomous Driving. Knowl.-Based Syst. 2026, 2026, 115616. [Google Scholar] [CrossRef] [Scilit]
  2. Jiang, Y.; Liu, G.; Huang, Z.; Yang, B.; Yang, W. Geometry Perception and Motion Planning in Robotic Assembly Based on Semantic Segmentation and Point Clouds Reconstruction. Eng. Appl. Artif. Intell. 2024, 130, 107678. [Google Scholar] [CrossRef] [Scilit]
  3. Wen, Y.; Shah, A.B.; Cao, R.; Zhang, C.; Chen, J.; Wu, X.; Xie, C.; Fu, X. AR-Light: Enabling Fast and Lightweight Multi-User Augmented Reality via Semantic Segmentation and Collaborative View Synchronization. IEEE Trans. Comput. 2025, 74, 2073–2086. [Google Scholar] [CrossRef] [Scilit]
  4. Liu, Y.; Zhang, C.; Dong, X.; Ning, J. Point Cloud-Based Deep Learning in Industrial Production: A Survey. ACM Comput. Surv. 2025, 57, 1–36. [Google Scholar] [CrossRef] [Scilit]
  5. Qi, C.R.; Su, H.; Mo, K.; Guibas, L.J. PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2017; pp. 652–660. [Google Scholar]
  6. Qi, C.R.; Yi, L.; Su, H.; Guibas, L.J. PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space. Adv. Neural Inf. Process. Syst. 2017, 30, 9495. [Google Scholar]
  7. Li, Y.; Bu, R.; Sun, M.; Wu, W.; Di, X.; Chen, B. PointCNN: Convolution on X-Transformed Points. Adv. Neural Inf. Process. Syst. 2018, 31, 7791. [Google Scholar]
  8. Wu, W.; Qi, Z.; Li, F. PointConv: Deep Convolutional Networks on 3D Point Clouds. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2019. [Google Scholar]
  9. Zhao, H.; Jiang, L.; Fu, C.-W.; Jia, J. PointWeb: Enhancing Local Neighborhood Features for Point Cloud Processing. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2019; pp. 5565–5573. [Google Scholar]
  10. Xu, Y.; Fan, T.; Xu, M.; Zeng, L.; Qiao, Y. SpiderCNN: Deep Learning on Point Sets with Parameterized Convolutional Filters. In Proceedings of the European Conference on Computer Vision (ECCV); IEEE: New York, NY, USA, 2018; pp. 87–102. [Google Scholar]
  11. Qian, G.; Li, Y.; Peng, H.; Mai, J.; Hammoud, H.; Elhoseiny, M.; Ghanem, B. PointNeXt: Revisiting PointNet++ with Improved Training and Scaling Strategies. Adv. Neural Inf. Process. Syst. 2022, 35, 23192–23204. [Google Scholar] [CrossRef] [Scilit]
  12. Guo, M.-H.; Cai, J.-X.; Liu, Z.-N.; Mu, T.-J.; Martin, R.R.; Hu, S.-M. PCT: Point Cloud Transformer. Comput. Vis. Media 2021, 7, 187–199. [Google Scholar] [CrossRef] [Scilit]
  13. Liu, Y.; Tian, B.; Lv, Y.; Li, L.; Wang, F.-Y. Point Cloud Classification Using Content-Based Transformer via Clustering in Feature Space. IEEE/CAA J. Autom. Sin. 2023, 11, 231–239. [Google Scholar] [CrossRef] [Scilit]
  14. Sha, S.; Liu, Q.; Zhang, Y.; Yun, T. FA-CTNet: A Geometry-Aware Deep Learning Approach for Tree Species Classification from LiDAR Point Clouds. Remote Sens. 2026, 18, 1311. [Google Scholar] [CrossRef] [Scilit]
  15. Li, X.; Wang, Q.; Qiu, B. Dual-Path Geometric Relation-Aware Transformer for Point Cloud Classification and Segmentation. Appl. Soft Comput. 2025, 174, 112801. [Google Scholar] [CrossRef] [Scilit]
  16. Lu, D.; Xie, Q.; Wei, M.; Gao, K.; Xu, L.; Li, J. Transformers in 3D Point Clouds: A Survey. arXiv 2022, arXiv:2205.07417. [Google Scholar]
  17. Zhang, C.; Wan, H.; Shen, X.; Wu, Z. PVT: Point-Voxel Transformer for Point Cloud Learning. Int. J. Intell. Syst. 2022, 37, 11985–12008. [Google Scholar] [CrossRef] [Scilit]
  18. Hou, X.; Feng, H.; Li, Z.; Zhou, S.; Wang, J.; Fang, Z.; Jiang, X.-Q. HgCA: Hypergraph Neural Network with Cross-Attention for Point Cloud Analysis. Neurocomputing 2026, 674, 132874. [Google Scholar] [CrossRef] [Scilit]
  19. Thomas, H.; Qi, C.R.; Deschaud, J.-E.; Marcotegui, B.; Goulette, F.; Guibas, L.J. KPConv: Flexible and Deformable Convolution for Point Clouds. In Proceedings of the IEEE/CVF International Conference on Computer Vision; IEEE: New York, NY, USA, 2019; pp. 6411–6420. [Google Scholar]
  20. Wang, Y.; Sun, Y.; Liu, Z.; Sarma, S.E.; Bronstein, M.M.; Solomon, J.M. Dynamic Graph CNN for Learning on Point Clouds. ACM Trans. Graph. 2019, 38, 1–12. [Google Scholar] [CrossRef] [Scilit]
  21. Xu, M.; Ding, R.; Zhao, H.; Qi, X. PAConv: Position Adaptive Convolution with Dynamic Kernel Assembling on Point Clouds. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2021; pp. 3173–3182. [Google Scholar]
  22. Muzahid, A.A.M.; Wan, W.; Sohel, F.; Wu, L.; Hou, L. CurveNet: Curvature-Based Multitask Learning Deep Networks for 3D Object Recognition. IEEE/CAA J. Autom. Sin. 2020, 8, 1177–1187. [Google Scholar] [CrossRef] [Scilit]
  23. Ma, X.; Qin, C.; You, H.; Ran, H.; Fu, Y. Rethinking Network Design and Local Geometry in Point Cloud: A Simple Residual MLP Framework. arXiv 2022, arXiv:2202.07123. [Google Scholar]
  24. Zhao, H.; Jiang, L.; Jia, J.; Torr, P.H.S.; Koltun, V. Point Transformer. In Proceedings of the IEEE/CVF International Conference on Computer Vision; IEEE: New York, NY, USA, 2021; pp. 16259–16268. [Google Scholar]
  25. Wu, X.; Lao, Y.; Jiang, L.; Liu, X.; Zhao, H. Point Transformer V2: Grouped Vector Attention and Partition-Based Pooling. Adv. Neural Inf. Process. Syst. 2022, 35, 33330–33342. [Google Scholar] [CrossRef] [Scilit]
  26. Xiao, G.; Ge, S.; Zhong, Y.; Xiao, Z.; Song, J.; Lu, J. SAPFormer: Shape-Aware Propagation Transformer for Point Clouds. Pattern Recognit. 2025, 164, 111578. [Google Scholar] [CrossRef] [Scilit]
  27. Yu, X.; Tang, L.; Rao, Y.; Huang, T.; Zhou, J.; Lu, J. Point-BERT: Pre-Training 3D Point Cloud Transformers with Masked Point Modeling. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2022; pp. 19313–19322. [Google Scholar]
  28. Pang, Y.; Tay, E.H.F.; Yuan, L.; Chen, Z. Masked Autoencoders for 3D Point Cloud Self-Supervised Learning. World Sci. Annu. Rev. Artif. Intell. 2023, 1, 2440001. [Google Scholar]
  29. Liang, D.; Zhou, X.; Wang, X.; Zhu, X.; Xu, W.; Zou, Z.; Ye, X.; Bai, X. PointMamba: A Simple State Space Model for Point Cloud Analysis. arXiv 2024, arXiv:2402.10739. [Google Scholar]
  30. Han, X.; Tang, Y.; Wang, Z.; Li, X. Mamba3D: Enhancing Local Features for 3D Point Cloud Analysis via State Space Model. In Proceedings of the 32nd ACM International Conference on Multimedia; IEEE: New York, NY, USA, 2024; pp. 4995–5004. [Google Scholar]
  31. Zhou, B.; Zhan, L.; Jiang, J. LFE-PointMamba: Point Cloud Learning via Local Feature Enhancement and State Space Model. Knowl.-Based Syst. 2025, 2025, 114350. [Google Scholar] [CrossRef] [Scilit]
  32. Bahri, A.; Yazdanpanah, M.; Noori, M.; Dastani, S.; Cheraghalikhani, M.; Hakim, G.A.V.; Osowiechi, D.; Beizaee, F.; Ben Ayed, I.; Desrosiers, C. Spectral Informed Mamba for Robust Point Cloud Processing. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2025; pp. 11799–11809. [Google Scholar]
  33. Song, D.; Yan, C.; Wang, B.; Liu, Y.; Wang, C. GMSFormer: Geometric-Aware Multi-Structured Transformer for Point Cloud Understanding. Pattern Recognit. 2026, 175, 113111. [Google Scholar] [CrossRef] [Scilit]
  34. Rusu, R.B.; Marton, Z.C.; Blodow, N.; Beetz, M. Persistent point feature histograms for 3D point clouds. In Proceedings of the 10th International Conference on Intelligent Autonomous Systems (IAS-10), Baden-Baden, Germany; IEEE: New York, NY, USA, 2008; pp. 119–128. [Google Scholar]
  35. Rusu, R.B.; Blodow, N.; Beetz, M. Fast Point Feature Histograms (FPFH) for 3D Registration. In Proceedings of the 2009 IEEE International Conference on Robotics and Automation; IEEE: New York, NY, USA, 2009; pp. 3212–3217. [Google Scholar]
  36. Tombari, F.; Salti, S.; Di Stefano, L. Unique Signed Surface Points (SHOT): A Descriptor for Surface Matching. In International Conference on 3D Digital Imaging and Modeling; IEEE: New York, NY, USA, 2010; pp. 357–364. [Google Scholar]
  37. Fuchs, F.; Worrall, D.; Fischer, V.; Welling, M. SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networks. Adv. Neural Inf. Process. Syst. 2020, 33, 1970–1981. [Google Scholar]
  38. Lin, C.E.; Zhu, M.; Ghaffari, M. SE3ET: SE(3)-Equivariant Transformer for Low-Overlap Point Cloud Registration. IEEE Robot. Autom. Lett. 2024, 9, 9526–9533. [Google Scholar] [CrossRef] [Scilit]
  39. Kang, X.; Luan, Z.; Khoshelham, K.; Wang, B. Equi-GSPR: Equivariant SE(3) Graph Network Model for Sparse Point Cloud Registration. In Proceedings of the European Conference on Computer Vision; IEEE: New York, NY, USA, 2024; pp. 149–167. [Google Scholar]
  40. Yu, C.; Zhang, S.; Shen, L.-Y. GETr: A Geometric Equivariant Transformer for Point Cloud Registration. Comput. Graph. Forum 2024, 43, e15216. [Google Scholar] [CrossRef] [Scilit]
  41. Li, Y.; Ma, L.; Zhong, Z.; Cao, D.; Li, J. TGNet: Geometric Graph CNN on 3-D Point Cloud Segmentation. IEEE Trans. Geosci. Remote Sens. 2020, 58, 3588–3600. [Google Scholar] [CrossRef] [Scilit]
  42. He, J.; Li, C.; Wang, S.; Kwong, S. Improving robustness of point cloud analysis through perturbation simulation and distortion-guided feature augmentation. Sensors 2025, 34, 6683–6698. [Google Scholar] [CrossRef] [Scilit]
  43. Zhao, L.; Hu, Y.; Yang, X.; Dou, Z.; Kang, L. Robust multi-task learning network for complex LiDAR point cloud data preprocessing. Expert Syst. Appl. 2024, 237, 121552. [Google Scholar] [CrossRef] [Scilit]
  44. Wu, Z.; Song, S.; Khosla, A.; Yu, F.; Zhang, L.; Tang, X.; Xiao, J. 3D ShapeNets: A Deep Representation for Volumetric Shapes. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2015; pp. 1912–1920. [Google Scholar]
  45. Uy, M.A.; Pham, Q.-H.; Hua, B.-S.; Nguyen, T.; Yeung, S.-K. Revisiting Point Cloud Classification: A New Benchmark Dataset and Classification Model on Real-World Data. In Proceedings of the IEEE/CVF International Conference on Computer Vision; IEEE: New York, NY, USA, 2019; pp. 1588–1597. [Google Scholar]
  46. Yi, L.; Kim, V.G.; Ceylan, D.; Shen, I.-C.; Yan, M.; Su, H.; Lu, C.; Huang, Q.; Sheffer, A.; Guibas, L. A Scalable Active Framework for Region Annotation in 3D Shape Collections. ACM Trans. Graph. 2016, 35, 1–12. [Google Scholar] [CrossRef] [Scilit]
  47. Liu, D.; Deng, Y.; Shang, P.; Zou, J.; Fan, S. A Multi-Scale Deep LSTM Model for 3D Point Cloud Classification. In 2025 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting; IEEE: New York, NY, USA, 2025; pp. 1–5. [Google Scholar]
  48. Atzmon, M.; Maron, H.; Lipman, Y. Point Convolutional Neural Networks by Extension Operators. arXiv 2018, arXiv:1803.10091. [Google Scholar]
  49. Liu, X.; Han, Z.; Liu, Y.-S.; Zwicker, M. Point2Sequence: Learning the Shape Representation of 3D Point Clouds with an Attention-Based Sequence to Sequence Network. In Proceedings of the AAAI Conference on Artificial Intelligence; IEEE: New York, NY, USA, 2019; pp. 8778–8785. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.