• ETRI Journal
• /
• v.32 no.4
• /
• pp.577-587
• /
• 2010

The layered coding structure of scalable video coding (SVC) with adaptive inter-layer prediction causes noticeable computational complexity increments when compared to existing video coding standards. To lighten the computational complexity of SVC, we present a fast algorithm to speed up the inter-mode decision process. The proposed algorithm terminates inter-mode decision early in the enhancement layers by estimating the rate-distortion (RD) cost from the macroblocks of the base layer and the enhancement layer in temporal, spatial, and inter-layer directions. Moreover, a search range decision algorithm is also proposed in this paper to further increase the motion estimation speed by using the motion vector information from temporal, spatial, or inter-layer domains. Simulation results show that the proposed algorithm can determine the best mode and provide more efficient total coding time saving with very slight RD performance degradation for spatial and quality scalabilities.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.42-49
• /
• 2011

In this paper, we propose a fast macroblock mode decision algorithm in H.264/AVC, based on the image sequence statistics. Specically, considering the directional characteristics of image sequences, we eliminate sub$8{\times}4$ or sub$4{\times}8$ mode decision process based on the rate-distortion cost of Inter$16{\times}8$ or Inter$8{\times}16$ mode respectively. Additionally, exploiting the optimal modes of submacroblock in inter$8{\times}8$ mode, we propose an algorithm to eliminate Intra$4{\times}4$ or Intra$16{\times}16$ mode decision process selectively. From the simulation results, the proposed method reduce the encoding time by maximum 70% of total, compared with the other conventional methods.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.541-547
• /
• 2017

The Joint Exploration Model (JEM), which is a reference SW codec of the Joint Video Exploration Team (JVET) exploring the future video standard technology, provides a recursive Quadtree plus Binary Tree (QTBT) block structure. QTBT can achieve enhanced coding efficiency by adding new block structures at the expense of largely increased computational complexity. In this paper, we propose a fast decision algorithm of QTBT block partitioning depth that uses the rate-distortion (RD) cost of the upper and current depth to reduce the complexity of the JEM encoder. Experimental results showed that the computational complexity of JEM 5.0 can be reduced up to 21.6% and 11.0% with BD-rate increase of 0.7% and 1.2% in AI (All Intra) and RA (Random Access), respectively.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1058-1068
• /
• 2011

Video FRUC (Frame Rate Up Conversion) is one of the main issues that have arisen in recent years with the explosive growth of video sources and display formats in consumer electronics. Most advanced FRUC algorithms adopt an efficient motion interpolation technique to determine the motion vector field of interpolated frames. But, in some application areas such as post processing in receiver side, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame was reconstructed. In order to achieve this aim, first, this paper introduces some cost functions to estimate the reliability of a block in the MCI frame. Then, by using these functions, this paper proposes two distortion estimation models for evaluating how much noise was produced in the MCI frame. Through computer simulations, it is shown that the proposed estimation methods perform effectively in estimating the noises of the MCI frame.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.927-929
• /
• 2011

Since DVC (Distributed Video Coding) and FRUC (Frame Rate Up Conversion) techniques need to have an efficient motion compensated frame interpolation algorithms. Conventional works of these applications have mainly focused on the performance improvement of overall system. But, in some applications, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame matches the original frame. For this aim, this paper deals with the modeling methods for evaluating the block-based matching cost. First, several matching criteria, which have already been dealt with the motion compensated frame interpolation, are introduced and then combined to make estimate models for the size of MSE (Mean Square Error) noise of the MCI frame to original one. Through computer simulations, it is shown that the block-based cost evaluation models are tested and can be effectively used for estimating the MSE noise.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.141-142
• /
• 2015

본 논문에서는 HEVC(High Efficiency Video Coding)을 위한 고속 부호화 알고리즘을 제안한다. 제안 방법은 HEVC 의 화면내 부호화 과정에서 주변 부호화 모드 정보인 MPM(Most Probable Mode)과 RMD(Rough Mode Decision) 과정의 결과로 얻어지는 후보 모드들의 상관관계를 이용하여 높은 계산 복잡도를 가지는 RDO(Rate-Distortion Optimization) 과정이 고려하는 후보의 개수를 줄여 전체 부호화기의 부호화 복잡도를 낮춘다. 실험 결과에서는 제안 방법이 약 0.29% BD-rate 의 부호화 손실만으로 20.43%의 부호화 복잡도를 감소시켰음을 보인다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.127-132
• /
• 2006

Quantization in video coding plays an important role in controlling the bit-rate of compressed video bit-streams. It has been used as an important control means to adjust the amount of bit-streams to at]owed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG-2 video coding to better maintain the quality of reconstructed frame for given constraints of target bit-rate. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also lower and higher scalability layers where the dependent quantization can be effectively applied, in this paper, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bit-rates with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization, which is widely accepted in R-D (rate-distortion) based optimization, and construct trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity, we employ pruning procedure using monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental result shows that the dependent quantization outperforms the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the dependent quantization is achieved up to 1.25 dB increment in PSNR values and 20% bits saving for the enhancement layer of SVC.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.801-812
• /
• 2005

H.264/AVC is the international video coding standard which has significant improvements of coding efficiency. ITU-T(International Telecommunication Union-Telecommunication standardization sector) and MPEG(Moving Picture Experts Group) adopts various complex coding tool such as variable block size motion, multiple reference frames, quarter-pel motion estimation/compensation (ME/MC) and rate-distortion(RD) optimization, etc. H.264 reference model employs complex mode decision technique based on RD optimization which requires high computational complexity. In this paper, we propose an efficient coding mode decision based on the cost distribution of RD in the macroblock coding mode sequence. Simulation results show that the proposed method reduces encoding time by 34% on average and save the number of computing RD cost by 82%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.867-869
• /
• 2012

FRUC(Frame Rate Up Conversion) is core techniques for higher quality terminals or low channel rate. For these applications, in this paper, we propose a block-based reliability evaluation method for FRUC techniques using bi-lateral symmetrical motion estimation. First, in order to measure the reliability, by introducing cost evaluation tools such as motion vector consistency as well as temporal matching and spatial matching characteristics and then by combining these tools, we propose an efficient method which arrange the blocks according to distortion size. Through several simulations, it is shown that the proposed method is very effective in finding the high distortion blocks. Furthermore, it is expected that the proposed method can be effectively utilized in FRUC techniques and Distributed Video Coding technologies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.121-127
• /
• 2010

This paper relates with the improved CMA blind adaptive equalization algorithm which uses the constellation matching method that improve the inverse modelling efficiency of a communication channel compared to the present CMA blind adaptive equalizer. The amplitude distortion can be compensated in the present CMA blind adaptive equalizer which is used for the reduction of intersymbol interference by distortion that generate such as a band limited wireless mobile channel, but in the improved adaptive alogorithm operates with the minimize the amplitude phase distortion in the output of equalizer by applying the cost function that is composition of additional signal constellation matching error terms. In order to evaluation of the inverse modeling efficiency of improved algorithm, the residual intersymbol interference and recovered signal constellation were compared by computer simulation. As a result of comparion of computer simulation, the improved algorithm has a good stability in the residual intersymbol interference in the steady state, but it has a slow convergence rate in the adaptation state in initial state.