2012
DOI: 10.1007/978-3-642-33090-2_7
|View full text |Cite
|
Sign up to set email alerts
|

Constructing Street Networks from GPS Trajectories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
135
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 99 publications
(136 citation statements)
references
References 8 publications
1
135
0
Order By: Relevance
“…Based on the experimental tests, the radius of the neighbourhood in the trajectory contraction was 30 m, and the thresholds for the segment growth process were 15 • and a distance of 30 m. For comparison and evaluation, the road inference methods of Davies [22] and Ahmed [18] were used to extract intersections from the same datasets. These two open source algorithms are implemented in Python and Java and retain the original default parameter settings over the experiments.…”
Section: Comparison and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Based on the experimental tests, the radius of the neighbourhood in the trajectory contraction was 30 m, and the thresholds for the segment growth process were 15 • and a distance of 30 m. For comparison and evaluation, the road inference methods of Davies [22] and Ahmed [18] were used to extract intersections from the same datasets. These two open source algorithms are implemented in Python and Java and retain the original default parameter settings over the experiments.…”
Section: Comparison and Discussionmentioning
confidence: 99%
“…Fathi et al [17] developed a classifier that was trained using shape descriptors from two temporally adjacent GPS points from the same vehicle to extract road intersections. Ahmed et al [18] reconstructed intersections by utilizing sets of vertices within bounded regions (vertex regions), with regions bounded by the minimum incident angle of the streets at that intersection. Based on sparse GPS trace points, Wu et al [19] converged low-quality raw points using Kernel Density Estimation (KDE) to identify cluster centres as intersection points.…”
Section: Related Workmentioning
confidence: 99%
“…The clarified track points were incrementally added to the empty road map or merged based on their distance and heading. This incremental manner of constructing a road map from scratch has been continuously improved; using a curve-graph matching distance measure and minimum-link representative edge, Ahmed et al [17] proposed a map construction method with theoretical error estimation.…”
Section: Related Workmentioning
confidence: 99%
“…A vast body of literature addressing the problem of road map construction from vehicle tracking data currently exists [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20], which can be divided into two categories in terms of the form of data input, offline and online algorithms. These methods take a full collection or a continuous stream of data as input, respectively, which will be detailed in the following section.…”
Section: Introductionmentioning
confidence: 99%
“…2017, 6, 400 3 of 15 for generating road networks have been proposed in recent years [16,17]. In general, these methods can be organized into three categories [18]: (1) point clustering [19][20][21], which assumes that the input raw data consist of a set of points that are then clustered in various ways (such as by the k-means algorithm) to obtain street segments that are finally connected to form a road network; (2) incremental track insertion [10,[22][23][24][25][26], which constructs a road network by incrementally inserting trajectory data into an initially empty graph; and (3) intersection linking [27][28][29], in which the intersection vertices of the road network are first detected and then linked together by recognizing suitable road segments. Some of the representative algorithms of each category are listed in Table 1.…”
Section: Literature Reviewmentioning
confidence: 99%