• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.206-211
• /
• 2010

This paper describes a skipping method for handling various illuminating effects in video sequences. The weighted prediction in H.264/AVC improves coding efficiency and image quality. However, it requires massive computation overheads for entire system, and thus, reducing the computation complexity becomes more important. Compared to the weighted prediction method in the H.264/AVC, the proposed method can decrease the bitrate down to 15%. Moreover, the proposed algorithm can reduce computation complexity down to 30%, compared to the localized weighted prediction which does not skip unnecessary calculation.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.411-414
• /
• 2008

In this paper, we present a determination method of quantization skipping condition for H.264/AVC video encoding standard. In order to reduce the complexity of quantization process that is coming from Integer discrete cosine transform, a quantization skipping condition is derived by the analysis of integer transform and quantization processes. The experimental results show that the proposed algorithm has the capability to reduce the computational complexity of CPU operation time about 10-25(%)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8A
• /
• pp.669-678
• /
• 2012

In this paper, we propose an efficient fast integer-pel motion estimation for H.264/AVC using local statistics of local motion vectors. Using neighboring motion vectors, we define a new statistical property that is used to determine a mode of motion search range of current block. In addition, an adaptive motion search range compensated method that is based on cumulative statistics of previous coded blocks is addressed to solve the problem of the statistical motion search range decision method. Experimental results show that proposed algorithm has the capability to reduce the computational cost over the other methods.

• The Journal of the Korea Contents Association
• /
• v.9 no.3
• /
• pp.20-27
• /
• 2009

H.264/AVC video coding standard adapting a rate-distortion optimization technique to select the best coding mode with multi reference frames for each macroblock gets a higher coding efficiency than those of previous video coding standards but the computational complexity increases drastically. Therefore, many fast mode decision algorithms are proposed to reduce the computational complexity. Among them, we propose a fast intra mode decision algorithm based on directional information of I4MB. The proposed algorithm achieves consistent time saving about 15% in IPPP sequences and 44% in all I frame sequences with negligible loss in PSNR and small increment of bit rate compared with that of JM11.0.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1144-1152
• /
• 2005

Intra prediction coding is one of the many coding-efficiency oriented tools of H.264/AVC, but it requires high computational complexity. Many fast intra coding algorithms have been proposed to reduce the computational complexity of intra prediction. While most of them have been focused on the mode decision methods themselves, we propose a fast algorithm in which new intra modes are substituted for the conventional intra modes so that the number of intra modes can be reduced. The simulation results show that the proposed method could reduce the encoding time of the overall sequence by $49\%$ without any noticeable degradation of the coding efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.56-62
• /
• 2009

In H.264/AVC, rate distortion optimization algorithm is used to decide the best block mode from various block modes. It improves a bit rate but greatly increases an amount of computation. This paper proposes a fast rate distortion optimization algorithm that omits a rate distortion optimization adaptively by predicting its cost from the cost calculated for motion estimation. The simulation results show that the proposed algorithm, on average, keeps nearly the image quality and the bit rate made by the rate distortion optimization while reduces 69.86% and 69.63% of computation added by it in CIF and QCIF respectively.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.687-690
• /
• 2005

H.264/AVC에서 압축 효율을 향상시키기 위해 사용된 entropy coding중에 CABAC(Context-based Adaptive Binary Arithmetic Coding)은 하드웨어 복잡도가 높고 bit-serial 과정에서 data dependancy가 존재하기 때문에 빠른 연산이 어렵다. 본 논문에서는 adaptive arithmetic encoder와 정규화 과정을 효율적으로 구성하여 각 입력 심벌이 정규화 과정의 반복횟수에 관계없이 고정된 cycle에 encoding이 되도록 하였다. 제안한 구조는 pipeline으로 구성하기 용이하며, 이 경우 매 cycle에 한 입력 심벌의 encoding이 가능하다.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.87-90
• /
• 2003

This paper presents a variable block size motion estimation (ME) algorithm and hardware architectures dedicated to H.264/AVC. Proposed ME architecture can achieve real-time processing for 720$\times$480@30Hz with search range of [-64, +63] in the horizontal and [-32, +31] in the vertical direction at integer-pel accuracy and upto 7 reference frames at the operating frequency of 54MHz.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.814-817
• /
• 2011

In this letter, the distributions of direct current (DC) coefficients for P-frames in H.264/AVC are analyzed, and the distortion model of the Gaussian source under the quantization of the dead-zone plus-uniform threshold quantization with uniform reconstruction quantizer is derived. Experimental results show that the DC coefficients of P-frames are best approximated by the Laplacian distribution and the Gaussian distribution at small quantization step sizes and at large quantization step sizes, respectively.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.293-294
• /
• 2010

ITU-T와 ISO/IEC의 공동 작업으로 제정 된 H.264/AVC는 기존 비디오 표준들에 비해 동일한 화질에서 약 30%~70%의 비트 량을 절감할 수 있으며, 동일한 비트 량으로 PSNR이 2~3dB 가량 우수한 영상을 제공할 수 있다. H.264/AVC는 인트라 부호화 효율을 높이기 위해 공간 영역에서 주변 화소를 이용하여 $4{\times}4$ luma 예측의 9가지 모드와 $16{\times}16$ luma 예측의 4가지 모드에 대한 비트율-왜곡 최적화 기법을 사용하여 최적의 인트라 예측 모드를 선택한다. 본 논문에서는 프레임 내에서 공간 중복 성을 더 많이 줄이기 위해 9가지 모드의 $4{\times}4$ luma 예측에 7가지 모드를 추가하여 총16가지의 $4{\times}4$ luma 예측 모델을 제안한다. 그리고 실험을 통하여 제안하는 인트라 예측 모델이 기존 기술에 비해 높은 압축효율을 보인다.