• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.226-235
• /
• 2006

Telematics is expected to be one of the fastest growing businesses in information technology area. It may create a new emerging market in industry related to automotive, telecommunications, and information services. Especially vehicle navigation service is considered as a killer application among telematics service applications. The current vehicle navigation service typically recommends a single path that is based on the traveling time or distance from the origin to the destination. The system provides two options for users to choose either via highway or via any road. Since the traffics and road conditions of big cities are very complicated and dynamic, the demand of multi-path guidance system is increasing in telematics market. The multi-path guidance system should allow drivers to choose a path based on their individual preferences such as traveling time, distance, or route familiarity. Using the Lawler's algorithm, it is possible to find multiple paths; however, due to the lengthy computational time, it is not suitable for the real-time services. This study suggests a computationally feasible and efficient heuristic multiple paths finding algorithm that is reliable for the real-time vehicle navigation services.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.8 no.5
• /
• pp.53-58
• /
• 2008

This study presented a design model optimizing a distance of inlet with drainage pipe laid under the gutter in road. When the distance of inlet changed, a basin for the gutter divided by the distance of inlet and the inflow coming into the gutter would be changed. In this case, the change of inlet distance causes the change of a diameter of drainage pipe and slope because of the change of capacity. Therefore, the optimization is needed to design the combination of them for the distance of inlet. Genetic Algorithm is used to determine the optimal combination of them. The conditions of road and the precipitation were assumed like a real and the range of inlet distance adopted $10{\sim}30\;m$ which has been introduced in domestic. This model presented the optimal distance of inlet and the combination of pipe and slope through the minimum cost. The result of the study is that the optimal distance of inlet is different from each slope of road and it can reduce about 20% of total cost for the distance of inlet.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.149-158
• /
• 2005

The object of this paper is to develop the shortest path algorithm. The existing shortest path algorithm models are developed while considering travel time and travel distance. A few problems occur in these shortest path algorithm models, which have paid no regard to cognition of users, such as when user who doesn't have complete information about the trip meets a strange road or when the route searched from the shortest path algorithm model is not commonly used by users in real network. This paper develops a shortest path algorithm model to provide ideal route that many people actually prefer. In order to provide the ideal shortest path with the consideration of travel time, travel distance and road cognition, travel time is predicted by using Kalman filtering and travel distance is predicted by using GIS attributions. The road cognition is considered by using space data of GIS. Optimal routes provided from this paper are shortest distance path, shortest time path, shortest path considering distance and cognition and shortest path considering time and cognition.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.1
• /
• pp.70-79
• /
• 2017

This study proposes a method to quickly and accurately acquire distance information on direction signs. The proposed method is composed of the recognition of the sign, pre-processing to facilitate the acquisition of the road sign distance, and the acquisition of the distance data. The road sign recognition uses color detection including gamma correction in order to mitigate various noise issues. In order to facilitate the acquisition of distance data, this study applied tilt correction using linear factors, and resolution correction using Fourier transform. To acquire the distance data, morphological operation was used to highlight the area, along with labeling and template matching. By acquiring the distance information on the direction sign through such a processes, the proposed system can be output the distance remaining to the next junction. As a result, when the proposed method is applied to system it can process the data in real-time using the fast calculation speed, average speed was shown to be 0.46 second per frame, with accuracy of 0.65 in similarity value.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.79-89
• /
• 2019

While most research focuses on the k-nearest neighbors (kNN) queries in the database community, an important type of proximity queries called k-farthest neighbors (kFN) queries has not received much attention. This paper addresses the problem of finding the k-farthest neighbors in road networks. Given a positive integer k, a query object q, and a set of data points P, a kFN query returns k data objects farthest from the query object q. Little attention has been paid to processing kFN queries in road networks. The challenge of processing kFN queries in road networks is reducing the number of network distance computations, which is the most prominent difference between a road network and a Euclidean space. In this study, we propose an efficient algorithm called FANS for k-FArthest Neighbor Search in road networks. We present a shared computation strategy to avoid redundant computation of the distances between a query object and data objects. We also present effective pruning techniques based on the maximum distance from a query object to data segments. Finally, we demonstrate the efficiency and scalability of our proposed solution with extensive experiments using real-world roadmaps.

• International Journal of Highway Engineering
• /
• v.18 no.5
• /
• pp.31-37
• /
• 2016

