1-3hit |
Yangbae CHUN Seongwook PARK Jonghoon KIM Jiseong KIM Hongseok KIM Joungho KIM Nam KIM Seungyoung AHN
We present the concept of an on-line electric vehicle (OLEV) and its wireless power transfer mechanism and analyze the electromagnetic compatibility characteristics. As magnetic fields transfer 100kW of power to the vehicle, reduction of electromagnetic field (EMF) noise is a critical issue for protection of the human body. Also, with respect to electromagnetic interference (EMI) noise, a proper measurement method has not yet been established for this low frequency high power system. In this paper, low frequency magnetic field shielding methods and application of the shields to the OLEV system are presented. Furthermore, a standard low frequency magnetic field measurement is suggested as an EMI test.
Jiseong KIM Eakhwan SONG Jeonghyeon CHO Yujeong SHIM Gawon KIM Joungho KIM
Analytical solutions for the frequency-dependent transmission line model parameters of a stranded coaxial cable, which are not trivial due to the complex geometry, are presented and discussed in this paper. A frequency-dependent effective conductor radius of a stranded wire coaxial cable is proposed to estimate the internal impedance using the Bessel function solutions of a solid wire coaxial cable. The performance of the proposed model is verified by electromagnetic field solver simulation and by experimental measurement. The results show that the proposed model successfully calculates the broadband frequency-dependent RLGC model parameters and characteristic impedance of a stranded wire coaxial cable with high accuracy.
Baeksop KIM Jiseong KIM Jungmin SO
This letter presents a scheme to improve the running time of exemplar-based image inpainting, first proposed by Criminisi et al. In the exemplar-based image inpainting, a patch that contains unknown pixels is compared to all the patches in the known region in order to find the best match. This is very time-consuming and hinders the practicality of Criminisi's method to be used in real time. We show that a simple bounding algorithm can significantly reduce number of distance calculations, and thus the running time. Performance of the bounding algorithm is affected by the order of patches that are compared, as well as the order of pixels in a patch. We present pixel and patch ordering schemes that improve the performance of bounding algorithms. Experiments with well-known images used in inpainting literature show that the proposed reordering scheme can reduce running time of the bounding algorithm up to 50%.