In this paper we present an algorithm for automatic street graph construction of hand-drawn sketch maps. This detection is important for a subsequent graph matching in order to align the sketch map with another map. Our algorithm detects a number of street candidates and selects street lines by rating the candidates and their neighbors in the street candidate graph. To evaluate this approach, we manually generated a ground truth for some maps and conducted a preliminary quantitative performance study. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Broelemann, K., Jiang, X., & Schwering, A. (2011). Automatic street graph construction in sketch maps. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6658 LNCS, 275–284. https://doi.org/10.1007/978-3-642-20844-7_28
Mendeley helps you to discover research relevant for your work.