• Spatial Information Research
• /
• v.17 no.2
• /
• pp.213-222
• /
• 2009

Finding exclusive closest pairs in road network is very useful to real applications such as, for example, finding a closest pair between a passenger and a nearby taxi in a road network. Few studies, however, have been interested in this problem. To match two close moving objects exclusively, one object must belong to only one result pair. Because moving objects in a road network change their position continuously, it is necessary to monitor closest pair results. In this paper, we propose a methodology to monitor k exclusive closest pairs via a road network. Proposed method only updates the results which are influenced by objects' movement. We evaluated the performance of the proposed method with various real road network data. The results show that our method produces better accuracy than normal batch processing methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.39 no.6
• /
• pp.587-598
• /
• 2021

This study aims to develop a multi-camera based MMS (Mobile Mapping System) technology for building a HD (High Definition) map for autonomous driving and for quick update. To replace expensive lidar sensors and reduce long processing times, we intend to develop a low-cost and efficient MMS by applying multiple cameras and real-time data pre-processing. To this end, multi-camera storage technology development, multi-camera time synchronization technology development, and MMS prototype development were performed. We developed a storage module for real-time JPG compression of high-speed images acquired from multiple cameras, and developed an event signal and GNSS (Global Navigation Satellite System) time server-based synchronization method to record the exposure time multiple images taken in real time. And based on the requirements of each sector, MMS was designed and prototypes were produced. Finally, to verify the performance of the manufactured multi-camera-based MMS, data were acquired from an actual 1,000 km road and quantitative evaluation was performed. As a result of the evaluation, the time synchronization performance was less than 1/1000 second, and the position accuracy of the point cloud obtained through SFM (Structure from Motion) image processing was around 5 cm. Through the evaluation results, it was found that the multi-camera based MMS technology developed in this study showed the performance that satisfies the criteria for building a HD map.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.1-11
• /
• 2015

Recently, NAND flash memories are used for storage devices because of fast access speed and low-power. However, applications of FTL on low power computing devices lead to heavy workloads which result in a memory requirement and an implementation overhead. Consequently, studies of B+-Tree on embedded devices without the FTL have been proposed. The studies of B+-Tree are optimized for performance of inserting and updating records, considering to disadvantages of the NAND flash memory that it can not support in-place update. However, if a general garbage collection method is applied to the previous studies of B+-Tree, a performance of the B+-Tree is reduced, because it generates a rearrangement of the B+-Tree by changing of page positions on the NAND flash memory. Therefor, we propose a novel garbage collection method which can apply to the B+-Tree based on the NAND flash memory without the FTL. The proposed garbage collection method does not generate a rearrangement of the B+-Tree by using a block information table and a proxy block. We implemented the B+-Tree and ${\mu}$-Tree with the proposed garbage collection on physical devices with the NAND flash memory. In experiment results, the proposed garbage collection scheme compared to greedy algorithm garbage collection scheme increased the number of inserted keys by up to about 73% on B+-Tree and decreased elapsed time of garbage collection by up to about 39% on ${\mu}$-Tree.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.35 no.2
• /
• pp.525-531
• /
• 2015

According to the increasing demand for 3D indoor spatial information, the utilization of a terrestrial laser scanner comes to the fore. However, the research for the comparison between a terrestrial laser scanning method and a traditional surveying method is insufficient. The paper evaluated the time-efficiency and the locational accuracy of an AMCW type and a direct TOF type of terrestrial laser scanning methods in comparison with the observation using a total station. As a result, an AMCW type showed higher time-efficiency than a direct TOF type and the RMSE between the two types of data was ${\pm}1mm$. Moreover, the terrestrial laser scanning method showed twice higher time-efficiency than the observation using a total station and the RMSE between the two data was ${\pm}3.4cm$. The results indicate that the terrestrial laser scanning method has better profitability and performance for 3D indoor modeling than the traditional survey using a total station. In the future, a terrestrial laser scanner can be efficiently utilized in the construction of 3D indoor spatial information.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.173-184
• /
• 2018

