• Journal of Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.407-419
• /
• 2006

In this paper, an adaptive illumination change compensation method is proposed for multi-view video coding. In multi-view video, an illumination change can occur due to physically imperfect camera calibration, each different camera position and direction, and so on. These characteristics can cause a performance decrease in the multi-view video coding that uses an inter-view prediction by referring to the pictures obtained from the neighboring views. By using the proposed method, a compression ratio of the proposed method in the multi-view video coding is increased, and finally $0.1{\sim}0.6dB$ PSNR(Peak Signal-to-Noise Ratio) improvement was obtained compared with the case of not using the proposed method.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.528-539
• /
• 2005

The H.264 has been adopted as the video codec for various multimedia services such as DMB and next-generation DVD because of its superior coding performance. However, the reference codec of the standard, the joint model (JM) contains quite a few algorithms which are too complex to be used for the resource-constraint embedded environment. This paper introduces very low-complexity H.264 encoding algorithm which is applicable for the embedded environment. The proposed algorithm was realized by restricting some coding tools on the basis that it should not cause too severe degradation of RD-performance and adding a few early termination and bypass conditions during the motion estimation and mode decision process. In case of encoding of 7.5fps QCIF sequence with 64kbpswith the proposed algorithm, the encoder yields worse PSNRs by 0.4 dB than the standard JM, but requires only $15\%$ of computational complexity and lowers the required memory and power consumption drastically. By porting the proposed H.264 codec into the PDA with Intel PXA255 Processor, we verified the feasibility of the H.264 based MMS(Multimedia Messaging Service) on PDA.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.565-573
• /
• 2007

In this paper, we propose a method to select motion vector predictor by considering prediction structure of a multi view content for coding efficiency of multi view coding which is being standardized in JVT. Motion vector of a different tendency is happened while carrying out temporal and view reference prediction of multi-view video coding. Also, due to the phenomena of motion vectors being searched in both temporal and view order, the motion vectors do not agree with each other resulting a decline in coding efficiency. This paper is about how the motion vector predictor are selected with information of prediction structure. By using the proposed method, a compression ratio of the proposed method in multi-view video coding is increased, and finally $0.03{\sim}0.1$ dB PSNR(Peak Signal-to-Noise Ratio) improvement was obtained compared with the case of JMVM 3.6 method.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.354-362
• /
• 2012

Recently, High Efficiency Video Coding (HEVC) is under development jointly by MPEG and ITU-T for the next international video coding standard. Compared to the previous standards, HEVC supports variety of splitting units, such as coding unit (CU), prediction unit (PU), and transform unit (TU). Among them, it has been known that the recursive quadtree structure of CU can improve the coding efficiency while the encoding complexity is increased significantly. In this paper, a simple conditional probability to predict the early termination condition of recursive unit structure is introduced. The proposed conditional probability is estimated based on Bayes' formula from local statistics of rate-distortion costs in encoder. Experimental results show that the proposed method can reduce the total encoding time by about 32% according to the test configuration while the coding efficiency loss is 0.4%-0.5%. In addition, the encoding time can be reduced by 50% with 0.9% coding efficiency loss when the proposed method was used jointly with HM4.0 early CU termination algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.378-380
• /
• 2011

스테레오스코픽(stereoscopic) 3D 비디오 서비스는 기존 2D 와의 호환성을 유지하면서 새로운 3D 비디오 서비스를 제공할 수 있는 것으로, 전송 대역이 제한된 지상파 방송에서 높은 부호화 효율을 갖는 스테레오스코픽 비디오 코덱이 요구된다. 따라서 3D 를 위한 부가영상의 부호화를 위해 H.264/AVC 등을 고려하고 있으며, 또한 부가영상을 비실시간으로 전송하는 비실시간(Non-Real Time: NRT) 3D 서비스도 고려되고 있다. 본 논문에서는 NRT 3D 서비스를 위한 스테레오스코픽 비디오 부호화에 있어서, HEVC 에서 고려중인 적응루프필터(ALF: Adaptive Loop Filter)를 전/후처리 필터로 적용하는 기법을 제시한다. 특히, 부가영상의 후처리에 ALF 를 적용하기 위하여 부호화 과정에 결정되는 CU(Coding Unit) 구조를 이용하는 HEVC 와 달리 H.264/MVC 로 부호화한 부가영상의 매크로블록(MB) 부호화 모드를 이용한 ALF 적용 기법을 제안한다. 부가영상 부호화에 있어서 전처리 및 후처리 과정으로 ALF 를 적용함으로써 최대 약 20.5%의 부가영상의 부호화 성능 향상을 확인하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.150-159
• /
• 2014

