• Proceedings of the KIPE Conference
• /
• 2005.07a
• /
• pp.227-229
• /
• 2005

교류전동기의 벡터제어 구동 시스템에서 상전류 측정 오차는 토크 및 속도 제어 성능에 직접적인 영향을 주는 요소로서, 맥동 없는 토크 및 속도 제어를 위해서는 상전류의 정확한 측정이 필요하다. 상전류 측정 오차는 오프셋(Offset) 변동에 의한 오차와 스케일(Scale) 차이에 의한 오차로 분류할 수 있으며, 각각의 오차 성분은 고정자 전기 주파수의 1배 및 2배에 해당하는 토크 맥동을 야기 한다. 본 논문에서는 교류전동기 벡터제어 구동 시스템에서 상전류 측정 오차에 의한 토크 맥동을 저감시킬 수 있는 새로운 알고리즘을 제시하며, 시뮬레이션 및 실험을 통해 제안된 방식의 타당성을 입증한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.58-65
• /
• 2002

When we estimate the optimal solution satisfy the objective function and subjective equation in the integer programming, The optimal solution of the objective function Z is decided by the positive integer at extreme point or revised extreme point in the convex set. The convex set is made up the linear subjective equation. The purpose of the paper is thus to establish a stepwise optimization in the integer programming model by estimating the variation △C/sub j/ of the constant term C/sub j/ in the linear objective function, after an application of the modified Branch & Bound method.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.11 no.2
• /
• pp.172-183
• /
• 2006

This paper analyzes instantaneous power compensation theory through comparing p-q theory and cross-vector theory which were proposed by Akagi and Nabae respectively in three-phase four-wire systems. The two compensation theories are identical when there is no zero-sequence voltage component in three-phase three-wire systems, However, when the zero-sequence voltage and/or current components exist in three-phase four-wire systems, the two compensation theories we different in definition on instantaneous real power and instantaneous imaginary power. Based on the analysis, this paper presents instantaneous power compensation method that can eliminate neutral current completely without using energy storage element when the zero-sequence current and voltage components exist in three-phase four-wire systems.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.11-22
• /
• 2006

Recently face detection has actively been researched due to its wide range of applications, such as personal identification and security systems. In this paper, a new face detection method based on the distribution map is proposed. Face-like regions are first extracted by applying the skin color map with the frequency to a color image and then, possible eye regions are determined by using the pupil color distribution map within the face-like regions. This enables the reduction of space for finding facial features. Eye candidates are detected by means of a template matching method using weighted window, which utilizes the correlation values of the luminance component and chrominance components as feature vectors. Finally, a cost function for mouth detection and location information between the facial features are applied to each pair of the eye candidates for face detection. Experimental results show that the proposed method can achieve a high performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.191-194
• /
• 2011

