• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.557-558
• /
• 2020

본 논문에서는 모바일 단말기에서 지하공간 통합지도 관리를 위한 서비스 시스템을 설계한다. 설계된 시스템은 현장에서 수집된 정보를 모바일 단말기에서 직접 확인 후 정합성을 검증할 수 있는 기능과 허가된 사용자만이 지도 및 지하공간 정보에 접근하여 확인 및 수정할 수 있는 기능을 가진다. 또한, 설계된 모바일 서비스 시스템을 구현하기 위해 모바일 클라이언트 모듈/현장 지원 시스템, 관리자 UI 모듈/현장 데이터 반영 모듈 간 흐름을 다이어그램으로 표현하여 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1054-1062
• /
• 1991

In this paper a communication system using direct sequence spread spectrum (DS/SS) technique is constructed to transmit burst format data over power line channel with impulsive noise and narrowband interferences. Fast code synchronization is acquired by digital matched filter and data decision is accomplished by sampling pulses. In order to examine the performance of the power line communication system, but error rate and packet loss rate are measured over the simulation channel with various noise sources. When the packet composed of 1-bit preamble and 63-bit data is transmitted under very high burst impulsive noise, the bit error rate is about 10$^3$-10$^4$ and the packet loss rate is below 0.07.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.55-61
• /
• 2008

A real-time three-dimensional vision is a passive system, which would support various applications including collision avoidance, home networks. It is a good alternative of active systems, which are subject to interference in noisy environments. In this paper, we designed a SAD correlator with respect to resource usage for a real-time three-dimensional vision system. Regular structures, linear data flow and abundant parallelism make the correlation algorithm a good candidate for a reconfigurable hardware. We implemented two versions of SAD correlator in HDL and synthesized them to determine resource requirements and performance. From the experiment we show that the SAD correlator fits into reconfigurable hardware in marginal cost and can handle about 30 frames/sec with $640{\times}480$ images.

• Journal of the Society of Disaster Information
• /
• v.17 no.2
• /
• pp.245-253
• /
• 2021

Purpose: This study develops a risk prediction model that predicts the risk of a fire site by using initial information such as building information and reporter acquisition information, and supports effective mobilization of fire fighting resources and the establishment of damage minimization strategies for appropriate responses in the early stages of a disaster. Method: In order to identify the variables related to the fire damage scale on the fire statistics data, a correlation analysis between variables was performed using a machine learning algorithm to examine predictability, and a learning data set was constructed through preprocessing such as data standardization and discretization. Using this, we tested a plurality of machine learning algorithms, which are evaluated as having high prediction accuracy, and developed a risk prediction model applying the algorithm with the highest accuracy. Result: As a result of the machine learning algorithm performance test, the accuracy of the random forest algorithm was the highest, and it was confirmed that the accuracy of the intermediate value was relatively high for the risk class. Conclusion: The accuracy of the prediction model was limited due to the bias of the damage scale data in the fire statistics, and data refinement by matching data and supplementing the missing values was necessary to improve the predictive model performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1102-1107
• /
• 2004

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

• Korean Journal of Remote Sensing
• /
• v.23 no.4
• /
• pp.297-309
• /
• 2007

The first Korean geostationary weather satellite, Communications, Oceanography and Meteorology Satellite (COMS) will be launched in 2008. The ground station for COMS needs to perform geometric correction to improve accuracy of satellite image data and to broadcast geometrically corrected images to users within 30 minutes after image acquisition. For such a requirement, we developed automated and fast geometric correction techniques. For this, we generated control points automatically by matching images against coastline data and by applying a robust estimation called RANSAC. We used GSHHS (Global Self-consistent Hierarchical High-resolution Shoreline) shoreline database to construct 211 landmark chips. We detected clouds within the images and applied matching to cloud-free sub images. When matching visible channels, we selected sub images located in day-time. We tested the algorithm with GOES-9 images. Control points were generated by matching channel 1 and channel 2 images of GOES against the 211 landmark chips. The RANSAC correctly removed outliers from being selected as control points. The accuracy of sensor models established using the automated control points were in the range of $1{\sim}2$ pixels. Geometric correction was performed and the performance was visually inspected by projecting coastline onto the geometrically corrected images. The total processing time for matching, RANSAC and geometric correction was around 4 minutes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.568-574
• /
• 2006

User adaptive services have been important features in many applications. To provide such services, various techniques with various kinds of data are being used. In this paper, we propose a method to analyze user's past moving paths and predict the goal position and the path to the goal by observing the user's current moving path. We develop a spatiotemporal similarity measure between paths. We choose a past path which is the most similar to the current path using the similarity. Based on the chosen path, user's spatiotemporal position is estimated. Through experiments we confirm this method is useful and effective.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.111-117
• /
• 2008

In this paper, we describes the boxing motion recognition which is used in the part of games, animation. To recognize the boxing motion, we have used two algorithms, one is principle component analysis, the other is dynamic time warping algorithm. PCA is the simplest of the true eigenvector-based multivariate analyses and often used to reduce multidimensional data sets to lower dimensions for analysis. DTW is an algorithm for measuring similarity between two sequences which may vary in time or speed. We introduce and compare PCA and DTW algorithms respectively. We implemented the recognition of boxing motion on the motion capture system which is developed in out research, and depict the system also. The motion graph will be created by boxing motion data which is acquired from motion capture system, and will be normalized in a process. The result has implemented in the motion recognition system with five actors, and showed the performance of the recognition.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.69-80
• /
• 1999

Recently, social requirements of personal identification techniques are rapidly expanding in a number of new application ares. Especially fingerprint recognition is the most important technology. Fingerprint recognition technologies are well established, proven, cost and legally accepted. Therefore, it has more spot lighted among the any other biometrics technologies. In this paper we propose a new on-line fingerprint recognition algorithm for non-inked type live scanner to fit their increasing of security level under the computing environment. Fingerprint recognition system consists of two distinct structural blocks: feature extraction and feature matching. The main topic in this paper focuses on the feature matching using the fingerprint minutiae (ridge ending and bifurcation). Minutiae matching is composed in the alignment stage and matching stage. Success of optimizing the alignment stage is the key of real-time (on-line) fingerprint recognition. Proposed alignment algorithm using clique shows the strength in the search space optimization and partially incomplete image. We make our own database to get the generality. Using the traditional statistical discriminant analysis, 0.05% false acceptance rate (FAR) at 8.83% false rejection rate (FRR) in 1.55 second average matching speed on a Pentium system have been achieved. This makes it possible to construct high performance fingerprint recognition system.

• Journal of Digital Contents Society
• /
• v.8 no.3
• /
• pp.347-353
• /
• 2007

As the number of channels and programs are increasing dramatically, a viewer seriously needs to book a program at the very time of watching its promotion program by "only one time" pressing remote controller's button. The program reserving system requiring to search a program via EPG is usually hard to operate and some researches that allow a viewer to book a program via its promotion program require additional heavy facilities such as image processing or ultra-frequency recognizing systems. In this paper, a new program reservation system is introduced. the system allows a viewer to book a program via its promotion program. The system is conformable to MHP (which is the data service standard most widely adopted in the world) so that the broadcasting stations need no additional equipments to implement it as long as they follow the MHP standard.