Please use this identifier to cite or link to this item: https://oar.tib.eu/jspui/handle/123456789/4454
Files in This Item:
File SizeFormat 
TechReport-2-2011.pdf5,03 MBAdobe PDFView/Open
Title: Efficient retrieval of 3D building models using embeddings of attributed subgraphs
Authors: Wessel, R.Ochmann, S.Vock, R.Blümel, InaKlein, R.
Issue Date: 2011
Published in: Computer graphics technical report : CG, Volume 2011,2, ISSN 1610-8892
Publisher: Institut für Informatik II, Universität Bonn
Abstract: We present a novel method for retrieval and classification of 3D building models that is tailored to the specific requirements of architects. In contrast to common approaches our algorithm relies on the interior spatial arrangement of rooms instead of exterior geometric shape. We first represent the internal topological building structure by a Room Connectivity Graph (RCG). Each room is characterized by a node. Connections between rooms like e.g. doors are represented by edges. Nodes and edges are additionally assigned attributes reflecting room and edge properties like e.g area or window size. To enable fast and efficient retrieval and classification with RCGs, we transform the structured graph representation into a vector-based one. We first decompose the RCG into a set of subgraphs. For each subgraph, we compute the similarity to a set of codebook graphs. Aggregating all similarity values finally provides us with a single vector for each RCG which enables fast retrieval and classification. For evaluation, we introduce a classification scheme that was carefully developed following common guidelines in architecture.We finally provide comprehensive experiments showing that the introduced subgraph embeddings yield superior performance compared to state-of-the-art graph retrieval approaches.
DDC: 004
License: This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.
Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.
Appears in Collections:Informatik



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.