• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.5
• /
• pp.601-606
• /
• 1999

A Walsh function method is proposed in this report for the analysis and optimal control of linear time-delay systems, which is based on the Picard's iterative approximation and fast Walsh transformation. In this research, the following results are obtained: 1) The differential and integral equation can be solved by transforming into a simple algebraic equation as it was possible with the usual orthogonal function method: 2) General orthogonal function methods require usage of Walsh operational matrices for delay or advance and many calculations of inverse matrices, which are not necessary in this method. Thus, the control problems of linear time-delay systems can be solved much faster and readily.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.5 s.305
• /
• pp.19-26
• /
• 2005

In this paper, a new method for obtaining three-dimensional shape of an object by measuring relative blur between images using wavelet analysis has been described. Most of the previous methods use inverse filtering to determine the measure of defocus. These methods suffer from some fundamental problems like inaccuracies in finding the frequency domain representation, windowing effects, and border effects. Besides these deficiencies, a filter, such as Laplacian of Gaussian, that produces an aggregate estimate of defocus for an unknown texture, can not lead to accurate depth estimates because of the non-stationary nature of images. We propose a new depth from defocus (DFD) method using wavelet analysis that is capable of performing both the local analysis and the windowing technique with variable-sized regions for non-stationary images with complex textural properties. We show that normalized image ratio of wavelet power by Parseval's theorem is closely related to blur parameter and depth. Experimental results have been presented demonstrating that our DFD method is faster in speed and gives more precise shape estimates than previous DFD techniques for both synthetic and real scenes.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.109-116
• /
• 2007

Most harmonic synthesis methods using phase information employ a quadratic or cubic phase interpolation. The methods are computationally expensive to implement because every component sinewave must be synthesized on a per sample basis. In this paper, we propose a fast harmonic synthesis method for sinusoidal speech/audio coding based on the quadratic and cubic phase function to overcome the complexity problem. To derive the fast harmonic synthesis method, we define the over-sampling function and phase modulation function by constraining the parameter of phase function to be independent for harmonic index and derive the fast synthesis method using IFFT. Experimental results show that the proposed method significantly reduce the complexity of conventional cosine synthesis method while maintaining the performance.

• The Korean Journal of Applied Statistics
• /
• v.36 no.4
• /
• pp.323-335
• /
• 2023

In causal analysis of high dimensional data, it is important to reduce the dimension of covariates and transform them appropriately to control confounders that affect treatment and potential outcomes. The augmented inverse probability weighting (AIPW) method is mainly used for estimation of average treatment effect (ATE). AIPW estimator can be obtained by using estimated propensity score and outcome model. ATE estimator can be inconsistent or have large asymptotic variance when using estimated propensity score and outcome model obtained by parametric methods that includes all covariates, especially for high dimensional data. For this reason, an ATE estimation using an appropriate dimension reduction method and semiparametric model for high dimensional data is attracting attention. Semiparametric method or sparse sufficient dimensionality reduction method can be uesd for dimension reduction for the estimation of propensity score and outcome model. Recently, another method has been proposed that does not use propensity score and outcome regression. After reducing dimension of covariates, ATE estimation can be performed using matching. Among the studies on ATE estimation methods for high dimensional data, four recently proposed studies will be introduced, and how to interpret the estimated ATE will be discussed.

• Phonetics and Speech Sciences
• /
• v.6 no.4
• /
• pp.133-139
• /
• 2014

This paper describes several approaches to transform a speaker's individuality to another's individuality using frequency warping between bilingual formant frequencies on different language environments. The proposed methods are simple and intuitive voice conversion algorithms that do not use training data between different languages. The approaches find the warping function from source speaker's frequency to target speaker's frequency on formant space. The formant space comprises four representative monophthongs for each language. The warping functions can be represented by piecewise linear equations, inverse matrix. The used features are pure frequency components including magnitudes, phases, and line spectral frequencies (LSF). The experiments show that the LSF-based voice conversion methods give better performance than other methods.

• Journal of IKEEE
• /
• v.21 no.4
• /
• pp.358-367
• /
• 2017

Advanced Driver Assistance Systems(ADAS), such as Front Collision Warning System (FCWS) are currently being developed. FCWS require high processing speed because it must operate in real time while driving. In addition, a low-power system is required to operate in an automobile embedded system. In this paper, FCWS is implemented in CPU-FPGA architecture in embedded system to enable real-time processing. The lane detection enabled the use of the Inverse Transform Perspective (IPM) and sliding window methods to operate at fast speed. To detect the vehicle, a Convolutional Neural Network (CNN) with high recognition rate and accelerated by parallel processing in FPGA is used. The proposed architecture was verified using Intel FPGA Cyclone V SoC(System on Chip) with ARM-Core A9 which operates in low power and on-board FPGA. The performance of FCWS in HD resolution is 44FPS, which is real time, and energy efficiency is about 3.33 times higher than that of high performance PC enviroment.

• Journal of Mechanical Science and Technology
• /
• v.17 no.2
• /
• pp.197-206
• /
• 2003

It is intended to retrieve the time history of displacement from measured acceleration signal. In this study, the word retrieving means reconstructing the time history of original displacement signal from already measured acceleration signal not just extracting various information using relevant signal processing techniques. Unlike extracting required information from the signal, there are not many options to apply to retrieve the time history of displacement signal, once the acceleration signal is measured and recorded with given sampling rate. There are two methods, in general, to convert measured acceleration signal into displacement signal. One is directly integrating the acceleration signal in time domain. The other is dividing the Fourier transformed acceleration signal by the scale factor of - $\omega$$^2$and taking the inverse Fourier transform of it. It turned out both the methods produced a significant amount of errors depending on the sampling resolution in time and frequency domain when digitizing the acceleration signals. A simple and effective way to convert the time history of acceleration signal into the time history of displacement signal without significant errors is studied here with the analysis on the errors involved in the conversion process.

• Journal of KSNVE
• /
• v.9 no.1
• /
• pp.103-112
• /
• 1999

A new modeling and analysis technique for one-dimensional distributed parameter systems is presented. First. discretized equations of motion in Laplace domain are derived by applying discretization methods for partial differential equations of a one-dimensional structure with respect to spatial coordinate. Secondly. the z and inverse z transformations are applied to the discretized equations of motion for obtaining a dynamic matrix for a uniform element. Four different discretization methods are tested with an example. Finally, taking infinite on the number of step for a uniform element leads to an exact dynamic matrix for the uniform element. A generalized modal analysis procedure for eigenvalue analysis and modal expansion is also presented. The resulting element dynamic matrix is tested with a numerical example. Another application example is provided to demonstrate the applicability of the proposed method.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1999.04a
• /
• pp.143-150
• /
• 1999

Elastic wave propagation in a multilayered elastic half-plane is studied by using the Cagniard-de Hoop method. After the unknowns are expressed in terms of the reflection and transmission coefficients in the in terms of the reflection and transmission coefficients in the integral-transformed domains they are assmbled to form the global matrix equation. The inverse Laplace transform of each term is done by applying the Cagniard-de Hoop methods. As a numerical example a four-layered half-plane is considered where a point source is applied to the first layer. The method described in the present study can be used in checking other numerical methods such as FDM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.113-123
• /
• 2007

In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.