• Title/Summary/Keyword: ME Estimation

Search Result 224, Processing Time 0.04 seconds

An Efficient Parallelization Implementation of PU-level ME for Fast HEVC Encoding (고속 HEVC 부호화를 위한 효율적인 PU레벨 움직임예측 병렬화 구현)

  • Park, Soobin;Choi, Kiho;Park, Sang-Hyo;Jang, Euee Seon
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.178-184
    • /
    • 2013
  • In this paper, we propose an efficient parallelization technique of PU-level motion estimation (ME) in the next generation video coding standard, high efficiency video coding (HEVC) to reduce the time complexity of video encoding. It is difficult to encode video in real-time because ME has significant complexity (i.e., 80 percent at the encoder). In order to solve this problem, various techniques have been studied, and among them is the parallelization, which is carefully concerned in algorithm-level ME design. In this regard, merge estimation method using merge estimation region (MER) that enables ME to be designed in parallel has been proposed; but, parallel ME based on MER has still unconsidered problems to be implemented ideally in HEVC test model (HM). Therefore, we propose two strategies to implement stable parallel ME using MER in HM. Through experimental results, the excellence of our proposed methods is shown; the encoding time using the proposed method is reduced by 25.64 percent on average of that of HM which uses sequential ME.

Comparison of Parameter Estimation Methods in A Kappa Distribution

  • Jeong, Bo-Yoon;Park, Jeong-Soo
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.04a
    • /
    • pp.163-169
    • /
    • 2006
  • This paper deals with the comparison of parameter estimation methods in a 3-parameter Kappa distribution which is sometimes used in flood frequency analysis. The method of moment estimation(MME), L-moment estimation(L-ME), and maximum likelihood estimation(MLE) are applied to estimate three parameters. The performance of these methods are compared by Monte-carlo simulations. Especially for computing MME and L-ME, ike dimensional nonlinear equations are simplied to one dimensional equation which is calculated by the Newton-Raphson iteration under constraint. Based on the criterion of the mean squared error, the L-ME is recommended to use for small sample size $(n\leq100)$ while MLE is good for large sample size.

  • PDF

A Low Dynamic Power 90-nm CMOS Motion Estimation Processor Implementing Dynamic Voltage and Frequency Scaling Scheme and Fast Motion Estimation Algorithm Called Adaptively Assigned Breaking-off Condition Search

  • Kobayashi, Nobuaki;Enomoto, Tadayoshi
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.512-515
    • /
    • 2009
  • A 90-nm CMOS motion estimation (ME) processor was developed by employing dynamic voltage and frequency scaling (DVFS) to greatly reduce the dynamic power. To make full use of the advantages of DVFS, a fast ME algorithm and a small on-chip DC/DC converter were also developed. The fast ME algorithm can adaptively predict the optimum supply voltage ($V_D$) and the optimum clock frequency ($f_c$) before each block matching process starts. Power dissipation of the ME processor, which contained an absolute difference accumulator as well as the on-chip DC/DC converter and DVFS controller, was reduced to $31.5{\mu}W$, which was only 2.8% that of a conventional ME processor.

  • PDF

Comparison of Parameter Estimation Methods in A Kappa Distribution

  • Park Jeong-Soo;Hwang Young-A
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.2
    • /
    • pp.285-294
    • /
    • 2005
  • This paper deals with the comparison of parameter estimation methods in a 3-parameter Kappa distribution which is sometimes used in flood frequency analysis. Method of moment estimation(MME), L-moment estimation(L-ME), and maximum likelihood estimation(MLE) are applied to estimate three parameters. The performance of these methods are compared by Monte-carlo simulations. Especially for computing MME and L-ME, three dimensional nonlinear equations are simplified to one dimensional equation which is calculated by the Newton-Raphson iteration under constraint. Based on the criterion of the mean squared error, L-ME (or MME) is recommended to use for small sample size( n$\le$100) while MLE is good for large sample size.

Motion Estimation Skipping Technique for Fast Motion Estimation (고속 움직임 추정을 위한 움직임 추정 생략 기법)

  • 강현수;박성모
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7C
    • /
    • pp.726-732
    • /
    • 2003
  • The paper proposes a motion estimation (ME) technique to reduce computational complexity. It is achieved by skipping ME process for macro-blocks decided to be in no need of the operation. Thus, it is called ME skipping technique(MEST). In general, the ME is composed of integer pixel precision ME (IME) followed by half pixel precision ME (HME). The MEST is performed just before an IME process and makes a decision on skipping the IME process according to a criterion based on ME errors of adjacent macro-blocks (MBs) already encoded. When the IME process for a MB is decided to be skipped, which is called ME skip mode, the IME process is skipped and the integer pixel precision motion vector of the MB is just replaced by a predicted vector and used as the input of HME. On the other hands, the IME processes for MBs in ME non-skip mode are not skipped but normally performed. Accordingly, the MEST is very effective to reduce computational complexity when MBs in ME skip mode is abundant. In addition, when the MEST is applied to video encoder, it contributes to more accurate rate control and more robusaess for channel errors. It is experimentally shown that the MEST has the above advantages while maintaining good reconstructed image quality.

