• 치과방사선
• /
• 제28권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
• /
• 제45권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.

• 한국음향학회지
• /
• 제37권6호
• /
• pp.518-524
• /
• 2018

라이브 음악 또는 리메이크를 통해서 재발매된 음악을 원곡의 커버곡이라 부른다. 본 논문은 고속 커버곡 검색을 위한 특징 축약을 위해 2차원 퓨리에 변환을 이용하는 방법을 연구하였다. 이차원 퓨리에 변환은 조변화에 대해서 불변성을 가지고 있으므로, 커버곡 검색을 위한 특징 축약 방법으로 적합하다. 기존 퓨리에 변환 방법에서는 크기값 만을 활용하였으나, 본 논문에서는 인접한 크로마 블록은 같은 조변화를 가진다는 가정하에 위상 정보를 추가로 활용하는 방법을 제안하였다. 두 가지 커버곡 실험 데이터셋에서 성능 비교를 수행하였으며, 제안된 방법이 기존 방법에 비해서 우수한 커버곡 검색 정확도를 보임을 확인하였다.

• 대한수학회지
• /
• 제41권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• 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)
• /
• 제12권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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• 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%.

• 한국전자파학회논문지
• /
• 제28권6호
• /
• pp.444-451
• /
• 2017

본 논문에서는 고속 데이터 송수신을 위해 2차원 iDFT(inverse Discrete Fourier Transform) 및 DFT(Discrete Fourier Transform) 연산을 이용하여 Delay-Doppler 스프레딩 영향을 고속 수신 처리하는 OTFS(Orthogonal Time Frequency Space) 변조 시스템과 OTFS-MIMO(Multiple Input Multiple Output) 시스템을 평가하고 분석한다. 특히 OTFS 변조를 사용하는 MIMO 시스템은 높은 Doppler 효과가 존재하는 채널에서도 시스템의 용량 저하가 거의 없이 모든 데이터 스트림을 전송할 수 있다. 시뮬레이션 결과, $1{\times}1$ OTFS 변조 시스템의 전송률은 $2{\times}2$ OTFS-MIMO 시스템에서 한 스트림의 전송률과 유사함을 확인할 수 있다. 즉, $2{\times}2$ OTFS-MIMO 시스템은 높은 Delay-Doppler 영향이 존재하는 환경에서도 $1{\times}1$ OTFS 변조 시스템과 비교하여 거의 2배의 전송률을 확보할 수 있음을 확인할 수 있다.

• 비파괴검사학회지
• /
• 제25권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.

• 비파괴검사학회지
• /
• 제24권6호
• /
• pp.590-596
• /
• 2004

신경망 기반의 신호 분류 시스템은 비파괴 검사 시 추출되는 많은 양의 데이터를 처리하기 위한 방법으로 꾸준히 이용되고 있다. 비파괴검사 방법 중, 초음파 탐상법은 용접 지역에서 결함들을 찾기 위하여 비파괴 검사에서 일반적으로 사용되고 있는 추세다. 초음파 탐상법의 중요한 특징은 특정 신호에서 발생하는 불연속성을 판별해내는 능력이다. 지금까지의 보편화되어 있는 기술은 신호를 분류하기 위해 각각의 A-scan 신호를 처리하는 반면 본 논문에서는 이웃하는 A-scan 신호의 정보를 기반으로 하는 2차원 푸리에 변환(Fourier transform)과 주성분 분석(principal component analysis) 기법을 이용하여 특징 벡터를 추출, 분류하는 방법을 제시하고자 한다.