PURPOSES : The purpose of this study is to evaluate the effect of the quiet pavement on reducing a barrier height by using a prediction tool called SoundPLAN. METHODS : Firstly, the prediction was carried out to evaluate the difference in the maximum noise level at a building facade between the normal and the quiet pavements without a barrier. After calculating the noise reduction effect by the quiet pavement, a comparable barrier height to obtain the same noise reduction effect with it was predicted according to designable factors including road-building distance(10 m, 20 m, 40 m) and road-barrier distance(5 m, 10 m, 20 m, 30 m). RESULTS : The result showed that within the considered designable factors, the maximum barrier height was 37 m, 52 m, and 55 m to have the same noise reduction effect by the quiet pavement reducing 1 dBA, 3 dBA, and 5 dBA, respectively. It was evaluated that the barrier height increased with the increase of the road-building and road-barrier distances. To simulate the real situation in urban areas and to evaluate the combined effect of the normal/quiet pavement and barrier, the barrier height was fixed as 6 m. It was predicted that the noise level would reduce to as low as 0.2 dBA by the combination of normal pavement and barrier. On the other hand, the combination of the quiet pavement and barrier reduced 1.2 dBA, 3.2 dBA, and 5.2 dBA, respectively, for quiet pavement reducing 1 dBA, 3 dBA, and 5 dBA. CONCLUSIONS : A guideline needs to be suggested to select appropriate noise abatement schemes by considering factors such as the roadbuilding and road-barrier distances.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.190-200
• /
• 2005

In this paper, the image modelling of road's lane markings is established using view frustum(VF) modeling. This algorithm also involve the real time processing of the 3D position coordinate and the distance data from the camera to the points on the 3D world coordinate by the camera calibration. In order to reduce their measurement error, an useful algorithm for which analyze the geometric variations clue to traveling vehicle's fluctuation using VF model is proposed. In experiments, without correction, for instance, the $0.4^{\circ}$ of pitching rotation gives the error of $0.4^{\sim}0.6m$ at the distance of 10m, but the more far distance cause exponentially the more error. We confirmed that this algorithm can be reduced less than 0.1m of error at the same condition.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.8
• /
• pp.824-833
• /
• 2006

In this paper, the image modelling of road's lane markings is established using view frustum(VF) model. From this model, a measurement system of lane markings and obstacles is proposed. The system also involve the real time processing of the 3D position coordinate and the distance data from the camera to the points on the 3D world coordinate by virtue of the camera calibration. In order to reduce their measurement error, an useful algorithm for which analyze the geometric variations due to traveling vehicle's fluctuation using VF model is proposed. In experiments, without correction, for instance, the $0.4^{\circ}$ of pitching rotation gives the error of $0.4{\sim}0.6m$ at the distance of 10m, but the more far distance cause exponentially the more error. We con finned that this algorithm can be reduced less than 0.1m of error at the same condition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1697-1702
• /
• 2017

This paper proposes a forward vehicle movement estimation algorithm for the image-based forward collision warning. The road region in the acquired image is designated as a region of interest (ROI) and a distance look up table (LUT) is made in advance. The distance LUT shows horizontal and vertical real distances from a reference pixel as a test vehicle position to any pixel as a position of a vehicle on the ROI. The proposed algorithm detects vehicles in the ROI, assigns labels to them, and saves their distance information using the distance LUT. And then the proposed algorithm estimates the vehicle movements such as approach distance, side-approaching and front-approaching velocities using distance changes between frames. In forward vehicle movement estimation test using road driving videos, the proposed algorithm makes the valid estimation of average 98.7%, 95.9%, 94.3% in the vehicle movements, respectively.

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

With the spread of mobile devices and advances in communication techknowledges, the needs of application which uses the movement patterns of moving objects in history trajectory data of moving objects gets Increasing. Especially, to design public transportation route or road network of the new city, we can use the similar patterns in the trajectories of moving objects that move on the spatial network such as road and railway. In this paper, we propose a spatio-temporal similar trajectory search algorithm for moving objects on road network. For this, we define a spatio-temporal similarity measure based on the real road network distance and propose a grid-based index structure for similar trajectory search. Finally, we analyze the performance of the proposed similar trajectory search algorithm in order to show its efficiency.