• Title/Summary/Keyword: Fast Motion estimation algorithm

Search Result 286, Processing Time 0.025 seconds

A Fast Block Matching Algorithm Using Hierarchical Search Point Sampling (계층적인 탐색점 추출을 이용한 고속 블록 정합 알고리즘)

  • 정수목
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.12
    • /
    • pp.1043-1052
    • /
    • 2003
  • In this paper, we present a fast motion estimation algorithm to reduce the computations of block matching algorithm for motion estimation in video coding. The proposed algorithm is based on Multi-level Successive Elimination Algorithm and Efficient Multi-level Successive Elimination Algorithms. The best estimate of the motion vectors can be obtained by hierarchical search point sampling and thus the proposed algorithm can decrease the number of matching evaluations that require very intensive computations. The efficiency of the proposed algorithm was verified by experimental results.

  • PDF

Fast Motion Estimation Algorithm using Selection of Candidates and Stability of Optimal Candidates (후보 선별과 최적후보 안정성을 이용한 고속 움직임 예측 알고리즘)

  • Kim, Jong Nam
    • Journal of Broadcast Engineering
    • /
    • v.23 no.5
    • /
    • pp.628-635
    • /
    • 2018
  • In this paper, we propose a fast motion estimation algorithm which is important in video encoding. So many fast motion estimation algorithms have been published for improving prediction quality and computational reduction. In the paper, we propose an algorithm that reduces unnecessary computation, while almost keeping prediction quality compared with the full search algorithm. The proposed algorithm calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, and finds optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain fast computational speed by reducing unnecessary computations. Additionally, the proposed algorithm can be used with conventional fast motion estimation algorithms and prove it in the experimental results.

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

Quasi-Lossless Fast Motion Estimation Algorithm using Distribution of Motion Vector and Adaptive Search Pattern and Matching Criterion (움직임벡터의 분포와 적응적인 탐색 패턴 및 매칭기준을 이용한 유사 무손실 고속 움직임 예측 알고리즘)

  • Park, Seong-Mo;Ryu, Tae-Kyung;Jung, Yong-Jae;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.7
    • /
    • pp.991-999
    • /
    • 2010
  • In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

A Fast and Low-complexity Motion Estimation for UHD HEVC (초고화질 영상처리를 위한 HEVC 표준에 적합한 고속 및 저복잡도 움직임 예측기에 대한 연구)

  • Kim, Sungoh;Park, Chansik;Chun, Hyungju;Kim, Jaemoon
    • Journal of Broadcast Engineering
    • /
    • v.18 no.6
    • /
    • pp.808-815
    • /
    • 2013
  • In this paper, we propose a novel fast and low-complexity Motion Estimation (ME) algorithm for Ultra High Definition (UHD) High Efficiency Video Coding (HEVC). Motion estimation occupies 77~81% of the amount of computation in HEVC. After all, the main key of video codec implementation is to find a fast and low-complexity motion estimation algorithm and architecture. We analyze the previous motion estimation algorithms and propose three optimal algorithm to reduce the computation proportion for HEVC. The proposed algorithm uses only 0.36% of the amount of operations compared to full search algorithm while maintaining compression performance with slight loss of 1.1%.

A Fast Motion Estimation Algorithm Using Adaptive Elimination of Sub-block Partial Coefficient (서브블록 부분 계수 적응제거를 통한 고속 움직임 추정 알고리즘)

  • Ryu, Tae-Kyung;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.483-491
    • /
    • 2009
  • In this paper, we propose a fast motion estimation algorithm using adaptive elimination of sub-block partial coefficients. The proposed algorithm predicts an adaptive threshold for each sub-block by using relationship of an initial sum of absolute difference(SAD) and a minimum SAD at the current point, and efficiently reduces unnecessary calculation time of the conventional partial distortion elimination(PDE) algorithm with the predicted threshold. Our algorithm reduces about 60% of computations of the conventional PDE algorithm without any degradation of prediction quality compared with the con ventional full search. Additionally, the proposed algorithm can be applied to other fast motion estimation 떠gorithms. the proposed Our proposing algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

  • PDF

Fast Motion Estimation Algorithm via Optimal Candidate for Each Step (단계별 최적후보를 통한 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam;Moon, Kwang-Seok
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.18 no.2
    • /
    • pp.62-67
    • /
    • 2017
  • In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.

  • PDF

Fast Motion Estimation with Adaptive Search Range Adjustment using Motion Activities of Temporal and Spatial Neighbor Blocks (시·공간적 주변 블록들의 움직임을 이용하여 적응적으로 탐색 범위 조절을 하는 고속 움직임 추정)

  • Lee, Sang-Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.4
    • /
    • pp.372-378
    • /
    • 2010
  • This paper propose the fast motion estimation algorithm with adaptive search range adjustment using motion activities of temporal and spatial neighbor blocks. The existing fast motion estimation algorithms with adaptive search range adjustment use the maximum motion vector of all blocks in the reference frame. So these algorithms may not control a optimum search range for slow moving block in current frame. The proposed algorithm use the maximum motion vector of neighbor blocks in the reference frame to control a optimum search range for slow moving block. So the proposed algorithm can reduce computation time for motion estimation. The experiment results show that the proposed algorithm can reduce the number of search points about 15% more than Simple Dynamic Search Range(SDSR) algorithm while maintaining almost the same bit-rate and motion estimation error.

Enhanced Cross Search algorithm using Predicted Motion Vector for Fast Block Motion Estimation

  • Ko, Byung-Kwan;Kwak, Tong-Ill;Hwang, Bo-Hyun;Yun, Jong-Ho;Choi, Myung-Ryul
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2008.10a
    • /
    • pp.749-752
    • /
    • 2008
  • Various Motion Estimation (ME) algorithms have been proposed since ME requires large computational complexity. The proposed algorithm employs Enhanced Cross Search Pattern (ECSP) using motion vector of neighbor-blocks to search the motion vector. The experimental results show that proposed algorithm reduces the search point up to 35% compared to conventional methods.

  • PDF

Optimal Search Patterns for Fast Block Matching Motion Estimation (고속 블록정합 움직임 추정을 위한 최적의 탐색 패턴)

  • 임동근;호요성
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.39-42
    • /
    • 2000
  • Motion estimation plays an important role for video coding. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of block shape and size, we can find an optimal search pattern for initial motion estimation. The proposed idea, which has been verified experimentally by computer simulations, can provide an analytical basis for the current MPEG-2 proposals. In order to choose a more compact search pattern for BMA, we exploit the statistical relationship between the motion and the frame difference of each block.

  • PDF