• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.227-238
• /
• 2008

As the internet users rise up rapidly, DNS information forgery can cause severe socio-economic damages. However, most studies on DNS information security reached the breaking point in applying to actual circumstances because of the limit of existing DNS system version, the increasement of management burden and etc. The paper proposes the real-time method for detecting cache poisoning of DNS system independent of analysing the DNS forgery types in the current DNS service environment. It also proposes the method of enhancing the reliability for the cache information of Recursive DNS system by post-verifying the cache information of the DNS system.

• Journal of the Korean Geophysical Society
• /
• v.4 no.4
• /
• pp.231-238
• /
• 2001

In this paper, an efficient LP method ofr discrete harmonic spectra is proposed and discussed. A new efficient LP method is a combination of recursive and frequency selective LP. While the recursive LP provides better spectral matching in spectral hills, frequency selective LP eliminates numerical instability and improves spectral matching when the harmonics are confined in the low frequncy region. The proposed LP method is applied to the HILN coder. Simulation results using a verification model(VM) software for real audio signals show a definite trend of significant improvement.

• The Journal of Engineering Research
• /
• v.5 no.1
• /
• pp.37-44
• /
• 2004

n this paper, an efficient LP method for discrete harmonic spectra is proposed and discussed. A new efficient LP method is a combination of recursive and frequency selective LP. While the recursive LP provides better spectral matching in spectral hill, frequency selective LP eliminates numerical instability and improves spectral matching when the harmonics are confined in the low frequency region. The proposed LP method is applied to the HILN coder. Simulation results using a verification model(VM) software for real audio signals show a definite trend of significant improvement.

• 전기의세계
• /
• v.31 no.3
• /
• pp.204-208
• /
• 1982

The objective of this paper is to present a digital method for improving the lateral resolution of the B-scan images in the medical applications of ultrasound. The method is based upon a mathematical model of the lateral blurring caused by the finite beam width of the transducers. This model provides a simple method of applying a recursive scheme for image restoration with fast computation time. The point spread function (P.S.F.) can be measured by the reflective signals after scanning the small pins located along the depth of interest. From the measured P.S.F., one can compute the coefficient matrices of the inverse discrete-time dynamic state variable equation of the blurring process. Then, a recursive scheme for deblurring is applied to the recorded B-scan to improve the lateral resolution. One major advantage of the present recursive scheme over the transform method is in its applicability for the space-variant imaging, such as in the case of the rotational movement of transducer.

• 한국가시화정보학회:학술대회논문집
• /
• 2001.12a
• /
• pp.75-85
• /
• 2001

The hierarchic recursive local-correlation PIV algorithm with CBC(correlation based correction) method was developed to increase the spatial resolution of PIV results and to reduce error vectors. This new algorithm was applied to the single-frame and double-frame cross-correlation PIV techniques. In order to evaluate its performance, the recursive algorithm was tested using synthetic images, PIV standard images from Visualization Society of Japan, real flows including ventilation flow inside a vehicle passenger compartment and wake behind a circular cylinder with rib let surface. As a result, most spurious vectors were suppressed by employing CBC method. In addition, the hierarchical recursive correlation algorithm improved largely the sub-pixel accuracy of PIV results by decreasing the interrogation window size, increasing spatial resolution significantly.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.3
• /
• pp.427-432
• /
• 2018

This paper uses a recursive least squares method to estimate the projectile motion trajectory of an object in real time. The equations of motion of the object are obtained considering the air resistance which occurs in the actual experiment environment. Because these equations consider air resistance, parameter estimation of nonlinear terms is required. However, nonlinear recursive least squares estimation is not suitable for estimating trajectory of projectile in that it requires a lot of computation time. Therefore, parameter estimation for real-time trajectory prediction is performed by recursive least square estimation after using Taylor series expansion to approximate nonlinear terms to polynomials. The proposed method is verified through experiments by using VICON Bonita motion capture system which can get three dimensional coordinates of projectile. The results indicate that proposed method is more accurate than linear Kalman filter method based on the equations of motion of projectile that does not consider air resistance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.3
• /
• pp.224-229
• /
• 2012

In this paper, we propose a correction method for astronomical telescope using recursive least square method. There are two ways to move a telescope : equatorial operation and altazimuth operation. We must align polar axis of a equatorial telescope with the north celestial pole and adjust the horizontal axis of a altazimuth telescope exactly to match the celestial coordinate system with the telescope coordinate system. This process needs time and expertise. We can skip existing process and correct a tracking error easily by deriving the relationship of the celestial coordinate system and the telescope coordinate system using the proposed correction method. We obtain the coordinate of a celestial body in the celestial coordinate system and the telescope coordinate system and derive a transformation matrix through the obtained coordinate. We use recursive least square method to estimate the unknown parameters of a transformation matrix. Finally, we implement a telescope control system using a microprocessor and verify the performance of the correction method. Through an experiment, we show the validity of the proposed correction method.

• Journal of the Korean Institute of Navigation
• /
• v.20 no.4
• /
• pp.99-109
• /
• 1996

Though median filter is used for removing noise and smoothing image. But, the result of it has distortion around edge. And then, this paper proposes new noise removing algorithm by recursive morphological processing. Basic operation is same each other, but there is some different processing method between recursive morphology and general morphology theory. This recursive morphological filter can be viewed as the weighted order static filter, and then it has a weighted SE(structuring element). Especially using this algorithm to remove the 10% gaussian noise, this paper confirmed that PSNR is improved about 0.642~1.5757 db reserving edge well better than the results of the traditional median filter.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.2E
• /
• pp.43-48
• /
• 2006

Abstract-Using the recursive generalized eigendecomposition method, we develop a recursive form solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. Simulations demonstrate that DLS outperforms ordinary least square for certain types of deconvolution problems.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1542-1552
• /
• 1999

자료 병렬성이란 자료 집합의 원소들에 대하여 동일한 작업을 동시에 수행하므로써 얻어지는 병렬성을 말한다. 함수형 언어에서 자료 집합에 대한 반복 수행은 재귀적 자료형에 대한 재귀 함수에 의하여 표현된다. 본 논문에서는 이러한 재귀 함수를 자료 병렬 프로그램으로 변환하기 위한 병렬화 방법을 제시한다. 생성되는 병렬 프로그램의 병렬 수행 구조로는 일반적인 형태의 재귀적 자료형에 대하여 정의되는 다형적인 자료 병렬 연산을 사용하여 트리, 리스트 등과 같은 일반적인 재귀적 자료 집합에 대한 자료 병렬 수행이 가능하도록 하였다. 재귀 함수의 병렬화를 위해서는, 함수를 이루는 각각의 계산들의 병렬성을 재귀 호출에 의해 존재하는 의존성에 기반하여 분류하고, 이에 기반하여 각각의 계산들에 대한 적절한 자료 병렬 연산을 사용하는 병렬 프로그램을 생성하였다.Abstract Data parallelism is obtained by applying the same operations to each element of a data collection. In functional languages, iterative computations on data collections are expressed by recursions on recursive data structures. We propose a parallelization method for data-parallel implementation of such recursive functions. We employ polytypic data-parallel primitives to represent the parallel execution structure of the object programs, which enables data parallel execution with general recursive data structures, such as trees and lists. To transform sequential programs to their parallelized versions, we propose a method to classify the types of parallelism in subexpressions, based on the dependencies of the recursive calls, and generate the data-parallel programs using data-parallel primitives appropriately.