• KSCI Review
• /
• v.14 no.1
• /
• pp.265-271
• /
• 2006

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.202-211
• /
• 2007

As information radically increases owing to the proliferation of Internet, users are highly interested in information design that enables them to easily approach the information desired by them and shows the unsystematic information in summarized and recognizable information by rearrangement. In the problem, general users could not easily recognize such information design, because it was not designed on the basis of understanding the situation where users actually contacted, but used the method that visualized based on the result which emphasized the aspect of system. Studying map information retrieval site for improvement of efficiency of information delivery, this research analyzed user interface design problems of map information service through evaluation list acquired by investigating user interface design principle and mutually comparing with information visualization system evaluation standard.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.19-30
• /
• 2009

The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.93-102
• /
• 2008

The network weather map and bandwidth time-series graph are popularly used to understand the current and past traffic condition of NSP, ISP, and enterprise networks. These systems collect traffic performance data from a SNMP agent running on the network devices such as routers and switches, store the gathered information into a DB, and display the network performance status in the form of a time-series graph or a network weather map using Web user interface. Most of current enterprise networks are constructed in the form of a hierarchical tree-like structure with multi-Gbps Ethernet links, which is quietly different from the national or world-wide backbone network structure. This paper focuses on the network weather map for current enterprise network. We start with the considering points in developing a network weather map system suitable for enterprise network. Based on these considerings, this paper proposes the best way of using SNMP in constructing a network weather map system. To prove our idea, we designed and developed a network weather map system for our campus network, which is also described in detail.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.49-58
• /
• 2007

Hierarchical Mobile IPv6 (HMIPv6) has been proposed by Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead in employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely mobility anchor point (MAP) as a local home agent. However, HMIPv6 causes load concentration at a particular MAP and longer handover latency when inter-domain handover occurs. In order to solve such problems, this paper establishes a virtual domain (VD) of a higher layer MAP and proposes a MAP changing algorithm in which the routing path changes between mobile node (MN) and correspondent node(CN) according to the mobile position and the direction of the MN before inter-domain handover occurs. The proposed algorithm not only enables complete handover binding-update of the on-link care of address (LCoA) only when inter-domain handover occurs, but concentrated load of a particular MAP is distributed as well. This is because the MNs registered with higher layer MAP and lower layer MAP coexist in the VD. We simulate the performance of the proposed algorithm and compare with HMIPv6.

• The Journal of the Korea Contents Association
• /
• v.1 no.1
• /
• pp.15-23
• /
• 2001

It is difficult to figure out the specific contents of the buildings in the internet spatial area, since those data on the internet present only the location of buildings and the outlines of lands on which buildings are located, An experimental study for the view management of building information at internet urban spatial area was conducted on the Web-GIS based map using hyper map. With the building information on the 2-D map, modified from the previous numerical map and the regional building information and additional information, a new form of building through 3-D icons was shown on the internet spatial area. This study shows the Web-based building management system, which is designed to manage attribute data about hyper-linked buildings of 2.5-D icons and to reproduce visual building information by putting a variety of information into hyper-linked icons on the hyper map. This system not only complements the lack of consistency between real buildings and those on the map, but also provides users with more familiar urban space, so that everybody can utilize the building information as long as he has access to the internet.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1312-1320
• /
• 2017

Recently, vector map data is developed and used in many domains widely. In the most cases, vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the production process of vector maps is considerably complex and consumes a lot of money and human resources. Therefore, the secured storage and transmission are necessary to prevent the illegal copying and distribution from hacker. This paper presents a selective encryption algorithm using geometric objects in frequency domain for vector map data. In the proposed algorithm, polyline and polygon data in vector map is the target of the selective encryption process. Experimental results verified that proposed algorithm is effectively and adaptive the requirements of security.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.850-853
• /
• 2002

This paper described some applications using Open GIS Component that was called MapBase. There were 4 applications : KSDI(Korea Spatial Data Infrastructure) funded by MOIC(Ministry of Information and Communication), National Plants Resource Management System supported by Korea Forest Service, 7-Underground Facilities Management System of Cheongju funded by MOCT(Ministry of Construction and Transportation), and National Disaster Management System supported by MOGAHA(Ministry of Government Administration and Home Affairs. Because they wanted to access heterogeneous spatial database, it was necessary to select MapBase as their base methodology. The main feature of MapBase was component S/W which provided the interoperability and reusability among GIS applications as well as non-GIS information system through common specification. In this paper, we showed some applications' architectures and functions to increase understanding MapBase. That would help you to make application using MapBase.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.676-678
• /
• 2003

Recently, in according as rapid improvement of telecommunication markets and wireless internet technology, Location- Based Services (LBS) have been discussed as new 'Killer' application. The purpose of LBS is to determine location of user through mobile handset and to offer location information service to end-user. This paper has suggested an efficient transmission scheme of maps data as one of the important content services relating to data transmission of LBS in mobile environment. The basic system consists of three parts : (1) GIS (Geographic Information System) Server for storing, processing and handling map data, (2) Middleware Server for transmitting of map data by request of client, and (3) Client for requesting map data to Server and displaying them on handset. Also, in order to transmit map data, we are to expand WKB (Well Known Binary) in conformance to Simple Feature Specification of OGC (Open GIS Consortium), and increase efficiency of data transmission by developing trans mission data format to be able to transmit lightweight data and considering data compression technology.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.484-486
• /
• 2003

무선 통신 채널에서 오류 패턴은 유선에 비해 다른 오류 특징을 가지고 오류가 빈번하게 발생한다. 특히 오류가 오랫동안 없는 상태가 지속되기도 한다. 그러나 시뮬레이션에서 이용되는 균일 분포(Uniform distribution)와 같은 간단한 오류 모델에 의해 발생된 오류는 실제적인 오류 패턴과는 많은 차이가 있다. 이러한 차이점을 없애기 위해 측정된 오류를 기반으로 해서 실제적인 오류 패턴과 비슷한 chaotic map 모델을 시뮬레이션에서 사용할 수 있다. Chaotic map 모델은 다른 오류모델에 비해서 실제적인 오류 패턴과 비슷한 오류 패턴을 가지고, 비교적 간단하게 필요한 파라미터를 구할 수 있다. 본 논문에서는 chaotic map 모델을 무선 센서 네트워크에 적용 했다. 센서 네트워크에서 수집된 데이터와 이 데이터를 통한 Chaotic Map 모델을 CCDF(complementary cumulative distribution function)를 통해 비교했다. 무선랜 환경에서 실험된 chaotic map model은 2/3이상의 결과에서 일치하였지만. 센서 네트워크를 적용하면 무선랜과는 다른 특성을 가지기 때문에 30%의 트레이스에서 chaotic map 모델과 일치한다.