• Title/Summary/Keyword: ME-vector

Search Result 76, Processing Time 0.032 seconds

Korean Parsing using Machine Learning Techniques (기계학습 기법을 이용한 한국어 구문분석)

  • Lee, Yong-Hun;Lee, Jong-Hyeok
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06c
    • /
    • pp.285-288
    • /
    • 2008
  • 최근의 구문분석 연구는 컴퓨터 성능 향상과 사용 가능한 대량의 구문분석 말뭉치 증가, 견고한 기계학습 기법 개발 등에 힘입어 통계적인 모델 연구가 꾸준히 증가하고 있다. 본 논문에서는 기존에 개발된 다양한 기계학습 기법 중 ME(Maximum Entropy) 모델과 SVM(Support vector machine) 모델을 이용한 한국어 구문분석 방법을 제안한다. 국어정보베이스(KIBS) 구문분석 말뭉치를 가지고 실험한 결과 SVM 모델을 이용한 한국어 구문분석기가 기존의 확률 기반 통계적 한국어 구문분석기의 성능보다도 최대 1.84% 높은 87.46%의 의존관계 결정 정확률을 보였다. 추후 언어지식을 반영한 다양한 자질들을 이용할 경우 성능 향상이 기대된다.

  • PDF

Sapphire Based 94 GHz Coplanar Waveguide-to-Rectangular Waveguide Transition Using a Unilateral Fin-line taper (평면형 Fin-line 테이퍼를 이용한 사파이어 기반의 94 GHz CPW-구형 도파관 변환기)

  • Moon, Sung-Woon;Lee, Mun-Kyo;Oh, Jung-Hun;Ko, Dong-Sik;Hwang, In-Seok;Rhee, Jin-Koo;Kim, Sam-Dong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.10
    • /
    • pp.65-70
    • /
    • 2008
  • We design and fabricate the 94 GHz Coplanar waveguide(CPW)-to-rectangular waveguide transition that is transmits signal smoothly between the CPW, which is a popular transmission line of the planar circuits, and rectangular waveguide for the 94 GHz transceiver system. The proposed transition composed of the unilateral fin-line taper and open type CPW-to-slot-line transition is based on the hard and inflexible sapphire for the flip-chip bonding of the planar MMICs using conventional MMIC technology. We optimize a single section transition to achieve low loss by using an EM field solver of Ansoft's HFSS and fabricate the back- to-back transition that is measured by Anritsu ME7808A Vector Network Analyzer in a frequency range of $85{\sim}105$ GHz. From the measurement and do-embedding CPW with 3 mm length, an insertion and return loss of a single-section transition are 1.7 dB and more an 25 than at 94 GHz, respectively.

Fast Hierarchical Search Method for Multi-view Video Coding (다시점 비디오 부호화를 위한 고속 계층적 탐색 기법)

  • Yoon, Hyo-Sun;Kim, Mi-Young
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.7
    • /
    • pp.495-502
    • /
    • 2013
  • Motion estimation (ME) that limits the performance of image quality and encoding speed has been developed to reduce temporal redundancy in video sequences and plays an important role in digital video compression. But it is computational demanding part of the encoder. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. ME for Multi-view video requires high computational complexity. To reduce computational complexity and maintain the image quality, a fast motion estimation method is proposed in this paper. The proposed method uses a hierarchical search strategy. This strategy method consists of modified diamond search patten, multi gird diamond search pattern, and raster search pattern. These search patterns place search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum or exploits the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.2 ~3 times faster while maintaining similar video quality and bit rates.

Accuracy Improvement of Frame Interpolation Algorithm using Wedge-shaped Block Partitioning (비정방형 블록을 이용한 보간 프레임의 정확도 향상 기법)

  • Jeong, Jae Heon;Jung, Ho Sun;Sunwoo, Myung Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.85-91
    • /
    • 2015
  • This paper presents a novel frame rate up-conversion (FRUC) algorithm. Existing algorithms, in general, employ rectangular blocks for motion estimation and arbitrary shape of an actual object region cannot be precisely represented. On the other hand, the proposed wedge-shaped block partitioning algorithm partitions a rectangular block into two wedge-shaped blocks using the texture information, which makes better approximation for an actual object region. The wedge-shaped block partitioning algorithm as well as the adaptive motion vector prediction algorithm is used to reliably estimate the actual motion. Experimental results show that the proposed FRUC algorithm is superior to existing algorithms up to 1.988dB in PSNR and 0.0167 in SSIM comparisons.

A Symmetric Motion Estimation Method by using the Properties of the Distribution of Motion Vectors (움직임 벡터 분포 특성과 블록 움직임의 특성을 이용한 대칭형 움직임 추정 기법)

  • Yoon, Hyo-Sun;Kim, Mi-Young
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.329-336
    • /
    • 2017
  • In video compression, Motion Estimation(ME) limits the performance of image quality and generated bit rates. However, it requires much complexity in the encoder part. Multi-view video uses many cameras at different positions. Multi-view video coding needs huge computational complexity in proportion to the number of the cameras. To reduce computational complexity and maintain the image quality, an effective motion estimation method is proposed in this paper. The proposed method exploiting the characteristics of motion vector distribution and the motion of video. The proposed is a kind of a hierarchical search strategy. This strategy consists of multi-grid rhombus pattern, diagonal pattern, rectangle pattern, and refinement pattern. Experiment results show that the complexity reduction of the proposed method over TZ search method and PBS (Pel Block Search) on JMVC (Joint Multiview Video Coding) can be up to 40~75% and 98% respectively while maintaining similar video image quality and generated bit rates.

