Learning Geometric Invariant Features for Classification of Vector Polygons with Graph Message-passing Neural Network

• URL: http://arxiv.org/abs/2407.04334v2
• Date: Wed, 11 Jun 2025 21:39:27 GMT
• Title: Learning Geometric Invariant Features for Classification of Vector Polygons with Graph Message-passing Neural Network
• Authors: Zexian Huang, Kourosh Khoshelham, Martin Tomko,
• Abstract summary: We propose a simple graph message-passing framework, PolyMP, to learn more expressive and robust latent representations of polygons.<n>This framework hierarchically captures self-looped graph information and learns geometric-invariant features for polygon shape classification.<n>Our findings indicate that PolyMP and PolyMP-DSC effectively capture expressive geometric features that remain invariant under common transformations.
• Score: 3.804240190982697
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Geometric shape classification of vector polygons remains a challenging task in spatial analysis. Previous studies have primarily focused on deep learning approaches for rasterized vector polygons, while the study of discrete polygon representations and corresponding learning methods remains underexplored. In this study, we investigate a graph-based representation of vector polygons and propose a simple graph message-passing framework, PolyMP, along with its densely self-connected variant, PolyMP-DSC, to learn more expressive and robust latent representations of polygons. This framework hierarchically captures self-looped graph information and learns geometric-invariant features for polygon shape classification. Through extensive experiments, we demonstrate that combining a permutation-invariant graph message-passing neural network with a densely self-connected mechanism achieves robust performance on benchmark datasets, including synthetic glyphs and real-world building footprints, outperforming several baseline methods. Our findings indicate that PolyMP and PolyMP-DSC effectively capture expressive geometric features that remain invariant under common transformations, such as translation, rotation, scaling, and shearing, while also being robust to trivial vertex removals. Furthermore, we highlight the strong generalization ability of the proposed approach, enabling the transfer of learned geometric features from synthetic glyph polygons to real-world building footprints.

Related papers

• Multi-Point Proximity Encoding For Vector-Mode Geospatial Machine Learning [0.0]
  This paper presents an encoding method based on scaled distances from a shape to a set of reference points within a region of interest.<n>The method, MultiPoint (MPP) encoding, can be applied to any type of shape, enabling the parameterization of machine learning models with encoded representations of vector-mode features.
  arXiv  Detail & Related papers  (2025-06-05T13:22:47Z)
• Global Collinearity-aware Polygonizer for Polygonal Building Mapping in Remote Sensing [18.151134198549574]
  This paper addresses the challenge of mapping polygonal buildings from remote sensing images.<n>It introduces a novel algorithm, the Global Collinearity-aware Polygonizer (GCP)
  arXiv  Detail & Related papers  (2025-05-02T16:49:07Z)
• PolyhedronNet: Representation Learning for Polyhedra with Surface-attributed Graph [4.734024733136093]
  PolyhedronNet is a general framework tailored for learning representations of 3D polyhedral objects. Our experiments substantiate PolyhedronNet's efficacy in capturing comprehensive and informative representations of 3D polyhedral objects.
  arXiv  Detail & Related papers  (2025-02-03T20:45:19Z)
• Geometry Distributions [51.4061133324376]
  We propose a novel geometric data representation that models geometry as distributions. Our approach uses diffusion models with a novel network architecture to learn surface point distributions. We evaluate our representation qualitatively and quantitatively across various object types, demonstrating its effectiveness in achieving high geometric fidelity.
  arXiv  Detail & Related papers  (2024-11-25T04:06:48Z)
• SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes [61.110517195874074]
  We present a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network. Our key innovation is to define a continuous latent connectivity space at each mesh, which implies the discrete mesh. In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.
  arXiv  Detail & Related papers  (2024-09-30T17:59:03Z)
• PolygonGNN: Representation Learning for Polygonal Geometries with Heterogeneous Visibility Graph [8.971120205703887]
  We introduce a framework specifically designed for learning representations of polygonal geometries, particularly multipolygons. To enhance computational efficiency and minimize graph redundancy, we implement a heterogeneous spanning tree sampling method. We also introduce Multipolygon-GNN, a novel model tailored to leverage the spatial and semantic heterogeneity inherent in the visibility graph.
  arXiv  Detail & Related papers  (2024-06-30T16:07:49Z)
• A Survey of Geometric Graph Neural Networks: Data Structures, Models and Applications [67.33002207179923]
  This paper presents a survey of data structures, models, and applications related to geometric GNNs. We provide a unified view of existing models from the geometric message passing perspective. We also summarize the applications as well as the related datasets to facilitate later research for methodology development and experimental evaluation.
  arXiv  Detail & Related papers  (2024-03-01T12:13:04Z)
• Simplicial Representation Learning with Neural $k$-Forms [14.566552361705499]
  This paper focuses on leveraging geometric information from simplicial complexes embedded in $mathbbRn$ using node coordinates. We use differential k-forms in mathbbRn to create representations of simplices, offering interpretability and geometric consistency without message passing. Our method is efficient, versatile, and applicable to various input complexes, including graphs, simplicial complexes, and cell complexes.
  arXiv  Detail & Related papers  (2023-12-13T21:03:39Z)
• PolyGNN: Polyhedron-based Graph Neural Network for 3D Building Reconstruction from Point Clouds [22.18061879431175]
  PolyGNN is a graph neural network for building reconstruction point clouds. It learns to assemble primitives obtained by polyhedral decomposition. We conduct a transferability analysis across cities and on real-world point clouds.
  arXiv  Detail & Related papers  (2023-07-17T16:52:25Z)
• Geo-SIC: Learning Deformable Geometric Shapes in Deep Image Classifiers [8.781861951759948]
  This paper presents Geo-SIC, the first deep learning model to learn deformable shapes in a deformation space for an improved performance of image classification. We introduce a newly designed framework that (i) simultaneously derives features from both image and latent shape spaces with large intra-class variations. We develop a boosted classification network, equipped with an unsupervised learning of geometric shape representations.
  arXiv  Detail & Related papers  (2022-10-25T01:55:17Z)
• Towards General-Purpose Representation Learning of Polygonal Geometries [62.34832826705641]
  We develop a general-purpose polygon encoding model, which can encode a polygonal geometry into an embedding space. We conduct experiments on two tasks: 1) shape classification based on MNIST; 2) spatial relation prediction based on two new datasets - DBSR-46K and DBSR-cplx46K. Our results show that NUFTspec and ResNet1D outperform multiple existing baselines with significant margins.
  arXiv  Detail & Related papers  (2022-09-29T15:59:23Z)
• PolyWorld: Polygonal Building Extraction with Graph Neural Networks in Satellite Images [10.661430927191205]
  This paper introduces PolyWorld, a neural network that directly extracts building vertices from an image and connects them correctly to create precise polygons. PolyWorld significantly outperforms the state-of-the-art in building polygonization.
  arXiv  Detail & Related papers  (2021-11-30T15:23:17Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• PolyNet: Polynomial Neural Network for 3D Shape Recognition with PolyShape Representation [51.147664305955495]
  3D shape representation and its processing have substantial effects on 3D shape recognition. We propose a deep neural network-based method (PolyNet) and a specific polygon representation (PolyShape) Our experiments demonstrate the strength and the advantages of PolyNet on both 3D shape classification and retrieval tasks.
  arXiv  Detail & Related papers  (2021-10-15T06:45:59Z)
• 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)

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.