• The Journal of the Korea Contents Association
• /
• v.20 no.12
• /
• pp.49-57
• /
• 2020

This study predicts the ratio of added value, which represents the competitiveness of export industries in South Korea, using various machine learning techniques. To enhance the accuracy and stability of prediction, forecast combination technique was applied to predicted values of machine learning techniques. In particular, this study improved the efficiency of the prediction process by selecting key variables out of many variables using recursive feature elimination method and applying them to machine learning techniques. As a result, it was found that the predicted value by the forecast combination method was closer to the actual value than the predicted values of the machine learning techniques. In addition, the forecast combination method showed stable prediction results unlike volatile predicted values by machine learning techniques.

• Journal of Creative Information Culture
• /
• v.5 no.2
• /
• pp.145-156
• /
• 2019

In this study, we have developed and evaluated an information extracting module based on the named entity recognition technique. For the given purpose in this paper, the module was designed to apply to the problem dealing with extraction of postal address information from arbitrary documents without any prior knowledge on the document layout. From the perspective of information technique practice, our approach can be said as a probabilistic n-gram (bi- or tri-gram) method which is a generalized technique compared with a uni-gram based keyword matching. It is the main difference between our approach and the conventional methods adopted in natural language processing that applying sentence detection, tokenization, and POS tagging recursively rather than applying the models sequentially. The test results with approximately two thousands documents are presented at this paper.

• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.17-31
• /
• 2004

This paper proposes an algorithm for the robust transmission of video in error Prone environment using multiple description codingby optimal split of DCT coefficients and rate-distortionoptimization framework. In MDC, a source signal is split Into several coded streams, which is called descriptions, and each description is transmitted to the decoder through different channel. Between descriptions, structured correlations are introduced at the encoder, and the decoder exploits this correlation to reconstruct the original signal even if some descriptions are missing. It has been shown that the MDC is more resilient than the singe description coding(SDC) against severe packet loss ratecondition. But the excessive redundancy in MDC, i.e., the correlation between the descriptions, degrades the RD performance under low PLR condition. To overcome this Problem of MDC, we propose a hybrid MDC method that controls the SDC/MDC switching according to channel condition. For example, the SDC is used for coding efficiency at low PLR condition and the MDC is used for the error resilience at high PLR condition. To control the SDC/MDC switching in the optimal way, RD optimization framework are used. Lagrange optimization technique minimizes the RD-based cost function, D+M, where R is the actually coded bit rate and D is the estimated distortion. The recursive optimal pet-pixel estimatetechnique is adopted to estimate accurate the decoder distortion. Experimental results show that the proposed optimal split of DCT coefficients and SD/MD switching algorithm is more effective than the conventional MU algorithms in low PLR conditions as well as In high PLR condition.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.618-622
• /
• 2008

In this paper, we suggest new music composition algorithm based on fractal theory. User can define and control fractal shape by setting an initial state and production rules in L-System. We generate an asymmetric fractal tree based on L-System and probability. Then a music is generated by the fractal tree image using sonification techniques. We introduce two composition algorithm using the fractal tree. First, monophonic music can be generated by mapping x and y axis to velocity and pitch, respectively Second, harmonic music also can be generated by mapping x and y axis to time and pitch, respectively Using our composition algorithm, user can easily generate a music which has repeated pattern created by recursive feature of fractal, and a music which has structure similar to fractal tree image.

• Journal of Advanced Marine Engineering and Technology
• /
• v.41 no.1
• /
• pp.56-61
• /
• 2017

This paper presents a data prediction method and its application to haptic-based teleoperation systems. In general, time delays inevitably occur during data transmission in a network environment, which degrades the overall performance of haptic-based teleoperation systems. To address this situation, this paper proposes an autoregressive moving average (ARMA) model-based data prediction algorithm for estimating model parameters and predicting future data recursively in real time. The proposed method was applied to haptic data captured every 5 ms while bilateral haptic interaction was carried out by two users with an object in a virtual space. The results showed that the prediction performance of the proposed method had an error of less than 1 ms when predicting position-level data 100 ms ahead.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.337-342
• /
• 2002

