Efficient retrieval of 3D building models using embeddings of attributed subgraphs

Authors:
Raoul Wessel;Sebastian Ochmann;Richard Vock;Ina Blümel;Reinhard Klein
Affiliations:
University of Bonn, Bonn, Germany;University of Bonn, Bonn, Germany;University of Bonn, Bonn, Germany;German National Library of Science and Technology Hannover, Hannover, Germany;University of Bonn, Bonn, Germany
Venue:
Proceedings of the 20th ACM international conference on Information and knowledge management
Year:
2011

Citing 7
Cited 0

The Logic of Architecture: Design, Computation, and Cognition

The Logic of Architecture: Design, Computation, and Cognition
Sampling from large graphs

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximate graph edit distance computation by means of bipartite graph matching

Image and Vision Computing
Comparing stars: on approximating graph edit distance

Proceedings of the VLDB Endowment
Graph classification by means of Lipschitz embedding

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Image Classification Using Subgraph Histogram Representation

ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Using bags of symbols for automatic indexing of graphical document image databases

GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives

Quantified Score

Hi-index	0.01

Visualization

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). To enable fast and efficient retrieval and classification with RCGs, we transform the structured graph representation into a vector-based one by introducing a new concept of subgraph embeddings. We provide comprehensive experiments showing that the introduced subgraph embeddings yield superior performance compared to state-of-the-art graph retrieval approaches.