Graph Smoothing for Enhanced Local Geometry Learning in Point Cloud Analysis

• URL: http://arxiv.org/abs/2601.11102v1
• Date: Fri, 16 Jan 2026 09:01:44 GMT
• Title: Graph Smoothing for Enhanced Local Geometry Learning in Point Cloud Analysis
• Authors: Shangbo Yuan, Jie Xu, Ping Hu, Xiaofeng Zhu, Na Zhao,
• Abstract summary: Graph-based methods have proven to be effective in capturing relationships among points for 3D point cloud analysis.<n>These methods often suffer from suboptimal graph structures due to sparse connections at boundary points and noisy connections in junction areas.<n>We introduce a graph smoothing module designed to optimize the graph structure and minimize the negative impact of unreliable sparse and noisy connections.
• Score: 19.545338629365894
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-based methods have proven to be effective in capturing relationships among points for 3D point cloud analysis. However, these methods often suffer from suboptimal graph structures, particularly due to sparse connections at boundary points and noisy connections in junction areas. To address these challenges, we propose a novel method that integrates a graph smoothing module with an enhanced local geometry learning module. Specifically, we identify the limitations of conventional graph structures, particularly in handling boundary points and junction areas. In response, we introduce a graph smoothing module designed to optimize the graph structure and minimize the negative impact of unreliable sparse and noisy connections. Based on the optimized graph structure, we improve the feature extract function with local geometry information. These include shape features derived from adaptive geometric descriptors based on eigenvectors and distribution features obtained through cylindrical coordinate transformation. Experimental results on real-world datasets validate the effectiveness of our method in various point cloud learning tasks, i.e., classification, part segmentation, and semantic segmentation.

Related papers

• Flexible Mesh Segmentation via Reeb Graph Representation of Geometrical and Topological Features [0.0]
  This paper presents a new mesh segmentation method that integrates geometrical and topological features through a flexible Reeb graph representation.<n>The algorithm consists of three phases: construction of the Reeb graph using the improved topological skeleton approach, topological simplification of the graph by cancelling critical points while preserving essential features, and generation of contiguous segments via an adaptive region-growth process.
  arXiv  Detail & Related papers  (2024-12-05T23:04:45Z)
• Graph Transformer GANs with Graph Masked Modeling for Architectural Layout Generation [153.92387500677023]
  We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations. The proposed graph Transformer encoder combines graph convolutions and self-attentions in a Transformer to model both local and global interactions. We also propose a novel self-guided pre-training method for graph representation learning.
  arXiv  Detail & Related papers  (2024-01-15T14:36:38Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Shape-Graph Matching Network (SGM-net): Registration for Statistical Shape Analysis [20.58923754314197]
  This paper focuses on the statistical analysis of shapes of data objects called shape graphs. A critical need here is a constrained registration of points (nodes to nodes, edges to edges) across objects. This paper tackles this registration problem using a novel neural-network architecture.
  arXiv  Detail & Related papers  (2023-08-14T00:42:03Z)
• GraphFit: Learning Multi-scale Graph-Convolutional Representation for Point Cloud Normal Estimation [31.40738037512243]
  We propose a precise and efficient normal estimation method for unstructured 3D point clouds. We learn graph convolutional feature representation for normal estimation, which emphasizes more local neighborhood geometry. Our method outperforms competitors with the state-of-the-art accuracy on various benchmark datasets.
  arXiv  Detail & Related papers  (2022-07-23T10:29:26Z)
• Effective and Efficient Graph Learning for Multi-view Clustering [173.8313827799077]
  We propose an effective and efficient graph learning model for multi-view clustering. Our method exploits the view-similar between graphs of different views by the minimization of tensor Schatten p-norm. Our proposed algorithm is time-economical and obtains the stable results and scales well with the data size.
  arXiv  Detail & Related papers  (2021-08-15T13:14:28Z)
• Spectral Graph Convolutional Networks With Lifting-based Adaptive Graph Wavelets [81.63035727821145]
  Spectral graph convolutional networks (SGCNs) have been attracting increasing attention in graph representation learning. We propose a novel class of spectral graph convolutional networks that implement graph convolutions with adaptive graph wavelets.
  arXiv  Detail & Related papers  (2021-08-03T17:57:53Z)
• Sparse Partial Least Squares for Coarse Noisy Graph Alignment [10.172041234280865]
  Graph signal processing (GSP) provides a powerful framework for analyzing signals arising in a variety of domains. We propose a novel regularized partial least squares method which both incorporates the observed graph structures and imposes sparsity in order to reflect the underlying block community structure.
  arXiv  Detail & Related papers  (2021-04-06T21:52:15Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Graph Networks with Spectral Message Passing [1.0742675209112622]
  We introduce the Spectral Graph Network, which applies message passing to both the spatial and spectral domains. Our results show that the Spectral GN promotes efficient training, reaching high performance with fewer training iterations despite having more parameters.
  arXiv  Detail & Related papers  (2020-12-31T21:33:17Z)
• Multilayer Clustered Graph Learning [66.94201299553336]
  We use contrastive loss as a data fidelity term, in order to properly aggregate the observed layers into a representative graph. Experiments show that our method leads to a clustered clusters w.r.t. We learn a clustering algorithm for solving clustering problems.
  arXiv  Detail & Related papers  (2020-10-29T09:58:02Z)
• Graph Pooling with Node Proximity for Hierarchical Representation Learning [80.62181998314547]
  We propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology. Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
  arXiv  Detail & Related papers  (2020-06-19T13:09:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.