Design of High-Performance ME/MC IP for Video SoC (Video SoC를 위한 고성능 ME/MC IP의 설계)

  • Seo, Young-Ho;Choi, Hyun-Jun;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1605-1614
    • /
    • 2008
  • This paper proposed a new VLSI architecture of motion estimation (ME) and compensation (MC) for efficient video compression and implemented it to hardware. ME is generally calculated using SAD result. So we proposed a new arithmetic method for SAD. The proposed SAD calculation method increases arithmetic efficiency and decreases external memory usage. Finally it increases performance of ME/MC. The proposed ME/MC hardware was implemented to ASIC with TSMC 90nm HVT CMOS library. The implemented hardware occupies about 330K gates and stably operates the clock frequency of 143MHz.

New Efficient Motion Compensated Frame Interpolation Method by Overlapped Block Motion Estimation (중첩 블록 기반 움직임 추정에 의한 중간 영상 합성 기법)

  • 하태현;이성주;김성식;성준호;김재석
    • Journal of Broadcast Engineering
    • /
    • v.9 no.1
    • /
    • pp.54-63
    • /
    • 2004
  • A new motion compensated frame Interpolation (MCI) algorithm by block based motion estimation (BME) is proposed. The block for the BME is composed of a large overlapped block for practical object motion estimation (ME) and a small block (which has a coinciding center with the ME-block) for the more precise motion compensated image description. Pixels in the block for the ME are sub-sampled to reduce computational complexity. The proposed method is executed with the various ME-blocks which have different size and sub-sampling ratio, and compared to the conventional method.

Low-Complexity Sub-Pixel Motion Estimation Utilizing Shifting Matrix in Transform Domain

  • Ryu, Chul;Shin, Jae-Young;Park, Eun-Chan
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.1020-1026
    • /
    • 2016
  • Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

Efficient parallelization implementation technique of PU-level ME for fast HEVC encoding (고속 HEVC 부호화를 위한 효율적인 PU 레벨 움직임예측 병렬화 구현 기법)

  • Park, Soobin;Choi, Kiho;Park, Sanghyo;Jang, Eueeseon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.11a
    • /
    • pp.163-166
    • /
    • 2012
  • 본 논문에서는 차세대 비디오 표준인 High Efficiency Video Coding(HEVC)의 영상 부호화 과정의 시간복잡도 감소를 위한 효율적인 Prediction Unit(PU)레벨 움직임예측(Motion Estimation, ME) 병렬화의 구현 기법을 제시하고자 한다. 움직임예측 과정은 부호화기에서 80%의 복잡도를 차지하는 과정으로 고속 부호화의 걸림돌이 되고 있다. 이를 해결하기 위한 방법으로 제안된 것이 움직임예측 알고리즘의 병렬화이다. 알고리즘 수준에서 ME 의 일부인 Merge Estimation 의 병렬화를 위해서 Merge Estimation Region (MER)기반의 ME 방법이 제안되었다. 하지만 HEVC Test Model reference software(HM)에 반영된 MER 을 이용하여 실제로 병렬화된 ME 를 구현하는 과정에서는 알고리즘 측면에서 아직 고려되지 않은 문제들이 존재한다. 이에 본 논문에서는 MER 을 사용한 안정적인 병렬 ME 를 구현하기 위한 전략으로 각 PU 의 정보를 독립적으로 사용하기 위한 부분 순차화 방법과 메모리 접근제한을 이용한 병렬화 방법을 제시한다. 실험을 통해 본 연구의 우수성이 확인되었는데, 제안된 방법에 기반을 둔 구현에서 순차적인 ME 를 이용한 부호화기 대비 평균 25.64%의 전체 부호화 과정 시간의 감소가 나타났다.

  • PDF

270 MHz Full HD H.264/AVC High Profile Encoder with Shared Multibank Memory-Based Fast Motion Estimation

  • Lee, Suk-Ho;Park, Seong-Mo;Park, Jong-Won
    • ETRI Journal
    • /
    • v.31 no.6
    • /
    • pp.784-794
    • /
    • 2009
  • We present a full HD (1080p) H.264/AVC High Profile hardware encoder based on fast motion estimation (ME). Most processing cycles are occupied with ME and use external memory access to fetch samples, which degrades the performance of the encoder. A novel approach to fast ME which uses shared multibank memory can solve these problems. The proposed pixel subsampling ME algorithm is suitable for fast motion vector searches for high-quality resolution images. The proposed algorithm achieves an 87.5% reduction of computational complexity compared with the full search algorithm in the JM reference software, while sustaining the video quality without any conspicuous PSNR loss. The usage amount of shared multibank memory between the coarse ME and fine ME blocks is 93.6%, which saves external memory access cycles and speeds up ME. It is feasible to perform the algorithm at a 270 MHz clock speed for 30 frame/s real-time full HD encoding. Its total gate count is 872k, and internal SRAM size is 41.8 kB.