Feature-based morphological analysis of shape graph data

• URL: http://arxiv.org/abs/2602.16120v1
• Date: Wed, 18 Feb 2026 01:11:15 GMT
• Title: Feature-based morphological analysis of shape graph data
• Authors: Murad Hossen, Demetrio Labate, Nicolas Charon,
• Abstract summary: This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets.<n>Our purpose is not only to retrieve and distinguish variations in the connectivity structure of the data but also geometric differences of the network branches.
• Score: 4.449113067578087
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to retrieve and distinguish variations in the connectivity structure of the data but also geometric differences of the network branches. Our proposed approach relies on the extraction of a specifically curated and explicit set of topological, geometric and directional features, designed to satisfy key invariance properties. We leverage the resulting feature representation for tasks such as group comparison, clustering and classification on cohorts of shape graphs. The effectiveness of this representation is evaluated on several real-world datasets including urban road/street networks, neuronal traces and astrocyte imaging. These results are benchmarked against several alternative methods, both feature-based and not.

Related papers

• GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based Histogram Intersection [51.608147732998994]
  Graph neural networks are increasingly becoming the framework of choice for graph-based machine learning. We propose a new graph neural network architecture that substitutes classical message passing with an analysis of the local distribution of node features.
  arXiv  Detail & Related papers  (2024-01-17T13:04:23Z)
• 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)
• Classification of vertices on social networks by multiple approaches [1.370151489527964]
  In the case of social networks, it is crucial to evaluate the labels of discrete communities. For each of these interaction-based entities, a social graph, a mailing dataset, and two citation sets are selected as the testbench repositories. This paper was not only assessed the most valuable method but also determined how graph neural networks work.
  arXiv  Detail & Related papers  (2023-01-13T09:42:55Z)
• GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
  We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton. The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases. In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
  arXiv  Detail & Related papers  (2022-12-01T11:49:07Z)
• Towards a mathematical understanding of learning from few examples with nonlinear feature maps [68.8204255655161]
  We consider the problem of data classification where the training set consists of just a few data points. We reveal key relationships between the geometry of an AI model's feature space, the structure of the underlying data distributions, and the model's generalisation capabilities.
  arXiv  Detail & Related papers  (2022-11-07T14:52:58Z)
• Anisotropic Multi-Scale Graph Convolutional Network for Dense Shape Correspondence [3.45989531033125]
  This paper studies 3D dense shape correspondence, a key shape analysis application in computer vision and graphics. We introduce a novel hybrid geometric deep learning-based model that learns geometrically meaningful and discretization-independent features. The resulting correspondence maps show state-of-the-art performance on the benchmark datasets.
  arXiv  Detail & Related papers  (2022-10-17T22:40:50Z)
• Metric Distribution to Vector: Constructing Data Representation via Broad-Scale Discrepancies [15.40538348604094]
  We present a novel embedding strategy named $mathbfMetricDistribution2vec$ to extract distribution characteristics into the vectorial representation for each data. We demonstrate the application and effectiveness of our representation method in the supervised prediction tasks on extensive real-world structural graph datasets.
  arXiv  Detail & Related papers  (2022-10-02T03:18:30Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• TSGCNet: Discriminative Geometric Feature Learning with Two-Stream GraphConvolutional Network for 3D Dental Model Segmentation [141.2690520327948]
  We propose a two-stream graph convolutional network (TSGCNet) to learn multi-view information from different geometric attributes. We evaluate our proposed TSGCNet on a real-patient dataset of dental models acquired by 3D intraoral scanners.
  arXiv  Detail & Related papers  (2020-12-26T08:02:56Z)
• Primal-Dual Mesh Convolutional Neural Networks [62.165239866312334]
  We propose a primal-dual framework drawn from the graph-neural-network literature to triangle meshes. Our method takes features for both edges and faces of a 3D mesh as input and dynamically aggregates them. We provide theoretical insights of our approach using tools from the mesh-simplification literature.
  arXiv  Detail & Related papers  (2020-10-23T14:49:02Z)
• Representations, Metrics and Statistics For Shape Analysis of Elastic Graphs [21.597624908203805]
  This paper introduces a far-reaching geometric approach for analyzing shapes of graphical objects, such as road networks, blood vessels, brain fiber tracts, etc. It represents such objects, exhibiting differences in both geometries and topologies, as graphs made of curves with arbitrary shapes (edges) and connected at arbitrary junctions (nodes)
  arXiv  Detail & Related papers  (2020-02-29T16:07:48Z)

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.