This paper proposes a new adaptive image labeling algorithm fur object analysis of the binary images. The proposed labeling algorithm need not merge/order of complex equivalent labels like classical labeling algorithm and the processing is done during only 1 Pass. In addition, this algorithm can be extended for gray-level image easily. Experiment result with HIPR image library shows that the proposed algorithm process more than 2 times laster than compared algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.119-122
• /
• 2013

ITU-T VCEG 과 ISO/IEC MPEG 이 공동으로 구성한 JCT-VC (Joint Collaborative Team on Video Coding)이 표준화를 진행 중인 HEVC (High Efficiency Video Coding)은 H.264/AVC 대비 약 2 배의 압축효율을 갖는다. 하지만, 계층적 구조를 갖는 가변크기 블록의 사용과 재귀적 부호화 구조에 따른 인코더의 복잡도 증가는 개선해야 할 문제점으로 지적되고 있다. 본 논문에서는 현재 표준화가 진행 중인 HEVC 인코더의 실시간 구현을 위한 SIMD 명령어를 이용한 data-level 병렬화 기법, CPU 및 GPU 를 이용한 multi-threading 기법과 같은 다양한 병렬화 기법을 소개한다. 또한, 이러한 병렬화 기법들을 HEVC 인코더에 적용하기 위해 적합한 연산 및 기능 모듈에 대하여 소개한다. 본 연구를 통하여 HM (HEVC reference model)에 적용한 결과 $832{\times}480$ 영상의 경우 20-30fps 의 부호화 속도를 나타냈으며, $1920{\times}1080$ 영상의 경우 5-10fps 의 부호화 속도를 나타내었다.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1391-1398
• /
• 2012

Time synchronization is crucial in wireless sensor networks such as Wireless USB and WBAN for diverse purposes from the MAC to the application layer. This paper proposes online clock skew estimators to achieve energy-efficient time synchronization for wireless sensor networks. By using recursive least squares estimators, we not only reduce the amount of data which should be stored locally in a table at each sensor node, but also allow offset and skew compensations to be processed simultaneously. Our skew estimators can be easily integrated with traditional offset compensation schemes. The results of simulation and experiment show that the accuracy of time synchronization can be greatly improved through our skew compensation algorithm.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.129-132
• /
• 1999

스테레오 음향 반향 제거기는 입력 신호로 사용되는 두 채널간의 강한 상관관계로 인하여 수렴특성이 악화되는 문제점을 갖는다. 따라서 수렴속도를 향상시키기 위해 RLS또는 Affine Projection(AP) 알고리즘 같은 Least Square (LS)계 열의적응 알고리즘을 사용하는 것이 필요하다. 그러나, 이러한 알고리즘은 LMS 알고리즘과 같은 통계적 미분계열 알고리 즘에 비하여 과도한 계산량을 요구하므로 고속 알고리즘에 대한 연구가 진행되어왔다. 본 논문에서는 스테레오 환경에서 Gram-Schmidt(GS) 직교화를 이용하여 LMS 알고리즘 수준의 계산량을 갖는 근사화된 AP 알고리즘을 제안하였다. 제안한 알고리즘은 AP 알고리즘의 후행오차 성질을 이용하여 GS 직교화 구조로 구성되며, 계산량 감소를 위해 샘플단위의 재귀적 GS 직교화를 사용하였다. 또한 GS직교화를 스테레오 채널에 적용함으로써 적은 계산량으로 AS 알고리즘과 대등한 수렴 성능을 갖는다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.475-480
• /
• 2011

In this paper, we propose a collision risk assesment system. First, using Kalman Filter, we estimate the information of pedestrian, and second, we compute the collision probability using Monte Carlo Simulations(MCS) and neural network(NN). And we update the collision risk using time history which is called belief. Belief update consider not only output of Kalman Filter of only current time step but also output of Kalman Filter up to the first time step to current time step. The computer simulations will be shown the validity of our proposed method.