• Computational Structural Engineering : An International Journal
• /
• v.2 no.1
• /
• pp.43-50
• /
• 2002

This paper presents a method to predict dynamic responses of floating bodies in the time domain. Because of the frequency-dependence of the radiation wave forces, the memory effect must be taken into account when the responses are evaluated in the time domain. Although the formulations firstly developed by Cummins (1962) have been well-known for this purpose, the effective numerical procedure has not been established yet. This study employs FFT (Fast Fourier Transform) algorithm to evaluate the memory effect function, and the equations of motion of an integro-differential type are solved by Newmark-β method. Numerical examples for a truncated circular cylinder have indicated the effectiveness of the proposed numerical procedure.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.95-99
• /
• 2011

Digital forensics is the emerging research field for determining digital forgeries. Key issues of the tampered images are to solve the problems for detecting the interpolation factor and the tampered regions. This paper describes a method to detect the interpolation factors and the forged maps using the differential method and fast Fourier transform(FFT) along the horizontal, vertical, and diagonal direction, respectively from digital filtered tampered images. The detection map can be used to find out interpolated regions from the tempered image. Experimental results demonstrate the proposed algorithm proves effective on several filtering images by adobe $Photoshop^{TM}$ and show a ratio of detecting the interpolated regions and factors from digital filtered composite images.

• Journal of Korea Multimedia Society
• /
• v.24 no.11
• /
• pp.1552-1559
• /
• 2021

Convolution neural networks (CNNs) show notable performance in image processing and are used as representative core models. CNNs extract and learn features from large amounts of train dataset. In general, it has a structure in which a convolution layer and a fully connected layer are stacked. The core of CNN is the convolution layer. The size of the kernel used for feature extraction and the number that affect the depth of the feature map determine the amount of weight parameters of the CNN that can be learned. These parameters are the main causes of increasing the computational complexity and memory usage of the entire neural network. The most computationally expensive components in CNNs are fully connected and spatial convolution computations. In this paper, we propose a Fourier Convolution Neural Network that performs the operation of the convolution layer in the Fourier domain. We work on modifying and improving the amount of computation by applying the fast fourier transform method. Using the MNIST dataset, the performance was similar to that of the general CNN in terms of accuracy. In terms of operation speed, 7.2% faster operation speed was achieved. An average of 19% faster speed was achieved in experiments using 1024x1024 images and various sizes of kernels.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.145-148
• /
• 2001

This paper presents a phase-based stereo matching algorithm in order to efficiently extract 3-dimensional objects from two 2D images. Conventional phase-based methods, especially using windowed Fourier phases, inherit good properties in the cage of hierarchical approaches, because they basically use a multi-resolution phase map. On the contrary, their computational cost is too heavy. Therefore, a fast hierarchical approach, using multi-resolution phase-based strategy and reducing redundancies of phase calculations based on FFT concept is proposed in this paper. In addition, a structural matching algorithm on the phase domain is presented to improve the matching quality. In experimental results. it is shown that the computation loads are considerably reduced about 8 times and stable outputs are obtained from various images.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.261-262
• /
• 2007

This paper proposes a new IFFT(Inverse Fast Fourier Transform) algorithm, which is proper for IMDCT(Inverse Modified Discrete Cosine Transform) of MPEG-2 AAC(Advanced Audio Coding) decoder. The IFFT used in $2^N$-point IMDCT employ the bit-reverse data arrangement of inputs and N/4-IFFT to reduce the calculation cycles. We devised a new data arrangement algorithm of IFFT input and N/$4^{n+1}$-IFFT and can reduce multiplication cycles, addition cycles, and ROM size.

• ETRI Journal
• /
• v.29 no.1
• /
• pp.36-44
• /
• 2007

The wave concept iterative procedure (WCIP) is used to analyze arbitrarily shaped frequency selective surfaces (FSS). The WCIP method is developed from the fast modal transform based on a two-dimensional fast Fourier transform algorithm. Using the proposed procedure, less computing time and memory are needed to calculate the scattering parameters of the FSS structure. The method is applied to the modeling of an FSS structure of a rectangular patch and a comparison with experimental results confirms good agreement.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.851-858
• /
• 1988

In this paper, we propose two different VLSI architectures for the parallel computation of DCT (discrete cosine transform) algorithm. First, it is shown that the DCT algorithm can be implemented on the existing systolic architecture for the DFT(discrete fourier transform) by introducing some modification. Secondly, a new prime factor DCT algorithm based on the prime factor DFT algorithm is proposed. And it is shown that the proposed algorihtm can be implemented in parallel on the systolic architecture for the prime factor DFT. However, proposed algorithm is only applicable to the data length which can be decomposed into relatively prime and odd numbers. It is also found that the proposed systolic architecture requires less multipliers than the structures implementing FDCT(fast DCT) algorithms directly.

• ETRI Journal
• /
• v.8 no.1
• /
• pp.3-5
• /
• 1986

본 고는 image의 pattern을 identify하기 위해 그 image data의 FFT(Fast Fourier Transform)를 취한 후 에너지 스펙트럼의 크기를 폐적분한 값으로 부터 original input object와 비교대상의 object에 대한 mean square error 값의 차이를 시뮬레이션한 결과 얻은 threshold value와 비교함으로써 matching 을 구현하기 위함이다. Vax11-780/vms와 Fortran77 Language를 사용하여 시뮬레이션을 수행하였으며 Tektronix graphic terminal이 digitized된 이미지의 모니터용으로 사용되었다.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2614-2616
• /
• 2000

This paper presents the Walsh-Fourier conversion algorithm and Signal Analysis Technique. The Fourier coefficients are determined as the combinations of the Walsh coefficients in terms of the new Walsh-Fourier conversion algorithm. This paper checks the analysis of the Walsh-Fourier spectra and the approximate synthesis of the waveform via one example.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.851-856
• /
• 1987

A direct computation algorithm of two dimensional fast Fourier transform (2D-FFT) is considered here for implementation in mesh connected multiprocessor array of both a 2D-toroidal and a rectangular type. Results are derived for a hardware algorithm including data allocation and interprocessor communications. A performance comparison is carried out between the proposed direct 2D-FFT computation and the conventional one to show that a new algorithm gives higher speedup under a reasonable assumption on the speeds of operations.