• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.6-13
• /
• 2002

In this paper, we propose an image processing based method to measure red-time and green-time backward moving shockwave speed automatically at signalized intersections. Shockwave means the discontinuous boundary line between different vehicle traffic flows, and its moving speed is called shockwave speed which is obtain from the slope of boundary line. In this paper, we compose distance-time diagram for measuring shockwave speed automatically. By global vehicle tracking, we draw all of the vehicle moving path on distance-time diagram. We analyze the slope change pattern of curved moving path line, and compute red-time and green-time backward moving shockwave speed. We obtain the measurement result of shockwave speed, when applying above mentioned proposed method to experiment at signalized intersections, Once we can measure the shockwave speed, we could apply the result to highway ramp metering and automatic signal control at intersections effectively since we know the situation of frontal congestion easily.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.3
• /
• pp.52-60
• /
• 2019

This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.105-114
• /
• 2009

Recently, location-based services which provides k nearest POIs, e.g., gas stations, restaurants and banks, are essential such applications as telematics, ITS(Intelligent Transport Systems) and kiosk. For this, the Voronoi Diagram k-NN(Nearest Neighbor) search algorithm has been proposed. It retrieves k-NNs by using a file storing pre-computed network distances of POIs in Voronoi diagram. However, this algorithm causes the cost problem when expanding a Voronoi diagram. Therefore, in this paper, we propose an algorithm which generates a matrix of the shortest distance between border points of a Voronoi diagram. The shortest distance is measured each border point to all of the rest border points of a Voronoi Diagram. To retrieve desired k nearest POIs, we also propose a k-NN search algorithm using the matrix of the shortest distance. The proposed algorithms can m inim ize the cost of expanding the Voronoi diagram by accessing the pre-computed matrix of the shortest distances between border points. In addition, we show that the proposed algorithm has better performance in terms of retrieval time, compared with existing works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1686-1691
• /
• 2004

In this paper, we present an improved method to calculate Euclidean distance transform based on Guan's method. Compared to the conventional method, Euclidean distance can be computed faster using Guan's method when the number of feature pixels is small; however, overall computational cost increases proportional to the number of feature pixels in an image. To overcome this problem, we divide feature pixels into two groups: boundary feature pixels (BFPs) and non-boundary feature pixels (NFPs). Here BFPs are defined as those in the 4-neighborhood of foreground pixels. Then, only BFPs are used to calculate the Voronoi diagram resulting in a Euclidean distance map. Experimental results indicate that the proposed method takes 40 Percent less computing time on average than Guan's method. To prove the performance of the proposed method, the computing time of Euclidean distance map by proposed method is compared with the computing time of Guan's method in 16 images that are binary and the size of 512${\times}$512.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.247-256
• /
• 2004

This paper presents an efficient collision detection algorithm the performance of which is independent of animation speed. Most of the previous collision detection algorithms are incremental and discrete methods, which find out the neighborhood of the extreme vertex at the previous time instance in order to get an extreme vertex at each time instance. However, if an object collides with another one with a high torque, then the angular speed becomes faster. Hence, the candidate by the incremental algorithms may be farther from the real extreme vertex at this time instance. Therefore, the worst time complexity nay be $O(n^2)$, where n is the number of faces. Moreover, the total time complexity of incremental algorithms is dependent on the time step size of animation because a smaller time step yields more frequent evaluation of Euclidean distance. In this paper, we propose a new method to overcome these drawbacks. We construct a spherical extreme vertex diagram on Gauss Sphere, which has geometric properties, and then generate the distance function of a polyhedron and a plane by using this diagram. In order to efficiently compute the exact collision time, we apply the interval Newton method to the distance function.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.26 no.2
• /
• pp.51-60
• /
• 2012

An improved method for detecting fault distance in overhead transmission lines is described in this paper. Based on single-ended measurement, propagation theory of traveling waves together with the wavelet transform technique is used. In estimating fault location, a simple, but fundamental method using the time difference between the two consecutive peaks of transient signals is considered; however, a new method to enhance measurement sensitivity and its accuracy is sought. The algorithm is developed based on the lattice diagram for traveling waves. Representing both the ground mode and alpha mode of traveling waves, in a lattice diagram, several relationships to enhance recognition rate or estimation accuracy for fault location can be found. For various cases with fault types, fault locations, and fault inception angles, fault resistances are examined using the proposed algorithm on a typical transmission line configuration. As a result, it is shown that the proposed system can be used effectively to detect fault distance.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.2
• /
• pp.17-32
• /
• 2022

