• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.7
• /
• pp.1122-1130
• /
• 2001

In this paper, by applying the spectral domain wavelet concept to Green function, a fast spectral domain calculation of scattered fields is proposed to get the solution for the radiation integral. The spectral domain wavelet transform to represent Green function is implemented equivalently in space via the constant-Q windowing technique. The radiation integral can be calculated efficiently in the spectral domain using the windowed Green function expanded by its eigen functions around the observation region. Finally, the same formulation as that of the conventional fast multipole method (FMM) is obtained through the windowed Green function and the spectral domain calculation of the radiation integral.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.169-180
• /
• 2007

This paper discusses a new unsupervised XML document clustering technique based on the function transform and FFT(Fast Fourier Transform). An XML document is transformed into a discrete function based on the hierarchical nesting structure of the elements. The discrete function is, then, transformed into vectors using FFT. The vectors of two documents are compared using a weighted Euclidean distance metric. If the comparison is lower than the pre specified threshold, the two documents are considered similar in the structure and are grouped into the same cluster. XML clustering can be useful for the storage and searching of XML documents. The experiments were conducted with 800 synthetic documents and also with 520 real documents. The experiments showed that the function transform and FFT are effective for the incremental and unsupervised clustering of XML documents similar in structure.

• Korean Journal of Remote Sensing
• /
• v.13 no.2
• /
• pp.85-98
• /
• 1997

A geometric model of pushbroom-type linear CCD camera images is proposed in this paper. At present, this type of cameras are used for obtaining almost all kinds of high-resolution optical images from satellites. The proposed geometric model includes not only a forward transformation which is much more efficient. An inverse transformation function cannot be derived analytically in a closed form because the focal point of an image varies with time. In this paper, therefore, an iterative algorithm in which a focal point os converged to a given pixel position is proposed. Although the proposed model can be applied to any pushbroom-type linear CCD camera images, the geometric model of the high-resolution multi-spectral camera on-board KITSAT-3 is used in this paper as an example. The flight model of KITSAT-3 is in development currently and it is due to be launched late 1998.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.3
• /
• pp.291-298
• /
• 2019

In this paper, we propose a Fresnel transform method using various wavelet functions to efficiently decompose digital holograms. After implementing the proposed wavelet function-based Fresnelet transforms, we apply it to the digital hologram and analyze the energy characteristics of the coefficients. The implemented wavelet transform-based Fresnelet transform is well suited for reconstructing and processing holograms which are optically obtained or generated by computer-generated hologram technique. After analyzing the characteristics of the spline function, we discuss wavelet multiresolution analysis method based on it. Through this process, we proposed a transform tool that can effectively decompose fringe patterns generated by optical interference phenomena. We implement Fresnelet transform based on wavelet function with various decomposition properties and show the results of decomposing fringe pattern using it. The results show that the energy distribution of the coefficients is significantly different depending on whether the random phase is included or not.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.4 no.2
• /
• pp.82-90
• /
• 1993

전자파에 의한 산란현상의 해석은 지금까지 주로 시간조화함수의 형태를 지닌 전원에 의한 정 상상태의 산란에 관하여 이루어졌다. 그러나 레이다나 피파괴 검사, 전송선로 점검 등의 응용에서는 주로 펄스형태의 전자파를 사용하며, 따라서 시간에 따라 변화하는 함수형태의 전원에 의한 전자파의 산란해 석이 중요한 문제로 등장하였다. 또한 통신선로에서 외부의 잡음에 대한 혼신 등을 해석하거나, 낙뢰가 송 전선로에 미치는 영향을 해석하는 데에도 펄스신호의 산란해석이 필수적이다. 일반적인 함수의 형태를 지닌 전원에 의한 산란현상을 해석하기 위해서는 전원함수를 Fourier 변환하 여 주파수 영역의 스펙트럼을 구하고, 주파수영역에서의 산란해를 이용하여 Fourier 역변환을 하여 시간 영역의 해를 구할 수 있다. 주파수 영역에서의 산란판의 해를 Fourier 역변환 하기 위해서는 적분을 행하여야 하며, 일반적으로 적분과정에서 매우 복잡한 계산이 필요하고, 산란체의 구조가 복잡하여 해석 적인 해를 구할수 없는 경우에는 해석적으로 시간영역의 해를 구하는 것이 불가능하다. 시변 함수에 의 한 산란파를 구하기 위한 수치해석적 방법으로는 모멘트방법이나 유한요소법(Finite Element Method), 경계요소법(Boundary Element Method), 유한차분법(Finite Difference Method)등이 있으며, 해석적 해 를구할 수 없는 경우에 적용할 수 있는 반면에 많은 계산량이 요구된다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.326-335
• /
• 2002

