Abstract
A significant amount of research in robotics is aimed towards building robots that operate indoors yet there exists little analysis of how human spaces are organized. In this work we analyze the properties of indoor environments from a large annotated floorplan dataset. We analyze a corpus of 567 floors, 6426 spaces with 91 room types and 8446 connections between rooms corresponding to real places. We present a system that, given a partial graph, predicts the rest of the topology by building a model from this dataset. Our hypothesis is that indoor topologies consists of multiple smaller functional parts. We demonstrate the applicability of our approach with experimental results. We expect that our analysis paves the way for more data driven research on indoor environments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pronobis, A., Luo, J., Caputo, B.: The more you learn, the less you store: Memory-controlled incremental SVM for visual place recognition. Image and Vision Computing, IMAVIS (March 2010), http://www.pronobis.pro/publications/pronobis2010imavis , doi:10.1016/j.imavis.2010.01.015
Ranganathan, A.: Pliss: Detecting and labeling places using online change-point detection. In: Proceedings of Robotics: Science and Systems, Zaragoza, Spain (June 2010)
Mozos, O., Stachniss, C., Rottmann, A., Burgard, W.: Using AdaBoost for place labeling and topological map building. In: Thrun, S., Brooks, R., Durrant-Whyte, H. (eds.) Robotics Research, vol. 28, pp. 453–472. Springer, Heidelberg (2007) ISBN 978-3-540-48110-2
Whiting, E., Battat, J., Teller, S.: Topology of urban environments. In: Proc. of the Computer-Aided Architectural Design Futures (CAADFutures), Sydney, Australia, pp. 115–128 (July 2007)
Valiente, G.: Efficient algorithms on trees and graphs with unique node labels. In: Applied Graph Theory in Computer Vision and Pattern Recognition, pp. 137–149 (2007)
Bunke, H., Allermann, C.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 245–253 (1983)
Ke, Y., Cheng, J., Yu, J.X.: Efficient discovery of frequent correlated subgraph pairs. In: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, ICDM 2009, pp. 239–248. IEEE Computer Society, Washington, DC (2009)
Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002, p. 721. IEEE Computer Society, Washington, DC (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aydemir, A., Järleberg, E., Prentice, S., Jensfelt, P. (2012). Predicting What Lies Ahead in the Topology of Indoor Environments. In: Stachniss, C., Schill, K., Uttal, D. (eds) Spatial Cognition VIII. Spatial Cognition 2012. Lecture Notes in Computer Science(), vol 7463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32732-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-32732-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32731-5
Online ISBN: 978-3-642-32732-2
eBook Packages: Computer ScienceComputer Science (R0)