paper-with-me

Papers

AutoEncoding Tree for City Generation and Applications

2023-09-27 · Wenyu Han, Congcong Wen, Lazarus Chok, Yan Liang Tan, Sheung Lung Chan, Hang Zhao, Chen Feng

City modeling and generation have attracted an increased interest in various applications, including gaming, urban planning, and autonomous driving. Unlike previous works focused on the generation of single objects or indoor scenes, the huge volumes of spatial data in cities pose a challenge to the generative models. Furthermore, few publicly available 3D real-world city datasets also hinder the development of methods for city generation. In this paper, we first collect over 3,000,000 geo-referenced objects for the city of New York, Zurich, Tokyo, Berlin, Boston and several other large cities. Based on this dataset, we propose AETree, a tree-structured auto-encoder neural network, for city generation. Specifically, we first propose a novel Spatial-Geometric Distance (SGD) metric to measure the similarity between building layouts and then construct a binary tree over the raw geometric data of building based on the SGD metric. Next, we present a tree-structured network whose encoder learns to extract and merge spatial information from bottom-up iteratively. The resulting global representation is reversely decoded for reconstruction or generation. To address the issue of long-dependency as the level of the tree increases, a Long Short-Term Memory (LSTM) Cell is employed as a basic network element of the proposed AETree. Moreover, we introduce a novel metric, Overlapping Area Ratio (OAR), to quantitatively evaluate the generation results. Experiments on the collected dataset demonstrate the effectiveness of the proposed model on 2D and 3D city generation. Furthermore, the latent features learned by AETree can serve downstream urban planning applications.

📄 PDF Abstract BibTeX arXiv:2309.15941

Code (0)

등록된 구현이 없습니다.

Tasks

Autonomous Driving

Methods 이 논문이 사용한 방법론

SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

Tree Echo State Autoencoders with Grammars

2020-04-19 · Benjamin Paassen, Irena Koprinska, Kalina Yacef

Tree data occurs in many forms, such as computer programs, chemical molecules, or natural language. Unfortunately, the non-vectorial and discrete nature of trees makes it challenging to construct functions with tree-form…

Time SeriesTime Series AnalysisTime Series Prediction

Recursive Tree Grammar Autoencoders

2020-12-03 · Benjamin Paassen, Irena Koprinska, Kalina Yacef

Machine learning on trees has been mostly focused on trees as input to algorithms. Much less research has investigated trees as output, which has many applications, such as molecule optimization for drug discovery, or hi…

DecoderDrug DiscoveryHint GenerationTime Series+2

Semi-supervised Autoencoding Projective Dependency Parsing

2020-11-02 · COLING 2020 8 · Xiao Zhang, Dan Goldwasser

We describe two end-to-end autoencoding models for semi-supervised graph-based projective dependency parsing. The first model is a Locally Autoencoding Parser (LAP) encoding the input using continuous latent variables in…

DecoderDependency Parsing

Coconditional Autoencoding Adversarial Networks for Chinese Font Feature Learning

2018-12-11 · Zhizhan Zheng, Feiyun Zhang

In this work, we propose a novel framework named Coconditional Autoencoding Adversarial Networks (CocoAAN) for Chinese font learning, which jointly learns a generation network and two encoding networks of different featu…

Autoencoding Random Forests

2025-05-27 · Binh Duc Vu, Jan Kapar, Marvin Wright, David S. Watson

We propose a principled method for autoencoding with random forests. Our strategy builds on foundational results from nonparametric statistics and spectral graph theory to learn a low-dimensional embedding of the model t…

Denoising