• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.188-199
• /
• 2018

In this study a novel dynamic lane-level location referencing method(LLRM) was developed. The terminologies were defined and the prerequisites were suggested for the LLRM. Then, the logical and physical data formats were proposed, followed by the development of encoding and decoding algorithms. To conduct a performance test of the proposed method, two different high precision digital maps were prepared as well as an evaluation tool. The test results demonstrated that the proposed method works perfectly in terms of accuracy. The processing speed and the data size were found to be less efficient, but it is expected that the defect would be compensated soon enough due to the fast growing technology of ICT and computer hardwares.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.319-322
• /
• 2014

Due to the active use of the internet currently, the transportation volume of logistics firms is dramatically increasing, but it is not easy to secure available vehicles and vehicle suppliers, so it is the most important for logistics companies to streamline transportations management and process. For such reason, there have been a number of studies to deal with VRP and VSP for efficient vehicle allocation planning of vehicle suppliers and vehicles. But it is hard to reflect traffic situations changing everyday and detailed geographic conditions, and it requires big scale of database and huge calculation time consumption as increase number of depots, which is very inefficient. For solving the vehicle allocation planning problems of 3PL firms with various constraints due to the transportation cost, this paper suggest new vehicle allocation information system and an algorithm based transportation cost/income. Also this paper presents actual results applied to a logistics company. As a result, the transportation profit of vehicle suppliers increased by 11 percent in average, when the developed transportation cost-based vehicle allocation system applied.

• Journal of Internet Computing and Services
• /
• v.24 no.5
• /
• pp.107-120
• /
• 2023

The public bicycle of Seoul, Ttareungyi, was launched at October 2015 to reduce traffic and carbon emissions in downtown Seoul and now, 2023 Oct, the cumulative number of user is upto 4 million and the number of bike is about 43,000 with about 2700 stations. However, super growth of Ttareungyi has caused the several problems, especially demand/supply mismatch, and thus the Seoul citizen has been complained about out of stock. In this point, this study conducted a real time demand forecasting model to prevent stock out bike at stations. To develop the model, the research team gathered the rental·return transaction data of 20,000 bikes in whole 1600 stations for 2019 year and then analyzed bike usage, user behavior, bike stations, and so on. The forecasting model using machine learning is developed to predict the amount of rental/return on each bike station every hour through daily learning with the recent 90 days data with the weather information. The model is validated with MAE and RMSE of bike stations, and tested as a prototype service on the Seoul Bike Management System(Mobile App) for the relocation team of Seoul City.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.77-90
• /
• 2002

Network expansion has been an inevitable method for most traffic equilibrium assignments to consider intersection movements such as intersection delays. The drawback of network expansion is that because it dramatically increases network sizes to emulate possible directional movements as corresponding links, not only is complexities for building network amplified, but computational performance is shrunk. This paper Proposes a new variational inequality formulation for a user-optimal traffic equilibrium assignment model to explicitly consider directional delays without building expanded network structures. In the formulation, directional delay functions are directly embedded into the objective function, thus any modification of networks is not required. By applying a vine-based shortest Path algorithm into the diagonalization algorithm to solve the problem, it is additionally demonstrated that various loop-related movements such as U-Turn, P-Turn, etc., which are frequently witnessed near urban intersections, can also be imitated by blocking some turning movements of intersections. The proposed formulation expects to augment computational performance through reduction of network-building complexities.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.6
• /
• pp.627-634
• /
• 2016

Vehicle classification system in domestic tollgates is usually to use treadle sensor for calculating wheel width and tread of the vehicle. due to the impact that occurs when the wheels of the vehicle contact, treadle sensor requires high durability. recently, KHC(Korea Highway Corporation) began operating high-speed lane for cargo truck. high-speed cargo truck generate more impact the design criteria of previous treadle. therefore, an increase in the maintenance and management costs of the treadle damage is concerned. In this paper, we propose an algorithm for obtaining optimal wheel width and tread using non-contact treadle sensor that been improved durability from physical impacts. for the verification of the proposed algorithm, a field test was performed using 1/2/3/6 class vehicles based on the KHC's classification criteria. through this experiments, maximum error of the width and the tread is each ${\pm}2cm$ and ${\pm}8cm$, also the accuracy was measured as 98%, 97% or more, and proved that the proposed algorithm valid on to apply to the vehicle classification system.

• Journal of Information Technology Applications and Management
• /
• v.11 no.4
• /
• pp.169-179
• /
• 2004

There are many inductive loop detectors under the highways in Korea. Among the other detectors, some are image detectors. Almost all image detectors are focused one or two lane of the road and are measuring traffic information. This paper proposes to an algorithm for detecting traffic information automatically from CCTV camera images installed on the highway. The information which is counted in one lane or two contains some critical errors by occlusion frequently in case of passing larger vehicles. In this paper, we use a tracking algorithm in which the detection area include all lanes, then the traffic informations are collected from the vehicles individually using difference images in this detection area. This tracking algorithm is better than lane by lane detecting algorithm. The experiment have been conducted two different real road scenes for 20 minutes. For the experiments, the images are provided with CCTV camera which was installed at Kiheung Interchange upstream of Kyongbu highway, and video recording images at Chungkye Tunnel. For image processing, images captured by frame-grabber board 30 frames per second, 640${\times}$480 pixels resolution and 256 gray-levels to reduce the total amount of data to be Interpreted.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2007.10a
• /
• pp.247-256
• /
• 2007

Accessibility is a field of study that has primarily been applied to urban or transportation problems two dimensionally. However, in large complex buildings as shopping centers or hospitals, inter-spatial accessibility among compartments has to be taken into account such as in building layouts or evacuation planning. This study expands space syntax theory, one of accessibility-related methodologies used for computing connectivity in urban or architectural spaces, into 3D indoor spaces. Although space syntax is basically a topology-based theory that does not consider general costs such as distance or time, this study suggests modification that incorporates different types of impedances in moving between places including distances, turns and transfers between floors. The proposed method is applied to a 3D campus building model in computing and displaying the accessibility to exit doors or cohesive accessibility among similar functions.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.361-368
• /
• 2014

The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.1
• /
• pp.31-37
• /
• 2024

In this study, we propose a machine vision-based pedestrian signal detection algorithm that operates efficiently even in computing resource-constrained environments. This algorithm demonstrates high efficiency within limited resources and is designed to minimize the impact of ambient lighting by sequentially applying HSV color space-based image processing, binarization, morphological operations, labeling, and other steps to address issues such as light glare. Particularly, this algorithm is structured in a relatively simple form to ensure smooth operation within embedded system environments, considering the limitations of computing resources. Consequently, it possesses a structure that operates reliably even in environments with low computing resources. Moreover, the proposed pedestrian signal system not only includes pedestrian signal detection capabilities but also incorporates IoT functionality, allowing wireless integration with a web server. This integration enables users to conveniently monitor and control the status of the signal system through the web server. Additionally, successful implementation has been achieved for effectively controlling 50W LED pedestrian signals. This proposed system aims to provide a rapid and efficient pedestrian signal detection and control system within resource-constrained environments, contemplating its potential applicability in real-world road scenarios. Anticipated contributions include fostering the establishment of safer and more intelligent traffic systems.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.