PolygonGNN: Representation Learning for Polygonal Geometries with Heterogeneous Visibility Graph

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Yu, Dazhou, Hu, Yuntong, Li, Yun, Zhao, Liang
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913783931207680
author Yu, Dazhou
Hu, Yuntong
Li, Yun
Zhao, Liang
author_facet Yu, Dazhou
Hu, Yuntong
Li, Yun
Zhao, Liang
contents Polygon representation learning is essential for diverse applications, encompassing tasks such as shape coding, building pattern classification, and geographic question answering. While recent years have seen considerable advancements in this field, much of the focus has been on single polygons, overlooking the intricate inner- and inter-polygonal relationships inherent in multipolygons. To address this gap, our study introduces a comprehensive framework specifically designed for learning representations of polygonal geometries, particularly multipolygons. Central to our approach is the incorporation of a heterogeneous visibility graph, which seamlessly integrates both inner- and inter-polygonal relationships. To enhance computational efficiency and minimize graph redundancy, we implement a heterogeneous spanning tree sampling method. Additionally, we devise a rotation-translation invariant geometric representation, ensuring broader applicability across diverse scenarios. Finally, we introduce Multipolygon-GNN, a novel model tailored to leverage the spatial and semantic heterogeneity inherent in the visibility graph. Experiments on five real-world and synthetic datasets demonstrate its ability to capture informative representations for polygonal geometries. Code and data are available at \href{https://github.com/dyu62/PolyGNN}{$github.com/dyu62/PolyGNN$}.
format Preprint
id arxiv_https___arxiv_org_abs_2407_00742
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle PolygonGNN: Representation Learning for Polygonal Geometries with Heterogeneous Visibility Graph
Yu, Dazhou
Hu, Yuntong
Li, Yun
Zhao, Liang
Computer Vision and Pattern Recognition
Machine Learning
Polygon representation learning is essential for diverse applications, encompassing tasks such as shape coding, building pattern classification, and geographic question answering. While recent years have seen considerable advancements in this field, much of the focus has been on single polygons, overlooking the intricate inner- and inter-polygonal relationships inherent in multipolygons. To address this gap, our study introduces a comprehensive framework specifically designed for learning representations of polygonal geometries, particularly multipolygons. Central to our approach is the incorporation of a heterogeneous visibility graph, which seamlessly integrates both inner- and inter-polygonal relationships. To enhance computational efficiency and minimize graph redundancy, we implement a heterogeneous spanning tree sampling method. Additionally, we devise a rotation-translation invariant geometric representation, ensuring broader applicability across diverse scenarios. Finally, we introduce Multipolygon-GNN, a novel model tailored to leverage the spatial and semantic heterogeneity inherent in the visibility graph. Experiments on five real-world and synthetic datasets demonstrate its ability to capture informative representations for polygonal geometries. Code and data are available at \href{https://github.com/dyu62/PolyGNN}{$github.com/dyu62/PolyGNN$}.
title PolygonGNN: Representation Learning for Polygonal Geometries with Heterogeneous Visibility Graph
topic Computer Vision and Pattern Recognition
Machine Learning
url https://arxiv.org/abs/2407.00742