• Journal of Korean Society of Disaster and Security
• /
• v.12 no.3
• /
• pp.13-24
• /
• 2019

The concept of shape similarity has been applied to verify the accuracy of the SIND model, the real-time prediction model for disaster risk. However, the CRITIC method, one of the most widely used in geometric methodology, is definitely limited to apply to complex shape such as hazard map for coastal disaster. Therefore, we suggested the modified CRITIC method of which we added the shape factors such as RCCI and TF to consider complicated shapes. The matching pairs were manually divided into exact-matching pairs and mis-matching pairs to evaluate the applicability of the new method for shape similarity into hazard maps for storm surges. And the shape similarity of each matching pair was calculated by changing the weights of each shape factor and criteria. Newly proposed methodology and the calculated weights were applied to the objects of the existent hazard map and the results from SIND model. About 90% of exact-matching pairs had the shape similarity of 0.5 or higher, and about 70% of mis-matching pairs were it below 0.5. As future works, if we would calibrate narrowly and adjust carefully multi-objects corresponding to one object, it would be expected that the shape similarity of the exact-matching pairs will increase overall while it of the mis-matching pairs will decrease.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.4
• /
• pp.379-388
• /
• 2012

The Road Name Address system has begun to be applied and widely used since 2011. However, the Digital Map, or the national representative basic map, has no reference to the Road Name Address system. It causes some difficulties to use the Digital Map under the Road Name Address system. In this paper, we suggest a method for generating the expanded Digital Map by adding information about Road Name Address system into the objects of the Digital Map. First, object matching pairs between the road section layer from the Road Name Address Map and the road centerline layer from the Digital Map are found. Then attributes to be copied from the Road Name Address map to the Digital Map are extracted by comparing their attribute tables. Finally the extracted attributes are copied from the Road Name Address Map to the Digital Map. The expanded road centerline layer of the Digital Map then has attributes about road name according to the Road Name Address system, so that the georeferencing of the Digital Map according to the Road Name Address system becomes possible.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.766-771
• /
• 2002

Automatic change detection based on the vector-to-raster comparison is hard especially in high-resolution image. This paper proposes a method to designate roads in high-resolution image in sequential manner using the information from vector map in which Hough transform is used for reliability. By its linearity, the road of urban areas in a vector map can be easily parameterized. Following some pre-processing to remove undesirable objects, we obtain the edge map of raster image. Then the edge map is transformed to a parameter space to find the selected road from vector map. The comparison is done in the parameter space to find the best matching. The set of parameters of a road from vector map is treated as the constraints to do matching. After designating the road, we may overlay it on the raster image for precise monitoring. The results can be used for detection of changes in road object in a semi-automatic fashion.

• Journal of Korea Multimedia Society
• /
• v.19 no.9
• /
• pp.1647-1658
• /
• 2016

RGB+D database has been widely used in object recognition, object tracking, robot control, to name a few. While rapid advance of active depth sensing technologies allows for the widespread of indoor RGB+D databases, there are only few outdoor RGB+D databases largely due to an inherent limitation of active depth cameras. In this paper, we propose a novel method used to build outdoor RGB+D databases. Instead of using active depth cameras such as Kinect or LIDAR, we acquire a pair of stereo image using high-resolution stereo camera and then obtain a depth map by applying stereo matching algorithm. To deal with estimation errors that inevitably exist in the depth map obtained from stereo matching methods, we develop an approach that estimates confidence of depth maps based on unsupervised learning. Unlike existing confidence estimation approaches, we explicitly consider a spatial correlation that may exist in the confidence map. Specifically, we focus on refining confidence feature with the assumption that the confidence feature and resultant confidence map are smoothly-varying in spatial domain and are highly correlated to each other. Experimental result shows that the proposed method outperforms existing confidence measure based approaches in various benchmark dataset.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.68-78
• /
• 2000

