FoldingNet Autoencoder model to create a geospatial grouping of CityGML building dataset

• URL: http://arxiv.org/abs/2212.13965v2
• Date: Mon, 9 Oct 2023 18:57:35 GMT
• Title: FoldingNet Autoencoder model to create a geospatial grouping of CityGML building dataset
• Authors: Deepank Verma, Olaf Mumm, Vanessa Miriam Carlow
• Abstract summary: This study uses 'FoldingNet,' a 3D autoencoder, to generate the latent representation of each building from the LoD 2 CityGML dataset. The efficacy of the embeddings is analyzed by dataset reconstruction, latent spread visualization, and hierarchical clustering methods. A geospatial model is created to iteratively find the geographical groupings of buildings.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Explainable numerical representations or latent information of otherwise complex datasets are more convenient to analyze and study. These representations assist in identifying clusters and outliers, assess similar data points, and explore and interpolate data. Dataset of three-dimensional (3D) building models possesses inherent complexity in various footprint shapes, distinct roof types, walls, height, and volume. Traditionally, grouping similar buildings or 3D shapes requires matching their known properties and shape metrics with each other. However, this requires obtaining a plethora of such properties to calculate similarity. This study, in contrast, utilizes an autoencoder to compute the shape information in a fixed-size vector form that can be compared and grouped with the help of distance metrics. The study uses 'FoldingNet,' a 3D autoencoder, to generate the latent representation of each building from the obtained LoD 2 CityGML dataset. The efficacy of the embeddings obtained from the autoencoder is further analyzed by dataset reconstruction, latent spread visualization, and hierarchical clustering methods. While the clusters give an overall perspective of the type of build forms, they do not include geospatial information in the clustering. A geospatial model is therefore created to iteratively find the geographical groupings of buildings using cosine similarity approaches in embedding vectors. The German federal states of Brandenburg and Berlin are taken as an example to test the methodology. The output provides a detailed overview of the build forms in the form of semantic topological clusters and geographical groupings. This approach is beneficial and scalable for complex analytics, e.g., in large urban simulations, urban morphological studies, energy analysis, or evaluations of building stock.

Related papers

• ClusterGraph: a new tool for visualization and compression of multidimensional data [0.0]
  This paper provides an additional layer on the output of any clustering algorithm. It provides information about the global layout of clusters, obtained from the considered clustering algorithm.
  arXiv  Detail & Related papers  (2024-11-08T09:40:54Z)
• (Deep) Generative Geodesics [57.635187092922976]
  We introduce a newian metric to assess the similarity between any two data points. Our metric leads to the conceptual definition of generative distances and generative geodesics. Their approximations are proven to converge to their true values under mild conditions.
  arXiv  Detail & Related papers  (2024-07-15T21:14:02Z)
• Hierarchical clustering with dot products recovers hidden tree structure [53.68551192799585]
  In this paper we offer a new perspective on the well established agglomerative clustering algorithm, focusing on recovery of hierarchical structure. We recommend a simple variant of the standard algorithm, in which clusters are merged by maximum average dot product and not, for example, by minimum distance or within-cluster variance. We demonstrate that the tree output by this algorithm provides a bona fide estimate of generative hierarchical structure in data, under a generic probabilistic graphical model.
  arXiv  Detail & Related papers  (2023-05-24T11:05:12Z)
• T1: Scaling Diffusion Probabilistic Fields to High-Resolution on Unified Visual Modalities [69.16656086708291]
  Diffusion Probabilistic Field (DPF) models the distribution of continuous functions defined over metric spaces. We propose a new model comprising of a view-wise sampling algorithm to focus on local structure learning. The model can be scaled to generate high-resolution data while unifying multiple modalities.
  arXiv  Detail & Related papers  (2023-05-24T03:32:03Z)
• BuildingNet: Learning to Label 3D Buildings [19.641000866952815]
  BuildingNet: (a) large-scale 3D building models whose exteriors consistently labeled, (b) a neural network that labels building analyzing and structural relations of their geometric primitives. The dataset covers categories, such as houses, churches, skyscrapers, town halls and castles.
  arXiv  Detail & Related papers  (2021-10-11T01:45:26Z)
• Learning Feature Aggregation for Deep 3D Morphable Models [57.1266963015401]
  We propose an attention based module to learn mapping matrices for better feature aggregation across hierarchical levels. Our experiments show that through the end-to-end training of the mapping matrices, we achieve state-of-the-art results on a variety of 3D shape datasets.
  arXiv  Detail & Related papers  (2021-05-05T16:41:00Z)
• Joint Geometric and Topological Analysis of Hierarchical Datasets [7.098759778181621]
  In this paper, we focus on high-dimensional data that are organized into several hierarchical datasets. The main novelty in this work lies in the combination of two powerful data-analytic approaches: topological data analysis and geometric manifold learning. We show that our new method gives rise to superior classification results compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-04-03T13:02:00Z)
• BRepNet: A topological message passing system for solid models [6.214548392474976]
  Boundary representation (B-rep) models are the standard way 3D shapes are described in Computer-Aided Design (CAD) applications. We introduce BRepNet, a neural network architecture designed to operate directly on B-rep data structures.
  arXiv  Detail & Related papers  (2021-04-01T18:16:03Z)
• Mix Dimension in Poincar\'{e} Geometry for 3D Skeleton-based Action Recognition [57.98278794950759]
  Graph Convolutional Networks (GCNs) have already demonstrated their powerful ability to model the irregular data. We present a novel spatial-temporal GCN architecture which is defined via the Poincar'e geometry. We evaluate our method on two current largest scale 3D datasets.
  arXiv  Detail & Related papers  (2020-07-30T18:23:18Z)
• Shape-Oriented Convolution Neural Network for Point Cloud Analysis [59.405388577930616]
  Point cloud is a principal data structure adopted for 3D geometric information encoding. Shape-oriented message passing scheme dubbed ShapeConv is proposed to focus on the representation learning of the underlying shape formed by each local neighboring point.
  arXiv  Detail & Related papers  (2020-04-20T16:11:51Z)

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.