2006
DOI: 10.1016/j.knosys.2006.05.008
|View full text |Cite
|
Sign up to set email alerts
|

Automatic vectorization of segmented road networks by geometrical and topological analysis of high resolution binary images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(15 citation statements)
references
References 15 publications
0
15
0
Order By: Relevance
“…Since every concavity of B causes one polyline, discarding those road segments which exhibit a suspicious geometric appearance (too short, too broad, etc.) and at the same time do not contribute to the topological functionality of the road net has been proposed in the literature (Mena, 2006;Bulatov et al, 2016b). Thus, the iterative filtering procedure is based on polyline attributes, such as width, length, type, etc., which are calculated according to Bulatov et al (2016a).…”
Section: Vectorization and Extraction Of Road Polylinesmentioning
confidence: 94%
See 1 more Smart Citation
“…Since every concavity of B causes one polyline, discarding those road segments which exhibit a suspicious geometric appearance (too short, too broad, etc.) and at the same time do not contribute to the topological functionality of the road net has been proposed in the literature (Mena, 2006;Bulatov et al, 2016b). Thus, the iterative filtering procedure is based on polyline attributes, such as width, length, type, etc., which are calculated according to Bulatov et al (2016a).…”
Section: Vectorization and Extraction Of Road Polylinesmentioning
confidence: 94%
“…There are several contributions related to generalization of road networks but for most of them, Chaudhry and Mackaness (2006) for example, data noise is not a significant problem. Our work is more similar to (Bulatov et al, 2016b;Mena, 2006), where segments are extracted from the actual sensor data and finally generalized either by the well-known algorithm of Douglas and Peucker (1973) or by higher order, e. g., Bézier curves. Both modules (Douglas-Peucker and Bézier curves) were modified in the way that the polygonal chains do not cross obstacles, such as buildings and trees.…”
Section: Introduction and Previous Workmentioning
confidence: 99%
“…Morphological operators are employed as a postprocessing step to smooth the contour of detected line features [195]. Morphological operators [73,75,79,115,116,120,121,126,128,146,148,196,198,199] [132] [124,125,142,144,200] Remote Sens. 2016, 8, 689…”
Section: Postprocessingmentioning
confidence: 99%
“…Here, not only some training data, but also a better classification of pixels should improve the situation significantly. Finally, we mention skeletonization and medial-axis-based methods as in (Gerke and Heipke, 2008, Mena, 2006, Miao et al, 2013 where fitting of a smooth curve is aimed, and (Noris et al, 2013), where minimal spanning trees of points near the centerline are analyzed; these points on the centerlines are obtained by clustering of salient (e.g. with respect to their gradient) pixels.…”
Section: Introduction and Related Workmentioning
confidence: 99%
“…with respect to their gradient) pixels. In (Mena, 2006), starting from the binary image R representing road pixels, the road centerlines are supposed to have the same distance to at least two points of R. This method is very sensitive to the classification results. Every concavity in R leads first to short, superfluous segments and, additionally, to zigzag-like, improbable street courses.…”
Section: Introduction and Related Workmentioning
confidence: 99%