• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• v.28 no.2
• /
• pp.339-353
• /
• 1998

The purpose of this study was to investigate whether a radiographic estimate of osseous fractal dimension and power spectrum of 2D discrete Fourier transform is useful in the characterization of structural changes in bone. Ten specimens of bone were decalcified in fresh 50 ml solutions of 0.1 N hydrochloric acid solution at cummulative timed periods of 0 and 90 minutes. and radiographed from 0 degree projection angle controlled by intraoral parelleling device. I performed one-dimensional variance. fractal analysis of bony profiles and 2D discrete Fourier transform. The results of this study indicate that variance and fractal dimension of scan line pixel intensities decreased significantly in decalcified groups but Fourier spectral analysis didn't discriminate well between control and decalcified specimens.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.6
• /
• pp.518-524
• /
• 2018

The cover song refers to live recordings or reproduced albums. This paper studies two-dimensional Fourier transform as a feature-dimension reduction method to search cover song fast. The two-dimensional Fourier transform is conducive in feature-dimension reduction for cover song search due to musical-key invariance. This paper extends the previous work, which only utilize the magnitude of the Fourier transform, by introducing an invariant from phase based on the assumption that adjacent frames have the same musical-key change. We compare the cover song retrieval accuracy of the Fourier-transform based methods over two datasets. The experimental results show that the addition of the invariant from phase improves the cover song retrieval accuracy over the previous magnitude-only method.

• Journal of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.265-294
• /
• 2004

In this paper, using a simple formula, we evaluate the conditional Fourier-Feynman transforms and the conditional convolution products of cylinder type functions, and show that the conditional Fourier-Feynman transform of the conditional convolution product is expressed as a product of the conditional Fourier-Feynman transforms. Also, we evaluate the conditional Fourier-Feynman transforms of the functions of the forms exp {$\int_{O}^{T}$ $\theta$(s,$\chi$(s))ds}, exp{$\int_{O}^{T}$ $\theta$(s,$\chi$(s))ds}$\Phi$($\chi$(T)), exp{$\int_{O}^{T}$ $\theta$(s,$\chi$(s))d${\zeta}$(s)}, exp{$\int_{O}^{T}$ $\theta$(s,$\chi$(s))d${\zeta}$(s)}$\Phi$($\chi$(T)) which are of interest in Feynman integration theories and quantum mechanics.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.473-476
• /
• 2003

We suggest 2 dimensional Fast Fourier Transform using Polynomial Transform and integer Fast Fourier Transform. Unlike conventional 2D-FFT using the direct quantization of twiddle factor, the suggested 2D-FFT adopts implemented by the lifting so that the suggested 2D-FFT is power adaptable and reversible. Since the suggested FFT performg integer-to-integer mapping, the transform can be implemented by only bit shifts and auditions without multiplications. In addition. polynomial transform severely reduces the multiplications of 2D-FFT. While preserving the reversibility, complexity of this algorithm is shown to be much lower than that of any other algorithms in terms of the numbers of additions and shifts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3438-3454
• /
• 2018

In this paper, we propose a robust blind watermarking scheme for high-definition video. In the embedding process, luminance component of each frame is transformed by 2-dimensional fast Fourier transform (2D FFT). A secret key is used to generate a matrix of random numbers for the security of watermark information. The matrix is transformed by inverse steerable pyramid transform (SPT). We embed the watermark into the low and mid-frequency of 2D FFT coefficients with the transformed matrix. In the extraction process, the 2D FFT coefficients of each frame and the transformed matrix are transformed by SPT respectively, to produce two oriented sub-bands. We extract the watermark from each frame by cross-correlating two oriented sub-bands. If a video is degraded by some attacks, the watermarks of frames contain some errors. Thus, we use an ensemble position-based error correcting algorithm to estimate the errors and correct them. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against various attacks. After embedding 64 bits of watermark into each frame, the average peak signal-to-noise ratio between original frames and embedded frames is 45.7 dB.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.106-109
• /
• 2009

Recently, image matching becomes important in Computer Aided Diagnosis (CAD) due to the huge amount of medical images. Specially, texture feature is useful in medical image matching. However, texture features such as co-occurrence matrices can't describe well the spatial distribution of gray levels of the neighborhood pixels. In this paper we propose a frequency domain-based texture feature extractor that describes the local spatial distribution for medical image retrieval. This method is based on 2D Local Discrete Fourier transform of local images. The features are extracted from local Fourier histograms that generated by four Fourier images. Experimental results using 40 classes Brodatz textures and 1 class of Emphysema CT images show that the average accuracy of retrieval is about 93%.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.6
• /
• pp.444-451
• /
• 2017

In this paper, we have evaluated and analyzed OTFS(Orthogonal Time Frequency Space) modulation and OTFS-MIMO(Multiple Input Multiple Output) system. OTFS modulation can concisely compensate delay-Doppler spreading effect by using 2D(2-Dimension) iDFT (inverse Discrete Fourier Transform) and DFT(Discrete Fourier Transform) operation. It enables OTFS system to transmit high-speed data. Especially, OTFS-MIMO system can transmit all data streams without performance degradation on high Doppler frequency channel. As simulation results, we have confirmed that $1{\times}1$ OTFS system's achievable rate is a similar to each stream of $2{\times}2$ OTFS-MIMO system. That is, we have also confirmed that $2{\times}2$ MIMO system can completely achieve double achievable rate in comparison with OTFS system on high Doppler frequency channel.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.25 no.3
• /
• pp.171-177
• /
• 2005

Phase-shifting method using Fourier transform (PSM/FT) has been applied to measurement of in-plane displacement of a specimen. Thirty-two interference fringe patterns each of which has different phase of ${\pi}/16$ radian have been gathered from a specimen with in-plane displacement. Low-pass filtering by 2-D Fourier transform is used to suppress spatial noise of the fringe patterns. ${\alpha}-directional$ Fourier transform for PSM/FT is performed by use of the low-pass filtered 32 fringe patterns. Two kinds of specimens are used for experiment. One is a rectangular steel plate and the other one is a rectangular steel plate containing a circular hole at the center. In-plane displacement of each specimen is measured by PSM/FT, and calculated by finite element method (ANSYS) for comparison. The results are quite comparable, so that PSM/FT can be applied to measurement of in-plane displacement.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.24 no.6
• /
• pp.590-596
• /
• 2004

Neural network-based signal classification systems are increasingly used in the analysis of large volumes of data obtained in NDE applications. Ultrasonic inspection methods on the other hand are commonly used in the nondestructive evaluation of welds to detect flaws. An important characteristic of ultrasonic inspection is the ability to identify the type of discontinuity that gives rise to a peculiar signal. Standard techniques rely on differences in individual A-scans to classify the signals. This paper proposes an ultrasonic signal classification technique based on the information tying in the neighboring signals. The approach is based on a 2-dimensional Fourier transform and the principal component analysis to generate a reduced dimensional feature vector for classification. Results of applying the technique to data obtained from the inspection of actual steel welds are presented.