• Korean Security Journal
• /
• no.61
• /
• pp.377-400
• /
• 2019

Photography is the most commonly used method of documenting the crime and incident scene as it helps maintaining chain of custody (COC) and prove integrity of the physical evidence. It can also capture phenomena as they are. However, digital images can be manipulated and lose their authenticity as admissible evidence. Thus only limited techniques can be used to enhance images, and one of them is Fourier transform. Fourier transform refers to transformation of images into frequency signals. Fast Fourier transform (FFT) is used in this study. In this experiment, we overlapped fingerprints with graph paper or other fingerprints and separated the fingerprints. Then we evaluated and compared quality of the separated fingerprints to the original fingerprints, and examined whether the two fingerprints can be identified as same fingerprints. In the case of the fingerprints on graph paper and general pattern-overlapping fingerprints, fingerprint ridges are enhanced. On the other hand, in case of separating complicated fingerprints such as core-to-core overlapping and delta-to-delta overlapping fingerprints, quality of fingerprints can be deteriorated. Quality of fingerprints is known to possibly bring negative effects on the credibility of examiners. The result of this study may be applicable to other areas using digital imaging enhancement technology.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 1999.06a
• /
• pp.73-79
• /
• 1999

Finite element equations by using fast Fourier transformation were formulated for studying temperatures resulting from frictional heating in sliding systems. The equations include the effect of velocity of moving components. The program developed by using FFT-FEM that combines Fourier transform techniques and the finite element method, was applied to the sliding bearing system. Numerical prediction obtained by FFT-FEM was in an excellent agreement of experimental temperature measurements.

• Tribology and Lubricants
• /
• v.16 no.3
• /
• pp.218-222
• /
• 2000

Finite element equations by using fast Fourier transformation were formulated for studying temperatures resulting from frictional heating in sliding systems. The equations include the effect of velocity of moving components. The program developed by using FFT-FEM that combines Fourier transform techniques and the finite element method, was applied to the sliding bearing system. Numerical prediction obtained by FFT-FEM was in an excellent agreement of experimental temperature measurements.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.131-134
• /
• 1988

This Paper describes a algorithm for evaluating the loss of load probability of a generating system using Fast Hartley Transform. The Fast Hartley Transform(FHT) Is as fast as or faster than the Fast Fourier Transform(FHT) and serves for all the uses such as spectral, digital processing and convolution to which the FFT is at present applied. The method has been tested by applying to IEEE reliability test system and the effectiveness is demonstrated.

• 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.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.3
• /
• pp.75-81
• /
• 2007

Recently the subject of "wavelet analysis" has be drawn by both mathematical and engineering application fields such as Signal Processing, Compression/Decomposition, Wavelet-Neural Network, Statistics and etc. Even though its similar to Fourier analysis, wavelet is a versatile tool with much mathematical content and great potential for applications. Especially, wavelet transform uses localizable various mother wavelet functions in time-frequency domain. Therefore, wavelet transform has good time-analysis ability for high frequency component, and has good frequency-analysis ability for low frequency component. Using the discriminative ability is more easy method than other conventional techniques. In this paper, Morlet wavelet transform was applied to discriminate the kind of line fault by acquired data from real power transformation network. The experimental result presented that Morlet wavelet transform is easier, and more useful method than the Fast Fourier Transform(FFT).

• Korean Journal of Optics and Photonics
• /
• v.8 no.3
• /
• pp.199-203
• /
• 1997

Fine displacement of spherical suface was detected and analyzed by Twyman-Green interferometer and the interferogram analysis using Fourier transform method. The surface profile was obtained from single interferogram by introducing the carrier freguency to the interferogram. The interferogram was processed in the spatial frequency domain by fast Fourier transform, and the phase distribution was obtained by inverse Fourier transform. The 3-dimensional distribution for the surface displacement was obtained. It was compared with the calculated surface displacement and the error was less than λ/10.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.9
• /
• pp.968-977
• /
• 2008

In this paper, an analysis of TE-wave scattering from transversal-shifted tandem slits using fourier transform analysis and Wiener-Hopf technique are derived and the electrical performances have been compared with a commercially availabel software. In Fourier transform analysis, it is shown that a fast-convergent series solution can be obtained when the distance between the slits is very narrow, while in Wiener-Hopf technique, it is found that the highly-accurate approximation can be obtained when the gap between the slits becomes wider. In addition, this paper has dealt with a good agreement between two analytical solutions.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.498-503
• /
• 2009

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.449-455
• /
• 2011

Inspired by fast Jacket transforms, we propose simple factorization and construction algorithms for the M-dimensional discrete Fourier transform (DFT) matrices underlying generalized Chinese remainder theorem (CRT) index mappings. Based on successive coprime-order DFT matrices with respect to the CRT with recursive relations, the proposed algorithms are presented with simplicity and clarity on the basis of the yielded sparse matrices. The results indicate that our algorithms compare favorably with the direct-computation approach.