Graph-Based Generative Representation Learning of Semantically and Behaviorally Augmented Floorplans

• URL: http://arxiv.org/abs/2012.04735v1
• Date: Tue, 8 Dec 2020 20:51:56 GMT
• Title: Graph-Based Generative Representation Learning of Semantically and Behaviorally Augmented Floorplans
• Authors: Vahid Azizi, Muhammad Usman, Honglu Zhou, Petros Faloutsos and Mubbasir Kapadia
• Abstract summary: We present a floorplan embedding technique that uses an attributed graph to represent the geometric information as well as design semantics and behavioral features of the inhabitants as node and edge attributes. A Long Short-Term Memory (LSTM) Variational Autoencoder (VAE) architecture is proposed and trained to embed attributed graphs as vectors in a continuous space. A user study is conducted to evaluate the coupling of similar floorplans retrieved from the embedding space with respect to a given input.
• Score: 12.488287536032747
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Floorplans are commonly used to represent the layout of buildings. In computer aided-design (CAD) floorplans are usually represented in the form of hierarchical graph structures. Research works towards computational techniques that facilitate the design process, such as automated analysis and optimization, often use simple floorplan representations that ignore the semantics of the space and do not take into account usage related analytics. We present a floorplan embedding technique that uses an attributed graph to represent the geometric information as well as design semantics and behavioral features of the inhabitants as node and edge attributes. A Long Short-Term Memory (LSTM) Variational Autoencoder (VAE) architecture is proposed and trained to embed attributed graphs as vectors in a continuous space. A user study is conducted to evaluate the coupling of similar floorplans retrieved from the embedding space with respect to a given input (e.g., design layout). The qualitative, quantitative and user-study evaluations show that our embedding framework produces meaningful and accurate vector representations for floorplans. In addition, our proposed model is a generative model. We studied and showcased its effectiveness for generating new floorplans. We also release the dataset that we have constructed and which, for each floorplan, includes the design semantics attributes as well as simulation generated human behavioral features for further study in the community.

Related papers

• SE-VGAE: Unsupervised Disentangled Representation Learning for Interpretable Architectural Layout Design Graph Generation [0.0]
  We introduce an unsupervised disentangled representation learning framework, Style-based Edge-augmented Variational Graph Auto-Encoder. The framework generates architectural layout in the form of attributed adjacency multi-graphs while prioritizing representation disentanglement. We contribute a new benchmark large-scale architectural layout graph dataset extracted from real-world floor plan images.
  arXiv  Detail & Related papers  (2024-06-25T09:40:47Z)
• Implicitly Guided Design with PropEn: Match your Data to Follow the Gradient [52.2669490431145]
  PropEn is inspired by'matching', which enables implicit guidance without training a discriminator. We show that training with a matched dataset approximates the gradient of the property of interest while remaining within the data distribution.
  arXiv  Detail & Related papers  (2024-05-28T11:30:19Z)
• SSIG: A Visually-Guided Graph Edit Distance for Floor Plan Similarity [11.09257948735229]
  We propose a simple yet effective metric that measures structural similarity between visual instances of architectural floor plans. In this paper, an effective evaluation metric for judging the structural similarity of floor plans, coined S SIG, is proposed based on both image and graph distances.
  arXiv  Detail & Related papers  (2023-09-08T14:28:28Z)
• Bures-Wasserstein Means of Graphs [60.42414991820453]
  We propose a novel framework for defining a graph mean via embeddings in the space of smooth graph signal distributions. By finding a mean in this embedding space, we can recover a mean graph that preserves structural information. We establish the existence and uniqueness of the novel graph mean, and provide an iterative algorithm for computing it.
  arXiv  Detail & Related papers  (2023-05-31T11:04:53Z)
• Generating Topological Structure of Floorplans from Room Attributes [4.1715767752637145]
  We propose to extract topological information from room attributes using Iterative and adaptive graph Topology Learning (ITL) ITL progressively predicts multiple relations between rooms; at each iteration, it improves node embeddings, which in turn facilitates generation of a better topological graph structure.
  arXiv  Detail & Related papers  (2022-04-26T14:24:58Z)
• Learning Models as Functionals of Signed-Distance Fields for Manipulation Planning [51.74463056899926]
  This work proposes an optimization-based manipulation planning framework where the objectives are learned functionals of signed-distance fields that represent objects in the scene. We show that representing objects as signed-distance fields not only enables to learn and represent a variety of models with higher accuracy compared to point-cloud and occupancy measure representations.
  arXiv  Detail & Related papers  (2021-10-02T12:36:58Z)
• Hermitian Symmetric Spaces for Graph Embeddings [0.0]
  We learn continuous representations of graphs in spaces of symmetric matrices over C. These spaces offer a rich geometry that simultaneously admits hyperbolic and Euclidean subspaces. The proposed models are able to automatically adapt to very dissimilar arrangements without any apriori estimates of graph features.
  arXiv  Detail & Related papers  (2021-05-11T18:14:52Z)
• Build2Vec: Building Representation in Vector Space [0.0]
  We represent a methodology of a graph embeddings algorithm that is used to transform labeled property graphs. We used node2Vec with biased random walks to extract semantic similarities between different building components. A case study implementation is conducted on a net-zero-energy building located at the National University of Singapore.
  arXiv  Detail & Related papers  (2020-07-01T20:39:39Z)
• Spatial Pyramid Based Graph Reasoning for Semantic Segmentation [67.47159595239798]
  We apply graph convolution into the semantic segmentation task and propose an improved Laplacian. The graph reasoning is directly performed in the original feature space organized as a spatial pyramid. We achieve comparable performance with advantages in computational and memory overhead.
  arXiv  Detail & Related papers  (2020-03-23T12:28:07Z)
• House-GAN: Relational Generative Adversarial Networks for Graph-constrained House Layout Generation [59.86153321871127]
  The main idea is to encode the constraint into the graph structure of its relational networks. We have demonstrated the proposed architecture for a new house layout generation problem.
  arXiv  Detail & Related papers  (2020-03-16T03:16:12Z)
• Hallucinative Topological Memory for Zero-Shot Visual Planning [86.20780756832502]
  In visual planning (VP), an agent learns to plan goal-directed behavior from observations of a dynamical system obtained offline. Most previous works on VP approached the problem by planning in a learned latent space, resulting in low-quality visual plans. Here, we propose a simple VP method that plans directly in image space and displays competitive performance.
  arXiv  Detail & Related papers  (2020-02-27T18:54:42Z)

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.