This study explored an approach to estimate a flow-density diagram(FD) on a link in highway traffic environment by utilizing probe vehicles' time headway records. To study empirical flow-density diagram(EFD), the probe vehicles with vision sensors were recruited for collecting driving records for nine months and the vision sensor data pre-processing and GIS-based map matching were implemented. Then, we examined the new EFDs to evaluate validity with reference diagrams which is derived from loop detection traffic data. The probability distributions of time headway and distance headway as well as standard deviation of flow and density were utilized in examination. As a result, it turned out that the main factors for estimation errors are the limited number of probe vehicles and bias of flow status. We finally suggest a method to improve the accuracy of EFD model.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.41-49
• /
• 2008

This paper presents a data analysis method for the taxi telematics system which generates a greate deal of location history data. By the record consist of the basic GPS receiver-generated fields, device-added fields such as taxi operation status, and framework-attached fields such as matched link Identifier and position ratio in a link, each taxi can be represented by a state diagram. The transition and the state definition enable us to efficiently extract such information as pick-up time, pick-up distance, dispatch time, and dispatch distance. The analysis result can help to verify the efficiency of a specific taxi dispatch algorithm, while the analysis framework can invite a new challenging service including future traffic estimation, trajectory clustering, and so on.

• Journal of the Ergonomics Society of Korea
• /
• v.36 no.4
• /
• pp.343-353
• /
• 2017

Objective: This study aims to evaluate the efficiency of two representative subway map design types, namely a diagram type and a geographical type using physiological metrics, performance metrics, and self-reported metrics, which are representative usability metrics. Background: Subway maps need to be designed in order for users to quickly search and recognize subway line information. Although most cities' subway maps currently use the diagram type designed by Henry Beck, New York City's subway map has recently been changed to the subway map type combined with the geographical type designed by Michael Hertz. However, not many studies on its efficiency are found, and the studies that are available mainly depend on questionnaire surveys or take on a subjective behavioral study type based on experts' experiences. In this regard, evaluation through a more objective method is needed. Method: This study employed usability metrics as a method to evaluate the efficiency of information search targeting the diagram type and geographical type subway maps used mostly as subway maps. To this end, physiological metrics obtained through eye tracking, task completion time, representative metric of task performance, and subjective evaluation metrics were used for the suitability evaluation of subway map designs. Results: In the result of gaze movement distance analysis, no significant difference was shown in the two design types in terms of a process finding a departure station from the starting point and a process finding a transfer station between the departure station and arrival station (destination). However, the gaze movement distance in the process finding the arrival station at the departure station was significantly shorter in the geographical type, rather than in the diagram type. The analysis of task completion time showed a result similar to the gaze movement distance analysis result. Task completion time was significantly shorter in the geographical type, rather than in the diagram type, which is in the process finding the arrival station at the departure station. In other information search processes, no significant difference was shown. As a result of subjective evaluation metrics analysis, no significant difference was revealed in the two design types. Conclusion: An analysis on the two representative subway map design types was carried out via the adoption of usability metrics. As a result, although no significant difference was shown in some information search processes, it was revealed that information search was easier in the geographical type overall. Also, it was found that usability metrics can be effectively used to evaluate the design types of subway maps. Application: The study results can be used to set design direction to offer ease in information search on subway lines. The study also can be used as a method to evaluate a subway map's design type.

• Explosives and Blasting
• /
• v.8 no.4
• /
• pp.23-29
• /
• 1990

Some surface blasting vibration was measured to determine site constants and vibration frequency was analyzed. The results are summarized as follows; 1) Design method to predict particle velocities was introduced using the logarithmic normal distribution characteristics of peak particle velocities. 2) Scaled distance diagram to determine limiting charge was presented. 3) Line fitness between particle velocity and scaled distance didn't depend on dominant component of vibration. Prevail fitness was in the order of transverese, peak, vertical and radial component. 4) Dominant component of particle velocity didn't related to drilling direction. Frequency was lowered as distance enlarged. Duration time of vibration was shortened as charge decreased.