• Title/Summary/Keyword: road network matching

Search Result 23, Processing Time 0.021 seconds

A Study on Updating Methodology of Road Network data using Buffer-based Network Matching (버퍼 기반 네트워크 매칭을 이용한 도로 데이터 갱신기법 연구)

  • Park, Woo-Jin
    • 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.

Dynamic Route Guidance via Road Network Matching and Public Transportation Data

  • Nguyen, Hoa-Hung;Jeong, Han-You
    • 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.

Performance Improvement of Map Matching Using Compensation Vectors (보정벡터를 이용한 맵 매칭의 성능 향상)

  • Ahn Do-Rang;Lee Dong-Wook
    • 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.

Node Matching of Road Network Data by Comparing Link Shape (링크 형상 비교를 이용한 도로 네트워크 데이터의 노드 매칭)

  • Bang, Yoon-Sik;Lee, Jae-Bin;Huh, Yong;Yu, Ki-Yun
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2009.04a
    • /
    • pp.23-25
    • /
    • 2009
  • Nowadays, owing to the development of techniques for collecting geographic information, an increasing need is thus appearing: integrating heterogeneous databases. This paper proposes an algorithm for finding matching relationship between two node sets in road network data. We found the corresponding node pair using link shape linked with them as well as their location. The accuracy of matching was grown by this process. Result then can be used to reflect the topological information in performing link matching.

  • PDF

Development of a Map Matching Method for Land Vehicles Navigation (차량 항법을 위한 지도 정합법 개발)

  • Sung Tae-Kyung;Pyo Jong-Sun
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.4 s.304
    • /
    • pp.1-10
    • /
    • 2005
  • This paper presents a map matching method using multiple hypothesis technique(MHT) to identify the road that a land vehicle is located on. To realize a map matching method using MHT, Pseudo-measurements are generated utilizing adjacent roads of GPS/DR position and the MHT is reformulated as a single target problem. Since pseudo-measurements are generated using digital map, topological properties such as road connection, direction, and road facility information are considered in calculating probabilities of hypotheses. In order to improve the map matching performance under when bias errors exist in digital road map data, a Kalman filter is employed to estimate the biases. Field experimental results show that the proposed map matching method provides the consistent performance even in complex downtown areas, overpass/underpass areas, and in the areas where roads are adjacent in parallel.

Line Matching Method for Linking Wayfinding Process with the Road Name Address System (길찾기 과정의 도로명주소 체계 연계를 위한 선형 객체 매칭 방법)

  • Bang, Yoon Sik;Yu, Ki Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.4
    • /
    • pp.115-123
    • /
    • 2016
  • The road name address system has been in effect in Korea since 2012. However, the existing address system is still being used in many fields because of the difference between the spatial awareness of people and the road name address system. For the spatial awareness based on the road name address system, various spatial datasets in daily life should be referenced by the road names. The goal of this paper is to link the road name address system with the wayfinding process, which is closely related to the spatial awareness. To achieve our goal, we designed and implemented a geometric matching method for spatial data sets. This method generates network neighborhoods from road objects in the 'road name address map' and the 'pedestrian network data'. Then it computes the geometric similarities between the neighborhoods to identify corresponding road name for each object in the network data. The performance by F0.5 was assessed at 0.936 and it was improved to 0.978 by the manual check for 10% of the test data selected by the similarity. By help of our method, the road name address system can be utilized in the wayfinding services, and further in the spatial awareness of people.

Autonomous pothole detection using deep region-based convolutional neural network with cloud computing

  • Luo, Longxi;Feng, Maria Q.;Wu, Jianping;Leung, Ryan Y.
    • Smart Structures and Systems
    • /
    • v.24 no.6
    • /
    • pp.745-757
    • /
    • 2019
  • Road surface deteriorations such as potholes have caused motorists heavy monetary damages every year. However, effective road condition monitoring has been a continuing challenge to road owners. Depth cameras have a small field of view and can be easily affected by vehicle bouncing. Traditional image processing methods based on algorithms such as segmentation cannot adapt to varying environmental and camera scenarios. In recent years, novel object detection methods based on deep learning algorithms have produced good results in detecting typical objects, such as faces, vehicles, structures and more, even in scenarios with changing object distances, camera angles, lighting conditions, etc. Therefore, in this study, a Deep Learning Pothole Detector (DLPD) based on the deep region-based convolutional neural network is proposed for autonomous detection of potholes from images. About 900 images with potholes and road surface conditions are collected and divided into training and testing data. Parameters of the network in the DLPD are calibrated based on sensitivity tests. Then, the calibrated DLPD is trained by the training data and applied to the 215 testing images to evaluate its performance. It is demonstrated that potholes can be automatically detected with high average precision over 93%. Potholes can be differentiated from manholes by training and applying a manhole-pothole classifier which is constructed using the convolutional neural network layers in DLPD. Repeated detection of the same potholes can be prevented through feature matching of the newly detected pothole with previously detected potholes within a small region.