Recently there have been a number of researches to provide code mobility to lazy functional language (LFL) programs by translating LFL programs to Java programs. These approaches are basically baled on architectural similarities between abstract machines of LFLs and Java. The abstract machines of LFLs and Java programming language, Spineless Tagless G-Machine(STGM) and Java Virtual Machine(JVM) respectively, share important common features such as built- in garbage collector and stack machine architecture. Thus, we can provide code mobility to LFLs by translating LFLs to Java utilizing these common features. In this paper, we propose a new translation scheme which fully utilizes architectural common features between STGM and JVM. By redefining STGM as an eval-apply evaluation model, we have defined a new translation scheme which utilizes Java Virtual Machine Stack for function evaluation and totally eliminates stack simulation which causes array manipulation overhead in Java. Benchmark program translated to Java programs by our translation scheme run faster on JDK 1.3 than those translated by the previous schemes.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.75-76
• /
• 2008

이산시간 모델로부터 시간응답 설계 명세를 만족시키도록 직접 디지털 제어기를 설계하는 새로운 방법을 제시한다 R-S-T형의 고정된 제어기 구조에서 폐루프 전달함수가 원하는 기준전달함수와 일치하도록 제어기 이득을 구한다. 시간 응답을 만족시키는 목표전달함수는 w-영역에서 CRA를 이용하여 선택되며 이 함수를 z-영역으로 변환시켜 얻는다. 예제를 통해 제시한 방법의 유용성을 보이고 극배치 방식과 비교한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.6
• /
• pp.569-574
• /
• 2000

본 논문에서는 유전 알고리듬을 이용한 웨이브렛 기반 퍼지 시스템 모델링에 대한 새로운 방법을 제안한다. 유전 알고리듬을 이용하여 웨이브렛 변환의 계수를 동정한 후 웨이브렛 변환과 등가관계에 있는 퍼지 시스템 모델을 형성한다. 웨이브렛 변환의 장점인 에너지 압축에 의해 적은 수의 계수를 이용하여도 정확한 모델을 획득할 수 있고 이는 적은 수의 규칙으로 정확한 퍼지 시스템 모델을 구성할 수 있다는 것을 의미한다. 또한 급격한 변화를 갖는 함수를 잘 나타낼 수 있다는 웨이브렛 변환의 장점에 의하여 기존의 퍼지 모델링으로는 좋은 모델을 획득할 수 없었던 문제를 해결하였다. 제안된 퍼지 모델의 우수성을 비선형성이 큰 함수를 모델링하고 이전의 연구와 비교함으로써 입증한다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.2
• /
• pp.121-134
• /
• 2013

The transverse cylindrical projection has been used in Korea since 1910s when the nationwide geodetic network was firstly established. However, the projection has a number of different types of functions according to a way of its mathematical derivation as well as a section of its coefficients and terms, for instance Gauss- Schreiber(GS) and Gauss-Kruger(GK) types. Although the transverse cylindrical projection itself is assigned to a system, projected coordinates would be diverse with respect to the function used in the actual calculation. In order to investigate impact of functions used in the computation, five different equations (i.e., 2 GS and 3 GK) were implemented in this study by using MATLAB. A series of numerical simulation tests has been carried out to compare and characterize them in terms of projection accuracy, difference of projected coordinates and distortion. Furthermore, a comparison between GS and GK function was made under the Korean gridding system, consisting of four zones. Results from the numerical computations were qualitatively analyzed and summarized in this paper.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.303-308
• /
• 2004

The Gabor cosine and sine transform can be applied to image and video compression algorithm by representing image frequency components locally The computational complexity of forward and inverse matrix transforms used in the compression and decompression requires O($N^3$)operations. In this paper, the length of basis functions is truncated to produce a sparse basis matrix, and the computational burden of transforms reduces to deal with image compression and reconstruction in a real-time processing. As the length of basis functions is decreased, the truncation effects to the energy of basis functions are examined and the change in various Qualify measures is evaluated. Experiment results show that 11 times fewer multiplication/addition operations are achieved with less than 1% performance change.