The latest video coding standard, HEVC can improve the coding efficiency significantly compared with the H.264/AVC. However the HEVC encoder requires much larger computational complexities. The longer 8-tap interpolation filter of the HEVC which is used in a non-integer motion estimation is one of the reasons and this paper aims to reduce the computational complexities. First of all, three shorter-tap interpolation filters for a motion estimation process are tested rather than the use of a standard interpolation filter. In addition, the fast searching strategies to reduce the number of comparisons for choosing the best non-integer motion vector are proposed. Finally, the interpolation process is selectively applied according to the searching strategy. By combining all of the techniques, the experimental results show that the encoding times can be reduced by 13.6%, 18.5% and 21.1% with the coding efficiency penalties of 0.7%, 1.5% and 2.5%, respectively. For the full-HD video sequences, the coding efficiency penalties are reduced to 0.4%, 1.1% and 1.6% at the same level of the encoding time savings, which shows the effectiveness of the proposed schemes for the high resolution video sequences.

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.426-433
• /
• 2010

The H.264/AVC video coding standard performs inter prediction using variable block sizes to improve coding efficiency. Since we predict not only the motion of homogeneous regions but also the motion of non-homogeneous regions accurately using variable block sizes, we can reduce residual information effectively. However, each motion vector should be transmitted to the decoder. In low bit rate environments, motion vector information takes approximately 40% of the total bitstream. Thus, motion vector competition was proposed to reduce the amount of motion vector information. Since the size of the motion vector difference is reduced by motion vector competition, it requires only a small number of bits for motion vector information. However, we need to send the corresponding index of the best motion vector predictor for decoding. In this paper, we propose a new codeword table based on the phased-in code to encode the index of motion vector predictor efficiently. Experimental results show that the proposed algorithm reduces the average bit rate by 7.24% for similar PSNR values, and it improves the average image quality by 0.36dB at similar bit rates.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.258-262
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm could improve approximately 37.5% in coding efficiency, compared with an existing memory reduction algorithm, at the same memory reduction rate.

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

본 논문은 저복잡도 비디오 부/복호화를 위한 엔트로피 부호화 기반의 분산 비디오 코딩 방법을 제안한다. 제안하는 엔트로피 부호화 기반의 분산 비디오 코딩은 복호기의 복잡도를 줄이기 위하여 기존의 분산 비디오 코딩에서 사용하는 채널코딩을 이용하는 것이 아니라 엔트로피 코딩을 이용하여 부호화를 수행한다. 제안하는 방법에서 복호가는 움집임 추정을 수행하고 그 결과인 움직임 백터를 부호기로 전송하며, 부호기는 전송받은 움직임 백터를 초기 움직임 백터로 하여 움직임 백터 값의 갱신을 수행한다. 제안한 방법의 성능을 평가하기 위하여 기존의 분산 비디오 코딩 방법과 복호기 복잡도를 비교한 결과 99%의 복잡도 감소가 있었고, H.264/AVC의 All Intra 방법과 비교하여 20.3%의 비트율 감소가 있었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.173-176
• /
• 2011

현재 표준화가 진행 중인 HEVC (High-efficiency video coding) 는 기존의 동영상 표준과 마찬가지로 여러 기술들이 혼합된 하이브리드 영상 부호화 프레임 워크 구조를 따르고 있다. 특히, 다양한 크기의 부호화 단위 (Coding Unit : CU), 예측단위 (Prediction Unit : PU), 변환 단위 (Transform Unit : TU) 의 사용으로 인해 HD 이상의 영상에 대하여 기존의 H.264/AVC 보다 약 40%의 압축률 향상을 보이고 있다. 하지만 그로 인하여 부호화기 복잡도가 약 3 배 이상 증가하는 것으로 나타났으며 이는 실시간 부호화가 요구되는 분야에서 큰 문제가 될 것이다. 본 논문은 HEVC 부호화기 복잡도를 낮추기 위하여 최적의 CU 를 결정하는 과정 중 조기에 CU 를 결정하는 고속 CU 결정 방법을 소개한다. 실험 결과, 제안된 방법은 HM과 비교하여 PSNR (Peak Signal to Noise Ratio) 의 손실이 거의 없이 최대 약 58%의 부호화 시간을 절약하였다.