• Journal of IKEEE
• /
• v.13 no.4
• /
• pp.1-7
• /
• 2009

A video segmentation algorithm, which can extract objects even with non-stationary backgrounds, is proposed in this work. The proposed algorithm is composed of three steps. First, we perform an initial segmentation interactively to build the probability density functions of colors per each macro block via kernel density estimation. Then, for each subsequent frame, we construct a coherence strip, which is likely to contain the object contour, by exploiting spatio-temporal correlations. Finally, we perform the segmentation by minimizing an energy function composed of color, coherence, and smoothness terms. Experimental results on various test sequences show that the proposed algorithm provides accurate segmentation results.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.293-296
• /
• 1998

본 논문에서는 다양한 멀티미디어 서비스를 위해 가변율 half rate 음성 부호화기를 설계하였다. 유, 무성음과 묵음의 구분을 위해 본 논문에서는 프레임 에너지와 음성 파라메터들을 이용한 효과적인 voicing 결정 알고리즘을 사용하였다. 유성음을 위한 half rate 음성 부호화기는 저속에서 좋은 특성을 보이는 generalized AbS구조를 이용하였다. LPC 계수는 LSP 계수로 변환한 후 predictive 2-stage VQ를 통해서 양자화하며, 여기 신호는 음질저하를 최소화하며 복잡도를 감소시킨 shift 방식의 대수적 고정 코드북 구조를 사용하고, 적응코드북과 여기코드북의 이득은 VQ로 양자화 하였다. 무성음을 위한 부호화기는 대부분이 유성음을 위한 부호화기와 동일하지만, 무성음에서는 피치간 상관도가 매우 낮으므로 피치 보간 방법을 사용하지 않고 개루프로 피치 lag를 찾은 후 전체 프레임에 사용한다. 1 kb/s 부호화기는 묵음 구간과 주변소음 구간에 사용되며 이 구간의 신호를 피치 성분이 미약한 주변소음들로 제한하고 이에 최적인 부음성 부호화기를 설계하였다. 최종적으로 완성된 가변율 half rate 부호화기는 voice activity factor(VAF)가 0.47인 시험음성에서 약 2.6 kb/s의 평균 전송률을 보였다. 주관적 음질 평가의 일환으로 IS-96 표준 코덱인 가변율 8 kb/s QCELP와 A-B preference 시험을 실시하였다. 시험 결과 평균전송률이 약 2배인 가변율 8 kb/s QCELP 보다 우수한 음질 성능을 보였다.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.48 no.5
• /
• pp.269-277
• /
• 1999

In this paper, a novel dead time minimization algorithm is proposed for improving the output waveform of an inverter. The adverse effects of the dead time are mainly described by the voltage drop and the distortion factor of waveforms. The principle of the proposed algorithm is organized with forbidding unnecessary firings fo the inverter switches which are not conducted even though the gate signal is impressed. The proposed methods are explained with the conduction mode of output currents. The H/W and S/W implementation method of the proposed algorithm are also presented. The validity of the proposed algorithm is verified by comparing the simulation and experimental results with conventional methods. It can be concluded from the results that the proposed algorithm has the advantage which is able to reduce the harmonics in the output voltages and which the output voltage can nearly be equal to the reference value. Another advantage of the proposed method is the reduction of total numbers of switching so that the switching losses of inverter drives can be minimized.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.527-534
• /
• 2003

An active contour model called snake is powerful tool for object contour extraction. But, conventional snakes require exhaustive computing time, sometimes can´t extract complex shape contours due to the properties of energy function, and are also heavily dependent on the position and the shape of an initial snake. To solving these problems, we propose in this paper an improved snake called "shaking snake", based on a greedy algorithm. A shaking snake consist of two steps. According to their appropriateness, we in the first step move each points directly to locations where contours are likely to be located. In the second step, we then align some snake points with a tolerable bound in order to prevent local minima. These processes shake the proposed snake. In the experimental results, we show the process of shaking the proposed shake and comparable performance with a greedy snake. The proposed snake can extract complex shape contours very accurately and run fast, approximately by the factor of five times, than a greedy snake.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.712-721
• /
• 2012

