<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>In order to achieve fast matching of global navigation satellite system (GNSS) track data and vector road network data, a rough-to-fine matching method combining distance proximity and buffer constraints is studied. The GNSS track data is preprocessed: A rasterisation method is used to eliminate the low-quality track data and obtain the binary graph; then, the road centrelines are obtained by a skeleton extraction method; the thinning data is converted into line segments or closed lines starting from nodes by the boundary tracking method, which is stored in the vector form. Finally, the boundary tracking method is used to convert the thinning data into closed lines and store them in the vector form. A two-layer rough-to-fine matching strategy is applied: First, the changing state of the road arc is determined according to the rough matching strategy of road segment distance. Next, according to the buffer constraint criterion, a rectangular or circular buffer is selected to achieve precise matching of road network data. The results show that the proposed method has good matching effect, which is especially suitable for working with more GNSS track data.</p>
</abstract>

In order to achieve fast matching of global navigation satellite system (GNSS) track data and vector road network data, a rough-to-fine matching method combining distance proximity and buffer constraints is studied. The GNSS track data is preprocessed: A rasterisation method is used to eliminate the low-quality track data and obtain the binary graph; then, the road centrelines are obtained by a skeleton extraction method; the thinning data is converted into line segments or closed lines starting from nodes by the boundary tracking method, which is stored in the vector form. Finally, the boundary tracking method is used to convert the thinning data into closed lines and store them in the vector form. A two-layer rough-to-fine matching strategy is applied: First, the changing state of the road arc is determined according to the rough matching strategy of road segment distance. Next, according to the buffer constraint criterion, a rectangular or circular buffer is selected to achieve precise matching of road network data. The results show that the proposed method has good matching effect, which is especially suitable for working with more GNSS track data.

Studying a matching method combining distance proximity and buffer constraints

Department of Data Science and Big Data Technology, School of Computer Science

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution 4.0 International License.

{"article-title":"Studying a matching method combining distance proximity and buffer constraints"}

In order to achieve fast matching of global navigation satellite system (GNSS) track data and vector road network data, a rough-to-fine matching method...

Studying a matching method combining distance proximity and buffer constraints

Publié en ligne: 05 sept. 2022

Pages: 2459 - 2466

Reçu: 23 mars 2022

Accepté: 06 mai 2022

DOI: https://doi.org/10.2478/amns.2022.1.00019

Mots clés
Matching algorithm, GNSS track data, road node, road arc

© 2023 Fengping Wang, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Fig. 1

Fig. 2

Fig. 3

Fig. 4

Fig. 5

Fig. 6

Studying a matching method combining distance proximity and buffer constraints

Publié en ligne: 05 sept. 2022

Pages: 2459 - 2466

Reçu: 23 mars 2022

Accepté: 06 mai 2022

DOI: https://doi.org/10.2478/amns.2022.1.00019

Mots clésMatching algorithm, GNSS track data, road node, road arc

© 2023 Fengping Wang, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Fig. 1

Fig. 2

Fig. 3

Fig. 4

Fig. 5

Fig. 6

Mots clés
Matching algorithm, GNSS track data, road node, road arc