문서를 이루는 단어들의 빈도수가 지수법칙(power law)를 따른다는 지프의 법칩(Zipf's law)이 있다. 이러한 단어분포를 고려하여 문서의 토픽을 찾아내는 기계학습법이 디리쉴레 프로세스(Dirichlet process) 이다. 이를 발전시켜서 데이터의 잠재 요인(latent factor)들을 베이즈 확률모델에 기반한 샘플링 바탕으로 찾는 방법이 인디언 뷔페 과정(Indian buffet process) 이다. 우리는 25가지의 특징(feature)들에 대한 점수(rating)들이 볼드(blood oxygen dependent level) 신호와 함께 주어지는 PBAIC 2007 데이터에 주성분 분석법(principal component analysis)를 적용했다. PBAIC 2007 데이터는 비디오 게임을 수행하며 기능적뇌영상(functional magnetic resonance imaging, fMRI) 촬영을 하여 얻어진 공개데이터이다. 우리의 연구에서는 주성분 분석법을 이용하여 10개의 독립 성분(independent component)들을 찾았다. 그리고 1.75초 마다 촬영된 BOLD 신호와 10개의 고유벡터(eigenvector)들간의 내적을 취하여 가중치(weight)를 구하였다. 성분들의 가중치를 낮은 순서로 정렬함으로써 각 시간마다 주도적으로 영향을 미치는 성분들을 알아낼 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.129-137
• /
• 2001

Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.3
• /
• pp.326-334
• /
• 2022

In this paper, we propose speech enhancement algorithm as a pre-processing for robust speech recognition in noisy environments. Auxiliary-function-based Independent Vector Analysis (AuxIVA) is performed with weighted covariance matrix using time-varying variances with scaling factor from target masks representing time-frequency contributions of target speech. The mask estimates can be obtained using Neural Network (NN) pre-trained for speech extraction or diffuseness using Coherence-to-Diffuse power Ratio (CDR) to find the direct sounds component of a target speech. In addition, outputs for omni-directional noise are closely chained by sharing the time-varying variances similarly to independent subspace analysis or IVA. The speech extraction method based on AuxIVA is also performed in Independent Low-Rank Matrix Analysis (ILRMA) framework by extending the Non-negative Matrix Factorization (NMF) for noise outputs to Non-negative Tensor Factorization (NTF) to maintain the inter-channel dependency in noise output channels. Experimental results on the CHiME-4 datasets demonstrate the effectiveness of the presented algorithms.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.1
• /
• pp.13-21
• /
• 2019

The content based on image retrieval makes use of features of information within image such as color, texture and share for Retrieval data. we present a novel approach for improving retrieval accuracy based on DCT Filter-Bank. First, we perform DCT on a given image, and generate a Filter-Bank using the DCT coefficients for each color channel. In this step, DC and the limited number of AC coefficients are used. Next, a feature vector is obtained from the histogram of the quantized DC coefficients. Then, AC coefficients in the Filter-Bank are separated into three main groups indicating horizontal, vertical, and diagonal edge directions, respectively, according to their spatial-frequency properties. Each directional group creates its histogram after employing Otsu binarization technique. Finally, we project each histogram on the horizontal and vertical axes, and generate a feature vector for each group. The computed DC and AC feature vectors bins are concatenated, and it is used in the similarity checking procedure. We experimented using 1,000 databases, and as a result, this approach outperformed the old retrieval method which used color information.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.55-66
• /
• 2006

We propose a progressive image retrieval method based on an efficient combination of multiresolution color and torture features in wavelet transform domain. As a color feature, color autocorrelogram of the hue and saturation components is chosen. As texture features, BDIP and BVLC moments of the value component are chosen. For the selected features, we obtain multiresolution feature vectors which are extracted from all decomposition levels in wavelet domain. The multiresolution feature vectors of the color and texture features are efficiently combined by the normalization depending on their dimensions and standard deviation vector, respectively, vector components of the features are efficiently quantized in consideration of their storage space, and computational complexity in similarity computation is reduced by using progressive retrieval strategy. Experimental results show that the proposed method yields average $15\%$ better performance in precision vs. recall and average 0.2 in ANMRR than the methods using color histogram color autocorrelogram SCD, CSD, wavelet moments, EHD, BDIP and BVLC moments, and combination of color histogram and wavelet moments, respectively. Specially, the proposed method shows an excellent performance over the other methods in image DBs contained images of various resolutions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.95-103
• /
• 2009

In this paper, a generation method of transmit and receive beamforming vectors based on base station cooperation is proposed which maximizes the user SINR in mobile cellular multi-user MIMO systems. There are two main sources of interference which deteriorate the performance of the system, i.e. the inter-user interference caused by the usage of the same radio resource for multiple users in the system, and the inter-cluster interference from neighboring base stations which are not participating in cooperative transmission. The proposed scheme cancels out the inter-user interference by using the block diagonalization(BD) method, and mitigate the inter-cluster interference by using optimal transmit and receive beamforming vectors based on optimal combining(OC) with the statistic information of inter-cluster interference. We perform computer simulations to verify the performance of the proposed scheme, and compare the result to the conventional performance obtained from utilizing the receiver side information only or utilizing the information from neither sides. The performance evaluations are conducted not only over the independent MIMO channels, but over correlated MIMO channels to demonstrate the robustness of the proposed scheme over the channels with correlation among antennas.