• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2002.11a
• /
• pp.127-135
• /
• 2002

수치지도를 구성하고 있는 요소 중 주기 데이터는 POI(Point of Interest)라는 원시 데이터의 정확한 위치 및 부가적인 속성정보를 요하는데, 이는 실사와 입력 그리고 여러 단계의 가공 체계를 통하여 구축된다. 본 연구는 구축된 POI로부터 주기 데이터로의 가공 공정에 대해서 수행하였고, 이를 다양한 수치지도 사양에 유연하게 적용하고 수작업을 최소화할 수 있도록 자동배치 알고리즘을 개발하였다. 또한, 본 연구는 그 결과로 시가지도 영역과 시가지도 외 지역으로 나누어 배치전과 배치 후 결과를 지도 레벨별로 분석하고, 연구 수행 중에 도출된 장점들과 향후 보완점에 대해서 언급하고자 한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2010.05a
• /
• pp.28-30
• /
• 2010

본 논문은 단거리 전용 무선을 이용하여 도로를 주행하는 운전자들에게 실시간 POI(Point of Interest) 정보를 효과적으로 수집 가공 분배 제공할 수 있는 LBB(Location Based Boardcasting) 개발 하였다. 또한 LBB 기술 요소 장치를 개발하여 보급함으로써 운전자 지점부근의 상세하고 다양한 정보를 제공하는 텔레매틱스 및 지능형 정보 제공 시스템의 핵심 기술을 연구 개발 하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.83-85
• /
• 1986

The error differential equations which are derived by using the first error model are uniformly asymptotial stable if the input is bounded and sufficiently rich. In the adaptive control, the speed of convergence of system output or parameter error in such cases is of both practical and theoretical interest. In this paper, the adaptive algorithms(Gradient algorithm, Intergral algorithm) are discussed from the point of view of speed convergence and the modification of adaptive law for prohibition of overadaptation is discussed. The result is compared among this algorithms and the adaptive gain is choosed by this result(the speed of convergence).

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.2
• /
• pp.83-96
• /
• 2011

This work proposes a binomial method for pricing the cliquet options, which provide a guaranteed minimum annual return. The proposed binomial tree algorithm simplifies the standard binomial approach, which is problematic for cliquet options in the computational point of view, or other recent methods, which may be of intricate algorithm or require pre- or post-processing computations. Our method is simple, efficient and reliable in a Black-Scholes framework with constant interest rates and volatilities.

• Communications for Statistical Applications and Methods
• /
• v.7 no.3
• /
• pp.789-798
• /
• 2000

The mean residual function is the expected remaining life of an item at age x. The problem of trend change in the mean residual life is great interest in the reliability and survival analysis. In this paper, we develop a family of test statistics for testing whether or not the mean residual life changes its trend. The asymptotic normality of the test statistics is established. Monte Carlo simulations are conducted to study the performance of our test statistics.

• School Mathematics
• /
• v.1 no.2
• /
• pp.451-459
• /
• 1999

The teaching through the graphics in the newspaper which students look at easily, will encourage the student's interest and make them learn the principle of representing the statistics graphics. In this paper, we analyzed the cases of the bar chart and the graph of broken lines which is seen many in the newspaper. Through showing the good point and fault of the graphic cases, we intend that students know the principle of analyzing or making the statistics graphics.

• Kyungpook Mathematical Journal
• /
• v.53 no.1
• /
• pp.143-148
• /
• 2013

The theory of generalized Bessel functions is reformulated within the framework of an operational formalism using the multiplier representation of the Lie group $T_3$ as suggested by Miller. This point of view provides more efficient tools which allow the derivation of generating functions of generalized Bessel functions. A few special cases of interest are also discussed.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.4
• /
• pp.284-290
• /
• 2013

Feature detection is very important to image processing area. In this paper we compare and analyze some characteristics of image processing algorithms for corner and blob feature detection. We also analyze the simulation results through image matching process. We show that how these algorithms work and how fast they execute. The simulation results are shown for helping us to select an algorithm or several algorithms extracting corner and blob feature.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.563-570
• /
• 2007

There has been a considerable research interest in medical communities for neuronal fiber tracking with magnetic resonance diffusion tensor imaging(DTI). DTI data have abundant structural boundaries that need to be preserved during interpolation to facilitate fiber tracking. Sigmoid function has been used in recent papers but the sigmoid function still is not good enough to be served as an positive interpolation in mathematical point of view. In this paper, we construct and provide two families positive cardinal interpolation functions.

• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.83-99
• /
• 2016

The latest research on the image-based fingerprint matching approaches indicates that they are less complex than the minutiae-based approaches when it comes to dealing with low quality images. Most of the approaches in the literature are not robust to fingerprint rotation and translation. In this paper, we develop a robust fingerprint matching system by extracting the circular region of interest (ROI) of a radius of 50 pixels centered at the core point. Maximizing their orientation correlation aligns two fingerprints that are to be matched. The modified Euclidean distance computed between the extracted orientation features of the sample and query images is used for matching. Extensive experiments were conducted over four benchmark fingerprint datasets of FVC2002 and two other proprietary databases of RFVC 2002 and the AITDB. The experimental results show the superiority of our proposed method over the well-known image-based approaches in the literature.