As the portable traffic information collection system using probe vehicles spreads, it is becoming possible to collect road hazard information such as portholes, falling objects, and road surface freezing using in-vehicle sensors in addition to existing traffic information. In this study, we developed a integration and decision algorithm that integrates time and space in real time when multiple probe vehicles detect events such as road hazard information based on GPS coordinates. The core function of the algorithm is to determine whether the road hazard information generated at a specific point is the same point from the result of detecting multiple GPS probes with different GPS coordinates, Generating the data, (3) continuously determining whether the generated event data is valid, and (4) ending the event when the road hazard situation ends. For this purpose, the road risk information collected by the probe vehicle was processed in real time to achieve the conditional probability, and the validity of the event was verified by continuously updating the road risk information collected by the probe vehicle. It is considered that the developed hybrid processing algorithm can be applied to probe-based traffic information collection and event information processing such as C-ITS and autonomous driving car in the future.

• Journal of Korean Society of Transportation
• /
• v.29 no.5
• /
• pp.121-138
• /
• 2011

More affordable and available cutting-edge technologies (e.g., wireless vehicle communication) are regarded as a possible alternative to the fixed infrastructure-based traffic information system requiring the expensive infrastructure investments and mostly implemented in the uninterrupted freeway network with limited spatial system expansion. This paper develops an advanced decentralized traveler information System (ATIS) using vehicle-to-vehicle (V2V) communication system whose performance (drivers' travel time savings) are enhanced by three complementary functions (autonomous automatic incident detection algorithm, reliable sample size function, and driver behavior model) and evaluates it in the typical $6{\times}6$ urban grid network with non-recurrent traffic state (traffic incident) with the varying key parameters (traffic flow, communication radio range, and penetration ratio), employing the off-the-shelf microscopic simulation model (VISSIM) under the ideal vehicle communication environment. Simulation outputs indicate that as the three key parameters are increased more participating vehicles are involved for traffic data propagation in the less communication groups at the faster data dissemination speed. Also, participating vehicles saved their travel time by dynamically updating the up-to-date traffic states and searching for the new route. Focusing on the travel time difference of (instant) re-routing vehicles, lower traffic flow cases saved more time than higher traffic flow ones. This is because a relatively small number of vehicles in 300vph case re-route during the most system-efficient time period (the early time of the traffic incident) but more vehicles in 514vph case re-route during less system-efficient time period, even after the incident is resolved. Also, normally re-routings on the network-entering links saved more travel time than any other places inside the network except the case where the direct effect of traffic incident triggers vehicle re-routings during the effective incident time period and the location and direction of the incident link determines the spatial distribution of re-routing vehicles.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.296-309
• /
• 2003

One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.1 s.35
• /
• pp.49-55
• /
• 2006

Nowadays, flood hazard maps have been generated to minimize the damages from the flooding. To generate such flood hazard maps, LiDAR data can be used as data source with higher data accuracy. LiDAR data, however, requires relatively higher cost and longer processing time. In this background, this study proposed DEM generation using NGIS digital topographic maps. For that, breaklines were processed to count directions of water flows. In addition, the river profile data, unique data source to represent real topography of the river area, were integrated to the breaklines to generate DEM. City of Kuri in Kyunggi Province was selected for this study and 1:1,000 and 1:5,000 topographic maps were integrated to process breaklines and river profile data were also linked to generate DEM. The generated DEM showed relatively lower vertical accuracy from mixing 1:1,000 and 1:5,000 topographic maps since 1:1,000 topographic maps were not available for some portion of the area. However, the DEM generated demonstrated reasonable accuracy and resolution for flood map generation as well as higher cost saving effects. On the contrary, for more efficient utilization of NGIS topographic maps, periodic map updating needs to be made including technical consideration in building breaklines and applying interpolation methods.