• Title/Summary/Keyword: partial distortion elimination

Search Result 25, Processing Time 0.021 seconds

A Fast Partial Distortion Elimination Algorithm Using Motion Similarity of Macro-blocks (매크로블록 간 움직임유사도를 이용한 고속 PDE 알고리즘)

  • Ryu, Tae-Kyung;Jeong, Yong-Jae;Moon, Kwang-Seok;Kim, Jong-Nam
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.225-228
    • /
    • 2009
  • 본 논문에서는 인접블록간의 움직임 유사도를 이용하여 불필요한 후보블록을 보다 빠르게 제거하는 PDE기반의 고속 블록매칭 알고리즘을 제안한다. 제안한 방법은 기존의 방법보다 불필요한 계수를 효율적으로 제거하기 위하여 인접 블록간의 영상의 유사성에 기초하여 네 개의 인접 매크로블록 가운데 최대 복잡도를 가지는 서브블록의 누적 분포 함수(cumulative distribution function-CDF)와 서브블록별 복잡도가 집중되지 않도록 하기위하여 normalized스캔 방법에 사용하여 효율적으로 계산량을 감소하였다. 제안한 알고리즘은 화질의 저하 없이 기존의 PDE 알고리즘에 비해 55% 이상의 계산량을 줄였으며, MPEG-2 및 MPEG-4 AVC를 이용하는 비디오 압축 응용분야에 유용하게 사용될 수 있을 것이다.

  • PDF

A Fast Motion Estimation Algorithm using Probability Distribution of Motion Vector and Adaptive Search (움직임벡터의 확률분포와 적응적인 탐색을 이용한 고속 움직임 예측 알고리즘)

  • Park, Seong-Mo;Ryu, Tae-Kyung;Kim, Jong-Nam
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.162-165
    • /
    • 2010
  • In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. 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/4 AVC standards.

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.

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.

Fast Inter Block Mode Decision Using Image Complexity in H.264/AVC (H.264/AVC에서 영상 복잡도를 이용한 고속 인터 블록 모드 결정)

  • Kim, Seong-Hee;Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.925-931
    • /
    • 2008
  • In video coding standard H.264/AVC, variable block size mode algorithm improves compression efficiency but has need of a large amount of computation for various block modes and mode decision. Meanwhile, decided inter block modes depend on the complexity of a block image, and then the more complex a macroblock is, the smaller its block size is. This paper proposes fast inter block mode decision algorithm. It limits valid block modes to the block modes with a great chance for decision using the image complexity and carries out motion estimation rate-distortion optimization with only the valid block modes. In addition to that, it applies fast motion estimation PDE to the valid block modes with only the $16{\times}16$ block mode. The reference software JM 9.5 was executed to estimate the proposed algorithm's performance. The simulation results showed that the proposed algorithm could save about 24.12% of the averaged motion estimation time while keeping the image quality and the bit rate to be -0.02dB and -0.12% on the average, respectively.