This paper suggests a new map-matching algorithm for matching traveling trace of vehicle, which is measured by GPS receiver, to the road of a digital map This eventually brings the Improvement of positioning accuracy of the vehicle with GPS receiver After representing the travelling vehicle's motion by state equations using Singer's model, the proposed map-matching algorithm places the position of a vehicle right on the road and also improves the positioning accuracy of the vehicle using a Kalman filter In the crossroad, since it is difficult to determine precisely a current travelling road, we take linear regression to the estimated values from Kalman filtering This gives the direction angle of turning vehicle, then we can determine the correct route direction after comparing with each route-direction angle at the intersection.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.517-526
• /
• 2008

Stereo vision is a fundamental method for measuring 3D structures by observing them from two cameras placed on different positions. In order to reconstruct 3D structures, it is necessary to create a disparity map from a pair of stereo images. To create a disparity map we compute the matching cost for each point correspondence and compute the disparity that minimizes the sum of the whole matching costs. In this paper, we propose a method to estimate a dense disparity map using region segmentation. We segment each scanline using region homogeneity properties. Using the segmented regions, we prohibit false matches in the stereo matching process. Disparities for pixels that failed in matching are filled by interpolating neighborhood disparities. We applied the proposed method to various stereo images of real environments. Experimental results showed that the proposed method is stable and potentially viable in practical applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.848-856
• /
• 2004

In this paper, a fast stereo matching algorithm based on pixel-wise matching strategy, which can get a stable and accurate disparity map, is proposed. Since a stereo image pair has small differences each other and the differences between left and right images are just caused by horizontal shifts with some order, the matching using a large window will not be needed within a given search range. However, disparity results of conventional pixel-based matching methods are somewhat unstable and wrinkled, the principal direction of disparities is checked by the accumulated cost along a path on array with the dynamic programming method. Experimental results showed that the proposed method could remove almost all disparity noise and set a good quality disparity map in very short time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.119-122
• /
• 2011

The Stereo vision using belief propagation algorithm that has been studied recently yields good performance in disparity extraction. In this paper, BP algorithm is proved theoretically to high precision for a stereo matching algorithm. We derive disparity map from stereo image by using Belief Propagation (BP) algorithm and area-based matching algorithm. Two algorithms are compared using stereo images provided by Middlebury web site. Disparity map error rate decreased from 52.3% to 2.3%.

• International Journal of Highway Engineering
• /
• v.17 no.5
• /
• pp.75-82
• /
• 2015

PURPOSES : In link matching using vehicular trajectory in a car navigation system, it is technically difficult to match the location of the subject vehicle with a link on an electronic map in the vehicle on a grade separation highway segment consisting of an elevated highway and atgrade highway, because of the overlap of geometric lines of the two highways. This study was initiated to propose a link matching algorithm using the characteristics of vehicular movement of the subject vehicle. METHODS : The selected test site is the highway segment between Jeong-reung IC and Gil-eum IC where the Inner Circulation Road and Jeong-reung-ro run together. To evaluate the proposed algorithm, this study collected the raw packet data of vehicles that drove on the test site. In a simulation environment, link matching was performed using an existing algorithm as well as the proposed algorithm. RESULTS: It was clearly found that the characteristics of vehicular movements are different on the two highways. CONCLUSIONS: The proposed algorithm outperformed the existing algorithm.

• International Journal of Automotive Technology
• /
• v.7 no.3
• /
• pp.361-367
• /
• 2006

This paper describes a novel stereo vision based localization of free parking site, which recognizes the target position of automatic parking system. Pixel structure classification and feature based stereo matching extract the 3D information of parking site in real time. The pixel structure represents intensity configuration around a pixel and the feature based stereo matching uses step-by-step investigation strategy to reduce computational load. This paper considers only parking site divided by marking, which is generally drawn according to relevant standards. Parking site marking is separated by plane surface constraint and is transformed into bird's eye view, on which template matching is performed to determine the location of parking site. Obstacle depth map, which is generated from the disparity of adjacent vehicles, can be used as the guideline of template matching by limiting search range and orientation. Proposed method using both the obstacle depth map and the bird's eye view of parking site marking increases operation speed and robustness to visual noise by effectively limiting search range.