• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.70-80
• /
• 1997

This paper proposes a hierarchical Hausdorff distance (HD) matching algorithm baased on coarse-to-fine approach. It reduces the computational complexity greatly by using the pyramidal structures consisting of distance transform (DT) and edge pyramids. Also, inthe proposed hierarchical HD matching, a thresholding method is presented to find an optimal matching position with small error, in which the threshold values are determined by using the property between adjacent level of a DT map pyramid. By computer simulation, the performance of the conventional and proposed hierarchical HD matching algorithms is compared in therms of the matching position for binary images containing uniform noise.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3095-3097
• /
• 1999

A New path planning using modified DT(distance transform) algorithm for a remote mobile robot is proposed. The weakness of DT algorithm is that the generated path is not the best path of all possible paths. Modified DT algorithm proposed can compensate for the weakness of DT algorithm, but the operating time of the proposed is longer than that of DT algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.5
• /
• pp.27-34
• /
• 2000

This paper deals with speech enhancement methods using the wavelet transform. A cycle-spinning scheme and undecimated wavelet transform are used for denoising of speech signals, and then their results are compared with that of the conventional wavelet transform. We apply soft-thresholding technique for removing additive background noise from noisy speech. The symlets 8-tap wavelet and pyramid algorithm are used for the wavelet transform. Performance assessments based on average SNR, cepstral distance and informal subjective listening test are carried out. Experimental results demonstrate that both cycle-spinning denoising(CSD) method and undecimated wavelet denoising(CWD) method outperform conventional wavelet denoising(UWD) method in objective performance measure as welt as subjective listening test. The two methods also show less "clicks" that usually appears in the neighborhood of signal discontinuities.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.103-109
• /
• 2010

The edit distance problem is finding the minimum number of edit operations to transform a string into another one. It is one of the important problems in algorithm research and there are some algorithms that compute an optimal edit distance for the one-dimensional languages such as the English alphabet. However, there are a few researches to find the edit distance for the more complicated language such as the Korean or Chinese alphabet. In this paper, we define the measure of the edit distance for the Korean alphabet and present an algorithm for the edit distance problem for the Korean alphabet.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.7
• /
• pp.67-77
• /
• 2016

In this paper, we propose an algorithm for open/closed eye detection based on modified Hausdorff distance. The proposed algorithm consists of two parts, face detection and open/closed eye detection parts. To detect faces in an image, MCT (Modified Census Transform) is employed based on characteristics of the local structure which uses relative pixel values in the area with fixed size. Then, the coordinates of eyes are found and open/closed eyes are detected using MHD (Modified Hausdorff Distance) in the detected face region. Firstly, face detection process creates an MCT image in terms of various face images and extract criteria features by PCA(Principle Component Analysis) on offline. After extraction of criteria features, it detects a face region via the process which compares features newly extracted from the input face image and criteria features by using Euclidean distance. Afterward, the process finds out the coordinates of eyes and detects open/closed eye using template matching based on MHD in each eye region. In performance evaluation, the proposed algorithm achieved 94.04% accuracy in average for open/closed eye detection in terms of test video sequences of gray scale with 30FPS/$320{\times}180$ resolution.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.3
• /
• pp.219-226
• /
• 1992

In this study, Kalman filtering theory is applied to the estimation of symmetrical components from fault voltage and current signal when it comes to faults with the power system. An algorithm for estimating fault location accurately and quickly by calculating the symmetrical components from the extracted fundamental voltage phasor and current phasor is presented. Also, to confirm the validity of digital distance relaying techniques using Kalman filtering, the experimental results obtained by using the digital simulation of power system is shown.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.65 no.1
• /
• pp.66-71
• /
• 2016

According to the development of depth sensing devices and depth estimation technology, depth information becomes more important for object detection in computer vision. In terms of recognition rate, pedestrian detection methods have been improved more accurately. However, the methods makes slower detection time. So, many researches have overcome this problem by using GPU. Here, we propose a real-time pedestrian detection algorithm that does not rely on GPU. First, the depth-weighted distance map is used for detecting expected human regions. Next, human detection is performed on the regions. The performance for the proposed approach is evaluated and compared with the previous methods. We show that proposed method can detect human about 7 times faster than conventional ones.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.12
• /
• pp.2139-2146
• /
• 2008

This paper presents a numerical algorithm for fault location estimation which used to data from both end of the transmission line. The proposed algorithm is also based on the synchronized voltage and current phasor measured from the PMUs(Phasor Measurement Units) in the time-domain. This paper has separated from two part of with/without shunt capacitance(short/long distance). Most fault was arc one-ground fault which is 75% over [1]. so most study focused with it. In this paper, the numerical algorithm has calculated to distance for ground fault and line-line fault. In this paper, the algorithm is given with/without shunt capacitance using II parameter line model, simple impedance model and estimated using DFT(Discrete Fourier Transform) and the LES(Least Error Squares Method). To verify the validity of the proposed algorithm, the EMTP(Electro- Magnetic Transient Program) and MATLAB did used.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.8
• /
• pp.371-378
• /
• 2002

This paper presents the rapid and accurate algorithm for fault detection and location estimation in the transmission line. This algorithm uses wavelet transform for fault detection and harmonics elimination and utilizes least square error method for fault impedance estimation. Wavelet transform decomposes fault signals into high frequence component Dl and low frequence component A3. The former is used for fault phase detection and fault types classification and the latter is used for harmonics elimination. After fault detection, an adaptive data window technique using LSE estimates fault impedance. It can find a optimal data window length and estimate fault impedance rapidly, because it changes the length according to the fault disturbance. To prove the performance of the algorithm, the authors test relaying signals obtained from EMTP simulation. Test results show that the proposed algorithm estimates fault location within a half cycle after fault irrelevant to fault types and various fault conditions.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.6
• /
• pp.859-868
• /
• 2012

A new fault location algorithm based on stationary wavelet transform and its verification experiment results are described for HVDC submarine cables in this paper. For wavelet based fault location algorithm, firstly, 4th level approximation coefficients decomposed by wavelet transform function are superimposed by correlation, then the distance to the fault point is calculated by time delay between the first incident signal and the second reflected signal. For the verification of this algorithm, the real experiments based on various fault conditions and return types of fault current are performed at HVDC submarine cable test yard located in KEPCO(Korea Electric Power Corporation) Power Testing Center of South Korea. It proves that the fault location method proposed in this paper is very simple but very quick and accurate for HVDC submarine cable fault location.