poster

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

Authors:

Sebastian Ochmann,

Reinhard KleinAuthors Info & Claims

CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management

Pages 2097 - 2100

https://doi.org/10.1145/2063576.2063899

Published: 24 October 2011 Publication History

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.

References

[1]

E. Barbu, P. Héroux, S. Adam, and É. Trupin. Using bags of symbols for automatic indexing of graphical document image databases. In Graphics Recognition (GREC), pages 195--205, 2005.

Digital Library

[2]

K. M. Borgwardt. Graph Kernels. PhD thesis, Ludwig-Maximilians-University Munich, 2007.

[3]

C.-C. Chang and C.-J. Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/ cjlin/libsvm.

[4]

T. Gärtner. Kernels for Structured Data. PhD thesis, Universität Bonn, 2005.

[5]

D. Haussler. Convolution kernels on discrete structures. Technical Report UCS-CRL-99-10, University of California at Santa Cruz, 1999.

[6]

J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proceedings of the 12th ACM SIGKDD, pages 631--636, New York, NY, USA, 2006. ACM.

Digital Library

[7]

W. Meyer-Bohe. Grundrisse öffentlicher Gebäude. Synoptische Gebäudetypologie. Ernst & Sohn, 1997.

[8]

W. J. Mitchell. The Logic of Architecture: Design, Computation, and Cognition. MIT Press, Cambridge, MA, USA, 1st edition, 1990.

Digital Library

[9]

B. Özdemir and S. Aksoy. Image classification using subgraph histogram representation. In Proceedings of ICPR '10, pages 1112--1115, 2010.

Digital Library

[10]

K. Riesen and H. Bunke. Approximate graph edit distance computation by means of bipartite graph matching. Img. and Vis. Comp., 27(7):950--959, 2009.

Digital Library

[11]

K. Riesen and H. Bunke. Graph classification by means of lipschitz embedding. IEEE SMC Part B, 39:1472--1483, December 2009.

Digital Library

[12]

A. Sanfeliu and K. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE SMC, 13:353--362, 1983.

[13]

F. Schneider. Floor Plan Manual Housing. Birkhäuser, third edition, April 2004.

[14]

R. Wessel, I. Blümel, and R. Klein. The room connectivity graph. In Proceedings of WSCG 2008, Feb. 2008.

[15]

R. Wessel, S. Ochmann, R. Vock, I. Blümel, and R. Klein. Efficient retrieval of 3d building models using embeddings of attributed subgraphs. Technical Report CG-2011-2, University of Bonn, Aug. 2011.

Digital Library

[16]

Z. Zeng, A. K. H. Tung, J. Wang, J. Feng, and L. Zhou. Comparing stars. Proceedings of the VLDB Endowment, 2:25--36, August 2009.

Digital Library

Cited By

Lu XLi HXu YLiu JChen Z(2024)Measuring the similarity between shapes of buildings using graph edit distanceInternational Journal of Digital Earth10.1080/17538947.2024.231074917:1Online publication date: Feb-2024
https://doi.org/10.1080/17538947.2024.2310749
Kim J(2022)Efficient Top-k Graph Similarity Search With GED ConstraintsIEEE Access10.1109/ACCESS.2022.319455910(79180-79191)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3194559
Lee PStenger B(2021)Shape-Based Floor Plan Retrieval Using Parse Tree Matching2021 17th International Conference on Machine Vision and Applications (MVA)10.23919/MVA51890.2021.9511363(1-5)Online publication date: 25-Jul-2021
https://doi.org/10.23919/MVA51890.2021.9511363
Show More Cited By

Index Terms

Efficient retrieval of 3D building models using embeddings of attributed subgraphs
1. Information systems
  1. Information retrieval
    1. Document representation

Recommendations

Forbidden Subgraphs and Weak Locally Connected Graphs

A graph is called H-free if it has no induced subgraph isomorphic to H. A graph is called $$N^i$$Ni-locally connected if $$G[\{ x\in V(G): 1\le d_G(w, x)\le i\}]$$G[{x?V(G):1≤dG(w,x)≤i}] is connected and $$N_2$$N2-locally connected if $$G[\{uv: \{uw, vw\...
Bipartite subgraphs of triangle-free subcubic graphs

Suppose G is a graph with n vertices and m edges. Let n^' be the maximum number of vertices in an induced bipartite subgraph of G and let m^' be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G)=m^'/m is called the bipartite ...
Factors and vertex-deleted subgraphs

A relationship is considered between an f-factor of a graph and that of its vertex-deleted subgraphs. Katerinis [Some results on the existence of 2n-factors in terms of vertex-deleted subgraphs, Ars Combin. 16 (1983) 271-277] proved that for even ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management

October 2011

2712 pages

ISBN:9781450307178

DOI:10.1145/2063576

Editors:
Bettina Berendt,
Arjen de Vries,
Wenfei Fan,
Craig Macdonald
University of Glasgow, UK
,
Iadh Ounis
University of Glasgow, UK
,
Ian Ruthven
University of Strathclyde, UK

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

CIKM '11

Sponsor:

CIKM '11: International Conference on Information and Knowledge Management

October 24 - 28, 2011

Glasgow, Scotland, UK

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
171
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lu XLi HXu YLiu JChen Z(2024)Measuring the similarity between shapes of buildings using graph edit distanceInternational Journal of Digital Earth10.1080/17538947.2024.231074917:1Online publication date: Feb-2024
https://doi.org/10.1080/17538947.2024.2310749
Kim J(2022)Efficient Top-k Graph Similarity Search With GED ConstraintsIEEE Access10.1109/ACCESS.2022.319455910(79180-79191)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3194559
Lee PStenger B(2021)Shape-Based Floor Plan Retrieval Using Parse Tree Matching2021 17th International Conference on Machine Vision and Applications (MVA)10.23919/MVA51890.2021.9511363(1-5)Online publication date: 25-Jul-2021
https://doi.org/10.23919/MVA51890.2021.9511363
Kim JLi GLi ZIdreos SSrivastava D(2021)Boosting Graph Similarity Search through Pre-ComputationProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452780(951-963)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3452780
Zhao SWang LQian XChen J(2021)Enhancing performance-based generative architectural design with sketch-based image retrieval: a pilot study on designing building facade fenestrationsThe Visual Computer10.1007/s00371-021-02170-x38:8(2981-2997)Online publication date: 11-Jun-2021
https://doi.org/10.1007/s00371-021-02170-x
Stauffer MTschachtli TFischer ARiesen K(2017)A Survey on Applications of Bipartite Graph Edit DistanceGraph-Based Representations in Pattern Recognition10.1007/978-3-319-58961-9_22(242-252)Online publication date: 10-May-2017
https://doi.org/10.1007/978-3-319-58961-9_22
Beetz JBlümel IDietze SFetahui BGadiraju UHecher MKrijnen TLindlar MTamke MWessel RYu R(2016)Enrichment and Preservation of Architectural Knowledge3D Research Challenges in Cultural Heritage II10.1007/978-3-319-47647-6_11(231-255)Online publication date: 2-Oct-2016
https://doi.org/10.1007/978-3-319-47647-6_11

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten