• Spatial Information Research
• /
• v.14 no.4 s.39
• /
• pp.403-419
• /
• 2006

The well-blown address matching technology developed by the U.S. Census Bureau was applicable only for street addresses. However, many other addressing systems on the basis of a hierarchy of areas (hierarchical areal addressing system), such as Korean or Japanese addressing system, cannot be suitable for the existing address matching method. This paper, therefore, develops an areal address matching method, especially for Korean addressing system, in order to geocode 2D and 3D locational data of human activities. Thus, this study explains a new approach to dealing with 3D positioning method composed of two geocoding methods, which are a '2D Korean Address Matching' technique and a '3D Address Matching' technique.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.3-4
• /
• 2006

Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.23-25
• /
• 2010

In this paper, we studied linking method for updating navigation map with new address map. This method is hierarchical as we chose candidate using attribute data for geometry matching. Limiting a matching range, we conducted a experiment ICP with geometry matching. As a result, for linking method it's quite satisfied but for updating method, we decided that we have to do more precise method for updating.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.3
• /
• pp.101-108
• /
• 2012

The construction of data connection is required due to the digital map do not have the new address data which is implemented by the Korea government and it cannot use between government and other agency. The manually matching of digital map and new address data is time and money consuming process due to the huge amount of data. In this research, new system is developed for data generation of attribute data by the data connection method of digital map and new address data using spatial matching and matching rate of data connection is analyses. The results of data matching rate in the research area are 84% in building case and 67% in road case in 1:1000 digital map at Suwon and 18% in building case and 21% in road at Seogwipo.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3721-3737
• /
• 2015

3D reconstruction based on binocular data is significant to machine vision. In our method, we propose a new and high efficiency 3D reconstruction approach by using a consumer camera aiming to: 1) address the configuration problem of dual camera in the binocular reconstruction system; 2) address stereo matching can hardly be done well problem in both time computing and precision. The kernel feature is firstly proposed in calibration stage to rectify the epipolar. Then, we segment the objects in the camera into background and foreground, for which system obtains the disparity by different method: local window matching and kernel feature-based matching. Extensive experiments demonstrate our proposed algorithm represents accurate 3D model.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.1
• /
• pp.33-42
• /
• 2016

In Korea, the address-point matching technique has been used to provide geocoding services. In fact, this technique brings the high positional accuracy. However, the quality of geocoding result can be limited, since it is significantly affected by data quality. Also, it cannot be used for the 3D address geocoding and the reverse geocoding. In order to alleviate issues, the paper has implemeted proposed geocoding methods, based on street-based addresses matching technique developed by US census bureau, for street-based addresses in Korea. Those proposed geocoding methods are illustrated in two ways; (1) street address-matching method, which of being used for not only 2D addresses representing a single building but also 3D addresses representing indoor space or underground building, and (2) reverse geocoding method, whichas converting a location point to a readable address. The result of street-based address geocoding shows 82.63% match rates, while the result of reverse geocoding shows 98.5% match rates within approximately 1.7(m) the average position error. According to the results, we could conclude that the proposed geocoding techniques enable to provide the LBS(Location Based Service). To develop the geocoding methods, the study has perfoermed by ignoring the parsing algorithms for address standardization as well as the several areas with unusual addresses, such as sub-urban areas or subordinate areas to the roads, etc. In the future, we are planning the improved geocoding methods for considering these cases.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.43-50
• /
• 2001

The IP routing uses the longest-matching prefix to determine the destination. Fast lookup should be required for the high speed routing. We propose a modified LC-trie, called multiple LC-trie, which is suitable data structure for fast address-lookups in software implementation. To reduce the number of memory accesses, our scheme analyzes the distribution of IP address access pattern, and constructs multiple LC:-tries for frequently accessed IP addresses. Our experimental results show that our scheme can perform faster than the original LC-trie schemes.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.128-134
• /
• 2014

In this paper, we present a graphics processing unit (GPU)-based matching technique for the purpose of fast feature matching between different images. The scale invariant feature transform algorithm developed by Lowe for various feature matching applications, such as stereo vision and object recognition, is computationally intensive. To address this problem, we propose a matching technique optimized for GPUs to perform computations in less time. We optimize GPUs for fast computation of keypoints to make our system quick and efficient. The proposed method uses a self-organizing map feature matching technique to perform efficient matching between the different images. The experiments are performed on various image sets to examine the performance of the system under varying conditions, such as image rotation, scaling, and blurring. The experimental results show that the proposed algorithm outperforms the existing feature matching methods, resulting in fast feature matching due to the optimization of the GPU.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.4
• /
• pp.115-123
• /
• 2016

The road name address system has been in effect in Korea since 2012. However, the existing address system is still being used in many fields because of the difference between the spatial awareness of people and the road name address system. For the spatial awareness based on the road name address system, various spatial datasets in daily life should be referenced by the road names. The goal of this paper is to link the road name address system with the wayfinding process, which is closely related to the spatial awareness. To achieve our goal, we designed and implemented a geometric matching method for spatial data sets. This method generates network neighborhoods from road objects in the 'road name address map' and the 'pedestrian network data'. Then it computes the geometric similarities between the neighborhoods to identify corresponding road name for each object in the network data. The performance by F0.5 was assessed at 0.936 and it was improved to 0.978 by the manual check for 10% of the test data selected by the similarity. By help of our method, the road name address system can be utilized in the wayfinding services, and further in the spatial awareness of people.