Map-Matching Algorithm for MEMS-Based Pedestrian Dead Reckoning System in the Mobile Device (모바일 장치용 MEMS 기반 보행항법시스템을 위한 맵매칭 알고리즘)

  • Shin, Seung-Hyuck;Kim, Hyun-Wook;Park, Chan-Gook;Choi, Sang-On
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.11
    • /
    • pp.1189-1195
    • /
    • 2008
  • We introduce a MEMS-based pedestrian dead reckoning (PDR) system. A walking navigation algorithm for pedestrians is presented and map-matching algorithm for the navigation system based on dead reckoning (DR) is proposed. The PDR is equipped on the human body and provides the position information of pedestrians. And this is able to be used in ubiquitous sensor network (USN), U-hearth monitoring system, virtual reality (VR) and etc. The PDR detects a step using a novel technique and simultaneously estimates step length. Also an azimuth of the pedestrian is calculated using a fluxgate which is the one of magnetometers. Map-matching algorithm can be formulated to integrate the positioning data with the digital road network data. Map-matching algorithm not only enables the physical location to be identified from navigation system but also improves the positioning accuracy. However most of map-matching algorithms which are developed previously are for the car navigation system (CNS). Therefore they are not appropriate to implement to pedestrian navigation system based on DR system. In this paper, we propose walking navigation system and map-matching algorithm for PDR.

Design and Implementation of Driving Pattern based Map Matching on Smart Phone (스마트폰에서 운전자 이동패턴을 이용한 맵매칭 설계 및 구현)

  • Hwang, Jae-Yun;Choi, Se-Hyu
    • Spatial Information Research
    • /
    • v.23 no.4
    • /
    • pp.47-56
    • /
    • 2015
  • Recently, there has been an increase in the number of people who use the smart-phone navigation for using various latest functions such as group driving and location sharing. But smart-phone has a limited storage space for one application, since a lot of applications with different purposes are installed in the smart-phone. For this reason, road network data with a large space of memory used for map matching in the device for navigation cannot be stored in the smart-phone for this reason map matching is impossible. Besides, smart-phone which doesn't use the external GPS device, provides inaccurate GPS information, compared to the device for navigation. This is why the smart-phone navigation is hard to provide accurate location determination. Therefore, this study aims to help map matching that is more accurate than the existing device for navigation, by reducing the capacity of road network data used in the device for navigation through format design of a new road network and conversion and using a database of driver's driving patterns. In conclusion, more accurate map matching was possible in the smart-phone by using a storage space more than 80% less than existing device at the intersection where many roads cross, the building forest that a lot of GPS errors occur, the narrow roads close to the highway. It is considered that more accurate location-based service would be available not only in the navigation but also in various applications using GPS information and map in the future Navigation.

Automatic Change Detection Based on Areal Feature Matching in Different Network Data-sets (이종의 도로망 데이터 셋에서 면 객체 매칭 기반 변화탐지)

  • Kim, Jiyoung;Huh, Yong;Yu, Kiyun;Kim, Jung Ok
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.6_1
    • /
    • pp.483-491
    • /
    • 2013
  • By a development of car navigation systems and mobile or positioning technology, it increases interest in location based services, especially pedestrian navigation systems. Updating of digital maps is important because digital maps are mass data and required to short updating cycle. In this paper, we proposed change detection for different network data-sets based on areal feature matching. Prior to change detection, we defined type of updating between different network data-sets. Next, we transformed road lines into areal features(block) that are surrounded by them and calculated a shape similarity between blocks in different data-sets. Blocks that a shape similarity is more than 0.6 are selected candidate block pairs. Secondly, we detected changed-block pairs by bipartite graph clustering or properties of a concave polygon according to types of updating, and calculated Fr$\acute{e}$chet distance between segments within the block or forming it. At this time, road segments of KAIS map that Fr$\acute{e}$chet distance is more than 50 are extracted as updating road features. As a result of accuracy evaluation, a value of detection rate appears high at 0.965. We could thus identify that a proposed method is able to apply to change detection between different network data-sets.