• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.2
• /
• pp.91-97
• /
• 2019

In automatic map generalization, the formalization of cartographic principles is important. This study proposes and evaluates the selection method for road network generalization that analyzes existing maps using reverse engineering and formalizes the selection rules for the road network. Existing maps with a 1:5,000 scale and a 1:25,000 scale are compared, and the criteria for selection of the road network data and the relative importance of each network object are determined and analyzed using $T{\ddot{o}}pfer^{\prime}s$ Radical Law as well as the logistic regression model. The selection model derived from the analysis result is applied to the test data, and road network data for the 1:25,000 scale map are generated from the digital topographic map on a 1:5,000 scale. The selected road network is compared with the existing road network data on the 1:25,000 scale for a qualitative and quantitative evaluation. The result indicates that more than 80% of road objects are matched to existing data.

• Journal of Cadastre & Land InformatiX
• /
• v.44 no.1
• /
• pp.127-138
• /
• 2014

It can be effective to extract and apply the updated information from the newly updated map data for updating road data of topographic map. In this study, update target data and update reference data are overlaid and the update objects are explored using network matching technique. And the network objects are classified into five matching and update cases and the update processes for each case are applied to the test data. For this study, road centerline data of digital topographic map is used as an update target data and road data of Korean Address Information System is used as an update reference data. The buffer-based network matching method is applied to the two data and the matching and update cases are classified after calculating the overlaid ratio of length. The newly updated road centerline data of digital topographic map is generated from the application of update process for each case. As a result, the update information can be extracted from the different map dataset and applied to the road network data updating.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.29-36
• /
• 2012

The low-carbon freight transportation system was introduced due to increase traffic congestion cost and carbon-dioxide for global climate change according to expanding city logistics demands. It is necessary to create 3D-based road network map for representing realistic road geometry with consideration of fuel consumption and carbon emissions. This study propose that 3D road network model expressed to realistic topography and road structure within trunk road for intercity freight through overlaying 2D-based transport-related thematic map and 1m-resolution DEM. The 3D-based road network map for the experimental road sections(Pyeongtaek harbor-Uiwang IC) was verified by GPS/INS survey and fuel consumption simulation. The results corresponded to effectively reflect realistic road geometry (RMSE=0.87m) except some complex structure such as overpass, and also actual fuel consumption. We expect that Green-based freight route planning and navigation system reflected on 3D geometry of complex road structure will be developed for effectively resolving energy and environmental problems.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.756-761
• /
• 2021

Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.3
• /
• pp.229-238
• /
• 2013

Development of methodologies to generate the small scale map from the large scale map using map generalization has huge importance in management of the digital topographic map, such as producing and updating maps. In this study, the selection methodology of map generalization for the road network data in digital topographic map is investigated and evaluated. The existing maps with 1:5,000 and 1:25,000 scales are compared and the criteria for selection of the road network data, which are the number of objects and the relative importance of road network, are analyzed by using the T$\ddot{o}$pfer's radical law and Logit model. The selection model derived from the analysis result is applied to the test data, and the road network data of 1:18,000 and 1:72,000 scales from the digital topographic map of 1:5,000 scale are generated. The generalized results showed that the road objects with relatively high importance are selected appropriately according to the target scale levels after the qualitative and quantitative evaluations.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.2
• /
• pp.97-103
• /
• 2005

Most car navigation systems(CNS) estimate the vehicle's location using global positioning system(GPS) or dead reckoning(DR) system. However, the estimated location has undesirable errors because of various noise sources such as unpredictable GPS noises. As a result, the measured position is not lying on the road, although the vehicle is known to be restricted on the road network. The purpose of map matching is to locate the vehicle's position on the road network where the vehicle is most likely to be positioned. In this paper, we analyze some general map matching algorithms first. Then, we propose a map matching method using compensation vectors to improve the performance of map matching. The proposed method calculates a compensation vector from the discrepancy between a measured position and an estimated position. The compensation vector and a newly measured position are to be used to determine the next estimation. To show the performance improvement of the map matching using compensation vectors, the real time map matching experiments are performed. The real road experiments demonstrate the effectiveness and applicability of the proposed map matching.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.1
• /
• pp.273-286
• /
• 2022

An HD map is essential in the automated driving of level 4 and above to generate the vehicle's global path since it contains road information and each road's lane information. Therefore, all the road elements in the HD map must be correctly defined to construct the correct road network necessary to generate the global path. But unfortunately, it is not difficult to find various errors even in the most recent HD maps. Hence, a preprocessing algorithm has been developed to detect and correct errors in the HD map. This error detection and correction result in constructing the correct road network for use in global path planning. Furthermore, the algorithm was tested on real roads' HD maps, demonstrating its validity.

• Journal of architectural history
• /
• v.20 no.6
• /
• pp.169-184
• /
• 2011

The following research of the road network of Jeju-Eupseong during Daehan Empire period has a twofold purpose: to study some characteristics of the road network at that time; and, to restore it to the original form of that period before a newly constructed road, called Shinjakro, has been established. As an attempt to trace the old shape of Jeju-Eupseong, this study analyzed some historical factors based on the first land cadastral map which was made in 1914, including outskirts of Jeju-Eupseong; such as castle itself, castle gate, road, bridge, lots of land, etc. Then this study also tried to restore the old road network of Jeju-Eupseong, through finding the original land-lot shape in the land cadastral map. There was five Shinjakro made between 1914 and 1917. The road network before then was composed of the double east-west axes and the single north-south axis. These axes was connected to some important place of the inside of Jeju-Eupseong; such as castle gates, fountains, Gaek-sa, etc. There were many branch lines between these main axes at about 80-120m intervals. Also there was an outer road along the outer wall of castle, connected with each castle gates. Especially, the north-west axis was the baseline which divided into two large parts, a government office area and non-government area (housing and commercial street for the people). Finally, this paper examines that the road network of Jeju-Eupseong was the true result for the efficient function of the city, especially considering natural geographical conditions and environment of living of that time.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.301-303
• /
• 2003

The extraction of 3D road network from high-resolution aerial images is still one of the current challenges in digital photogrammetry and computer vision. For many years, there are many researcher groups working for this task, but unt il now, there are no papers for doing this with TLS (Three linear scanner), which has been developed for the past several years, and has very high-resolution (about 3 cm in ground resolution). In this paper, we present a methodology of road extraction from high-resolution digital imagery taken over urban areas using this modern photogrammetry’s scanner (TLS). The key features of the approach are: (1) Because of high resolution of TLS image, our extraction method is especially designed for constructing 3D road map for next -generation digital navigation map; (2) for extracting road, we use the global context of the intensity variations associated with different features of road (i.e. zebra line and center line), prior to any local edge. So extraction can become comparatively easy, because we can use different special edge detector according different features. The results achieved with our approach show that it is possible and economic to extract 3D road data from Three Linear Scanner to construct next -generation digital navigation road map.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.