In this paper, we propose an Enhanced cross-layer Geographic Forwarding (EGF) protocol for wireless sensor networks (WSNs). EGF uses an optimal back-off time to make the packet forwarding decisions using only source and destination's location information and energy cost without information about neighbor nodes' location or the number of one hop neighbor nodes. EGF is also a cross-layer protocol by combining efficient asynchronous MAC and geographic routing protocol. The proposed protocol can find optimal next hop location quickly without broadcasting node's location update and with minimizing overhead. In our performance evaluation, EGF has better performance in terms of packet success ratio, energy efficiency and end-to-end delay in wireless sensor networks.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.1
• /
• pp.441-448
• /
• 2020

With help of Vehicle-to-Grid(V2G) technology battery in electric vehicle can be used as distributed energy resource and energy storage in a smart grid environment. Several problems of security vulnerability and privacy preservation can be occurred because V2G network supports 2 way communication among all components. This paper explains and makes analysis of architecture, privacy sensitive data, security vulnerability and security requirement of V2G system. Furthermore efficient architecture and operating scheme for V2G system are proposed. This scheme uses symmetric cryptosystem and hash algorithm to support privacy preservation and mutual authentication.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.8
• /
• pp.312-321
• /
• 2018

The Korean DR market proposes suppression of peak demand under reliability crisis caused a natural disaster or unexpected power plant accidents as well as saving power plant construction costs and expanding amount of reserve as utility's perspective. End-user is notified a DR event signal DR execution before one hour, and executes DR based on requested amount of load reduction. This paper proposes a DR energy management algorithm that can be scheduled the optimal operations of chiller system and ESS in the next day considering the TOU tariff and DR scheme. In this DR algorithm is divided into two scheduling's; day-ahead operation scheduling with temperature forecasting error and operation rescheduling on DR operation. In day-ahead operation scheduling, the operations of DR resources are scheduled based on the finite number of ambient temperature scenarios, which have been generated based on the historical ambient temperature data. As well as, the uncertainties in DR event including requested amount of load reduction and specified DR duration are also considered as scenarios. Also, operation rescheduling on DR operation day is proposed to ensure thermal comfort and the benefit of a COB owner. The proposed method minimizes the expected energy cost by a mixed integer linear programming (MILP).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.97-104
• /
• 2016

Because of rapid growth of data size, the number of data storage has been increased. When using multiple data storages, a distribute file system is essential to insure the availability of data files. The power consumption is a major problem when using a distributed file system with many data storages. Previous works have aimed at reducing the energy consumption with efficient file block layout by changing some data servers into stand-by mode. The file block migration has not been seriously considered because migration causes large cost. But when we consider addition of a new data server or file, file block migration is needed. This paper formulates the minimization of data block migration as an ILP optimization problem and solves it using branch-and-bound method. Using this technique, we can maximize the number of stand-by data servers with the minimum number of file block movement. However, computation time of branch-and-bound method of an ILP optimization problem increases exponentially as the problem size grows. Therefore this paper also proposes a data block and data server grouping method to solve many small ILP problems.

• Journal of Digital Contents Society
• /
• v.19 no.4
• /
• pp.821-827
• /
• 2018

Affective computing has gained increasing interest in the recent years with the development of potential applications in Human computer interaction (HCI) and healthcare. Although momentous research has been done on human emotion recognition, however, in comparison to speech and facial expression less attention has been paid to physiological signals. In this paper, Electroencephalogram (EEG) signals from different brain regions were investigated using modified wavelet energy features. For minimization of redundancy and maximization of relevancy among features, mRMR algorithm was deployed significantly. EEG recordings of a publically available "DEAP" database have been used to classify four classes of emotions with Multi class Support Vector Machine. The proposed approach shows significant performance compared to existing algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.233-238
• /
• 2005

In general CELP(Code Excited Linear Prediction) type vocoders provide good speech qualify around 4.8kbps. Among them, G.723.1 developed for Internet Phone and video-conferencing includes two vocoders, 5.3kbps ACELP(Algebraic-CELP) and 6.3kbps MP-MLQ(Multi-Pulse Maximum Likelihood Quantization) In order to improve the speech qualify in CELP vocoder, in this paper. we proposed a new spectrum analysis algorithm with variable window In CELP vocoder, the spectrum of the synthesised speech signal is distorted because the fixed size windows is used for spectrum analysis. So we have measured the spectral leakage and in order to minimize the spectral leakage have adjusted the window size. Applying this method G.723.1 ACELP, we can got SD(Spectral Distortion) reduction 0.084(dB), residual energy reduction 6.3$\%$ and MOS(Mean Opinion Score) improvement 0.1.