• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.249-250
• /
• 2009

음향 신호 이미지 처리, human vision 등의 분야에서 널리 쓰이는 wavelet transform의 가장 간단한 형태인 one-dimension haar wavelet transform을 CUDA로 구현하고 hardware 특성을 살린 optimizing을 함으로써 Data-parallelism의 성능과 CUDA memory architecture의 상관 관계를 살펴본다.

• 한국정보과학회논문지:데이타베이스
• /
• 제32권4호
• /
• pp.345-361
• /
• 2005

변환공간 색인이란 원공간 상의 공간 객체들을 변환공간 상의 크기가 없는 점들로 변환하여 색인한 후에 이들을 다루는 구조로, 이를 활용하는 조인 알고리즘은 크기가 없는 점들을 다루기 때문에 최적화가 상대적으로 단순하다는 장점을 가진다. 하지만, R 트리와 같은 원공간 색인에는 적용될 수 없는 단점을 가진다. 이러한 단점을 해결하는 방법으로 저자들 은 변환공간 뷰라는 개념을 사용하여 두 원공간 색인들을 변환공간에서 조인하는 변환공간 뷰 조인 알고리즘(transform-space view) join algorithm)을 제안한 바 있다. 여기서 변환공간 뷰(transform-space view)란 원공간 색인에 대한 가상의 변환공간 색인으로서 이미 구축된 원공간 색인을 구조적으로 변경하지 않고서도 가상의 변환공간 색인으로 해석하여 원공간 색인이 변환공간에서 조인될 수 있게 한다. 변환공간 뷰 조인 알고리즘에서 디스크 페이지 액세스 순서는 공간 채움 곡선에 의해 결정되는데, 이는 조인 성능에 큰 영향을 미친다. 본 논문에서는 변환공간 뷰 조인 알고리즘을 최적화 하는 방법으로 새로운 공간 채움 곡선인 적응형 행 기준 순서(adoptive row major order: ARM order)를 제안한다. 적응형 행 기준 순서는 주어진 버퍼 크기에 따라 디스크 페이지 액세스 순서를 적응적으로 조정하여 원패스 버퍼 크기(한 페이지 당 한번의 디스크 액세스를 보장하는 최소 버퍼 크기)와 디스크 액세스 횟수를 크게 줄인다. 정형적인 분석과 실험을 통하여 적응형 행 기준 순서를 사용하는 변환공간 뷰 조인 알고리즘의 우수성을 보인다. 실험 결과, 다른 공간 채움 곡선을 사용하는 변환공간 뷰 조인 알고리즘과 비교하여 적응형 행 기준 순서는 원패스 버퍼 크기를 최대 21.3배 줄이고, 디스크 액세스 횟수를 최대 $74.6\%$ 줄인다. 또한, R 트리를 원공간에서 조인하는 알고리즘들과 비교하여 원패스 버퍼 크기를 최대 15.7배 줄이고, 디스크 액세스 횟수를 최대 $65.3\%$ 줄인다.

• KIEE International Transactions on Power Engineering
• /
• 제11A권4호
• /
• pp.1-8
• /
• 2001

This paper presents a discrete wavelet transform approach for detecting voltage sags initialized by fault conditions and starting of larger motors. The proposed technique is based on utilizing the summation value of D1(at scale 1) coefficients in multiresolution analysis(MRA) based on the discrete wavelet transform. In this paper, the proposed technique is tested under various cases of voltage sags. It is shown that the voltage sag detection technique based on the wavelet transform is a satisfactory and reliable method for detecting voltage sags in power quality disturbance analysis.

• 정보와 통신
• /
• 제11권8호
• /
• pp.60-77
• /
• 1994

This paper presents a survey of video coding schemes which use wavelet transform for the videophone on very low bit rate commun ication chan nel( ego 10 Kbps Public Service Telephone Network). Firstly, we introduce the standardization efforts to make the low bit rate videophone architecture and the typical application of low bit rate video coding scheme. Secondly, we summarize the several requirements on videophone, delay, encoder/decoder complexity, low bitrate, and progressive transmission capability. Third, we review the basic theory of wavelet transform without much mathematics. We compare the wavelet transform with short-time fourier transform and subband filters. Fourth, we summarize the video coding schemes proposed so far, and evaluate them with Ule requirements. Lastly, we conclude with fu¬ture research directions.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2005년도 추계학술대회 논문집
• /
• pp.302-305
• /
• 2005