A Fast Sub-pixel Motion Estimation Method for H.264 Video Compression (H.264 동영상 압축을 위한 부 화소 단위에서의 고속 움직임 추정 방법)

  • Lee, Yun-Hwa;Choi, Myung-Hoon;Shin, Hyun-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.411-417
    • /
    • 2006
  • Motion Estimation (ME) is an important part of video coding process and it takes the largest amount of computation in video compression. Half-pixel and quarter-pixel motion estimation can improve the video compression rate at the cost of higher computational complexity In this paper, we suggest a new efficient low-complexity algorithm for half-pixel and quarter pixel motion estimation. It is based on the experimental results that the sum of absolute differences(SAD) shows parabolic shape and thus can be approximated by using interpolation techniques. The sub-pixel motion vector is searched from the minimum SAD integer-pixel motion vector. The sub-pixel search direction is determined toward the neighboring pixel with the lowest SAD among 8 neighbors. Experimental results show that more than 20% reduction in computation time can be achieved without affecting the quality of video.

Low Complexity Motion Estimation Search Method for Multi-view Video Coding (다시점 비디오 부호화를 위한 저 복잡도 움직임 추정 탐색 기법)

  • Yoon, Hyo-Sun;Kim, Mi-Young
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.5
    • /
    • pp.539-548
    • /
    • 2013
  • Although Motion estimation (ME) plays an important role in digital video compression, it requires a complicated search procedure to find an optimal motion vector. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. The computational complexity of motion estimation for Multi-view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, a low complexity motion estimation search method is proposed in this paper. The proposed search method consists of four-grid diamond search patten, two-gird diamond search pattern and TZ 2 Point search pattern. These search patterns exploit the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.8~4.5 times faster by reducing the computational complexity and the image quality degradation is about to 0.01~0.24 (dB).

An Energy Consumption Prediction Model for Smart Factory Using Data Mining Algorithms (데이터 마이닝 기반 스마트 공장 에너지 소모 예측 모델)

  • Sathishkumar, VE;Lee, Myeongbae;Lim, Jonghyun;Kim, Yubin;Shin, Changsun;Park, Jangwoo;Cho, Yongyun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.5
    • /
    • pp.153-160
    • /
    • 2020
  • Energy Consumption Predictions for Industries has a prominent role to play in the energy management and control system as dynamic and seasonal changes are occurring in energy demand and supply. This paper introduces and explores the steel industry's predictive models of energy consumption. The data used includes lagging and leading reactive power lagging and leading current variable, emission of carbon dioxide (tCO2) and load type. Four statistical models are trained and tested in the test set: (a) Linear Regression (LR), (b) Radial Kernel Support Vector Machine (SVM RBF), (c) Gradient Boosting Machine (GBM), and (d) Random Forest (RF). Root Mean Squared Error (RMSE), Mean Absolute Error (MAE) and Mean Absolute Percentage Error (MAPE) are used for calculating regression model predictive performance. When using all the predictors, the best model RF can provide RMSE value 7.33 in the test set.

Fast Multiresolution Motion Estimation in Wavelet Transform Domain Using Block Classification and HPAME (블록 분류와 반화소 단위 움직임 추정을 이용한 웨이브릿 변환 영역에서의 계층적 고속 움직임 추정 방법)

  • Gwon, Seong-Geun;Lee, Seok-Hwan;Ban, Seung-Won;Lee, Geon-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.87-95
    • /
    • 2002
  • In this paper, we proposed a fast multi-resolution motion estimation(MRME) algorithm. This algorithm exploits the half-pixel accuracy motion estimation(HPAME) for exact motion vectors in the baseband and block classification for the reduction of bit amounts and computational loads. Generally, as the motion vector in the baseband are used as initial motion vector in the high frequency subbands, it has crucial effect on quality of the motion compensated image. For this reason, we exploit HPAME in the motion estimation for the baseband. But HPAME requires additional bit and computational loads so that we use block classification for the selective motion estimation in the high frequency subbands to compensate these problems. In result, we could reduce the bit rate and computational load at the similar image quality with conventional MRME. The superiority of the proposed algorithm was confirmed by the computer simulation.

Efficient Integer pel and Fractional pel Motion Estimation on H.264/AVC (H.264/AVC에서 효율적인 정화소.부화소 움직임 추정)

  • Yoon, Hyo-Sun;Kim, Hye-Suk;Jung, Mi-Gyoung;Kim, Mi-Young;Cho, Young-Joo;Kim, Gi-Hong;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.16B no.2
    • /
    • pp.123-130
    • /
    • 2009
  • Motion estimation (ME) plays an important role in digital video compression. But it limits the performance of image quality and encoding speed and is computational demanding part of the encoder. To reduce computational time and maintain the image quality, integer pel and fractional pel ME methods are proposed in this paper. The proposed method for integer pel ME uses a hierarchical search strategy. This strategy method consists of symmetrical cross-X pattern, multi square grid pattern, diamond patterns. These search patterns places search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum and to reduce the computational time. The proposed method for fractional pel uses full search pattern, center biased fractional pel search pattern and the proposed search pattern. According to block sizes, the proposed method for fractional pel decides the search pattern adaptively. Experiment results show that the speedup improvement of the proposed method over Unsymmetrical cross Multi Hexagon grid Search (UMHexagonS) and Full Search (FS) can be up to around $1.2{\sim}5.2$ times faster. Compared to image quality of FS, the proposed method shows an average PSNR drop of 0.01 dB while showing an average PSNR gain of 0.02 dB in comparison to that of UMHexagonS.