Road Map Inference: A Segmentation and Grouping Framework
AbstractWe propose a new segmentation and grouping framework for road map inference from GPS traces. We first present a progressive Density-Based Spatial Clustering of Application with Noise (DBSCAN) algorithm with an orientation constraint to partition the whole point set of the traces into clusters that represent road segments. A new point cluster grouping algorithm, according to the topological relationship and spatial proximity of the point clusters to recover the road network, is then developed. After generating the point clusters, the robust Locally-Weighted Scatterplot Smooth (Lowess) method is used to extract their centerlines. We then propose to build the topological relationship of the centerlines by a Hidden Markov Model (HMM)-based map matching algorithm; and to assess whether the spatial proximity between point clusters by assuming the distances from the points to the centerline comply with a Gaussian distribution. Finally, the point clusters are grouped according to their topological relationship and spatial proximity to form strokes for recovering the road map. Experimental results show that our algorithm is robust to noise and varied sampling rates. The generated road maps show high geometric accuracy. View Full-Text
Share & Cite This Article
Qiu, J.; Wang, R. Road Map Inference: A Segmentation and Grouping Framework. ISPRS Int. J. Geo-Inf. 2016, 5, 130.
Qiu J, Wang R. Road Map Inference: A Segmentation and Grouping Framework. ISPRS International Journal of Geo-Information. 2016; 5(8):130.Chicago/Turabian Style
Qiu, Jia; Wang, Ruisheng. 2016. "Road Map Inference: A Segmentation and Grouping Framework." ISPRS Int. J. Geo-Inf. 5, no. 8: 130.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.