Recently, many methods to analyze signal have been proposed and representative methods are the Fourier transform and wavelet transform. In these methods, the Fourier transform represents signal with combination cosine and sine at all locations in the frequency domain. However, it doesn't provide time information that particular frequency occurs in signal and denpends on only the global feature of the signal. So, to improve these points the wavelet transform which is capable of multiresolution analysis has been applied to many fields such as speech processing, image processing and computer vision. And the wavelet transform, which uses changing window according to scale parameter, presents time-frequency localization. In this paper, we proposed a new approach using a wavelet of cosine and sine type and analyzed features of signal in a limited point of frequency-time plane.

• Journal of applied mathematics & informatics
• /
• 제31권1_2호
• /
• pp.165-177
• /
• 2013

In this paper, we apply Homotopy perturbation transform method (HPTM) for solving singular fourth order parabolic partial differential equations with variable coefficients. This method is the combination of the Laplace transform method and Homotopy perturbation method. The nonlinear terms can be easily handled by the use of He's polynomials. The aim of using the Laplace transform is to overcome the deficiency that is mainly caused by unsatisfied conditions in other semi-analytical methods such as Homotopy perturbation method (HPM), Variational iteration method (VIM) and Adomain Decomposition method (ADM). The proposed scheme finds the solutions without any discretization or restrictive assumptions and avoids the round-off errors. The comparison shows a precise agreement between the results and introduces this method as an applicable one which it needs fewer computations and is much easier and more convenient than others, so it can be widely used in engineering too.

• Korean Journal of Mathematics
• /
• 제9권2호
• /
• pp.133-147
• /
• 2001

In this paper, we introduce the concepts of multiple $L_p$ analytic Fourier-Feynman transform ($1{\leq}p$ < ${\infty})$ and a convolution product of functionals on abstract Wiener space and verify the existence of the multiple $L_p$ analytic Fourier-Feynman transform for functionls in the Fresnel class. Moreover, we verify that the Fresnel class is closed under the $L_p$ analytic Fourier-Feynman transformation and the convolution product, respectively. And we establish some relationships among the multiple $L_p$ analytic Fourier-Feynman transform and the convolution product on the Fresnel class.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1662-1665
• /
• 2004

A real-time joint transform correlator by using JPEG-compressed reference images is proposed as practical solution to storage problem and improvement of processing time of automatic target recognition system [1]. Effects of compression on recognition performance of join transform correlator are quantitatively investigated under situations where the target is suffered from noise and has contrast difference with respect to the reference. Two images with different spatial-frequency contents and contrast were used as the test scenes. The simulation results show that, the recognition performance of joint transform correlator by using the compressed reference images with high spatial-frequency components is more sensitive to noise and contrast difference than the low spatial-frequency image.

• 충청수학회지
• /
• 제19권1호
• /
• pp.79-99
• /
• 2006

In this paper, we define a class of functional defined on a very general function space $C_{a,b}[0,T]$ like a Fresnel class of an abstract Wiener space. We then define the multiple $L_p$ analytic generalized Fourier-Feynman transform and the generalized convolution product of functionals on function space $C_{a,b}[0,T]$. Finally, we establish some relationships between the multiple $L_p$ analytic generalized Fourier-Feynman transform and the generalized convolution product for functionals in $\mathcal{F}(C_{a,b}[0,T])$.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.89-92
• /
• 2000

In this paper, an effective image restoration using Genetic Algorithm(GA) in wavelet transform region is proposed. First, a wavelet transform is used for decomposition of a blurred image with white Gaussian noise as a preprocessing of the proposed method. The wavelet transform decomposes a degraded image into a wavelet subband coefficient planes. In this wavelet transformed subband coefficient planes, three highest subbands is composed entirely of noise elements on a degraded image. So, these subbands are removed. And remained subbands except for the lowest subband are individually applied to GA. For the performance evaluation, the proposed method is compared with a conventional single GA algorithm and a conventional hybrid method of wavelet transform and GA for a Lenna image and a boat image. As an experimental result, the proposed algorithm is prior to a conventional methods as each PSNR 3.4dB, 1.3dB.