• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6C
• /
• pp.585-593
• /
• 2007

For the improvement of coding efficiency, the H.264 standard uses new coding tools such as VBS, 1/4-pel accurate ME, multiple references, intra prediction, loop filter, etc. Using these coding tools, H.264 has achieved significant improvements from rate-distortion point of view compared to existing standards. However, the encoder complexity is greatly increased due to these coding tools. We focus on the complexity reduction method of intra-mode decision. Our algorithm first restricts selective prediction modes of Intra4x4 using a simple preprocessing. The prediction modes of Intra4x4 are used for restricting those of the other inter-modes. Simulation results show that the proposed method outperforms other conventional methods and save about 82% of total encoding time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8C
• /
• pp.583-590
• /
• 2008

In this paper, we present a spatially adaptive post-processing algorithm for H.264 video coding standard to remove blocking artifacts. The loop filter of H.264 increases computational complexity of the encoder. Furthermore it doesn't clearly remove the blocking artifacts, resulting in over-blurring. For overcoming them, we combine the projection method with the Constraint Least Squares(CLS) method to restore the high quality image. To reflect the Human Visual System, we adopt the weight norm CLS method. Particularly pixel location-based local variance and laplacian operator are newly defined for the CLS method. In addition, the fact that correlation among adjoining pixels is high is utilized to constrain the solution space when the projection method is applied. Quantization Index(QP) of H.264 is also used to control the degree of smoothness. The simulation results show that the proposed post-processing filter works better than the loop filter of H.264 and converges more quickly than the CLS method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.117-124
• /
• 2004

Various multimedia systems have been developed and their application areas widely proliferate. Thus, the interoperability is getting important among various networks and devices. The video transcoding is a technology to solve this interoperability problem among various coding standards. Transcoding can be defined as the conversion of one compressed coded data to another. In this paper, MPEG-2 to MPEG-4 transcoder in the spatial domain is compared with that in the DCT domain. The transcoder is very useful when a video sequence that is originally encoded for digital TV, DVD or satellite broadcasting is served in mobile environment. In order to compare two transcoders, all modules except motion compensation and down sampling are implemented identically. In addition, both transcoders do not search for motion vector. Instead, the decoded information is reused to the encoder. The experimental results show that the transcoder in the spatial domain is usually better than that in the DCT domain with respect to PSNR (Peak Signal-to-Noise Ratio), bitrate and execution time.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.355-361
• /
• 2014

In this paper, we propose a complexity reduction method of sample adaptive offset (SAO), which is an in-loop filter in high-efficiency video coding (HEVC). In the conventional SAO, an offset value is calculated for each coding tree block (CTB) to minimize the error between the original and reconstructed images. In order to determine the optimal offset value, all offset candidates are examined and the offset value that leads to the smallest rate-distortion cost is chosen. Thus, SAO occupies a significant amount of the computational complexity in the HEVC encoder. In the proposed method, we determine the least-used band (LUB) by considering the statistical characteristics of offset values and without processing the offset value included in the LUB. Also, in the offset value decision stage, we check only a certain number of candidates rather than all of them. Experimental results show that the proposed method reduces the encoding time by approximately 8.15% without yielding a significant loss in terms of coding efficiency.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.631-642
• /
• 2013

For the emerging High Efficiency Video Coding (HEVC) standard, a fast transform unit (TU) decision method is proposed. HEVC defines the TU representing a region sharing the same transformation, and it allows a residual block to be split into multiple TUs recursively to form a quadtree. By using the quadtree of TUs, HEVC supports various transform sizes from $4{\times}4$ to $32{\times}32$. The various sizes of TUs can provide a good coding efficiency, whereas this may increase encoding complexity dramatically. In the assumption that a TU with highly compacted energy is unlikely to be split, the proposed method determines TU sizes according to the position of the last non-zero transform coefficient. In the experimental results, the proposed method reduced 18% encoding run time with the negligible coding loss of 0.7% BD-rate for the Random_access case.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.59-72
• /
• 2006

The rapid growth of technology for network and terminal devices is able to service multimedia contents in mobile environments. But as the environment of networks and the performance of devices is varied, the same quality service is very difficult to be provided for user in internet and mobile environment. Therefore, multimedia streaming system must provide an adaptive service in considering network and device environment. Video transcoding techniques are the good solution that can provide video streaming service in various network environments adaptively. This paper proposes a dynamic frame-skipping transcoding scheme to provide adaptive streaming service in various network environments. This scheme uses the prediction period for transcoding. A proposed transcoding scheme can reduce time complexity through combination of prediction period and skipping period to control frame-skipping rate in encoder. In simulation results, the performance of proposed scheme is similar to the performance of a traditional dynamic frame-skipping scheme in PSNR value. But the performance of proposed scheme outperforms the performance of traditional scheme in time complexity.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.471-482
• /
• 2011

This paper introduces an development of high-definition(HD) 3DTV experimental broadcasting system and its experimental service that has been launched via three broadcasting network including terrestrial, cable and satellite in the late of 2010. This 3DTV experimental broadcasting service employs an innovative 3DTV broadcasting mechanism, called as dual stream method in which left and right images are encoded by using each video encoder and multiplexed using MPEG-2 system technology for guaranteeing backward-compatibility with legacy DTV. This paper specifically describes the developed experimental broadcasting system, concentrating on 3DTV re-multiplexer and 3DTV receiver. Finally, implementation and terrestrial 3DTV experimental broadcasting service results will be introduced from the point of objective and subjective evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.720-728
• /
• 2007

For the improvement of coding efficiency, the H.264/AVC video coding standard employs new coding tools compared with existing coding standards. However, due to these new coding tools, the complexity of H.2641AVC encoder is greatly increased. Specially, Inter/Intra mode decision method of H.264/AVC using RDO(rate-distortion optimization) technique is one of the most complex parts in H.264/AVC. In this paper, we focus on the complexity reduction in macroblock mode decision considering coding efficiency. From the simulation results, the proposed algorithm reduce the encoding time by maximum 80% of total, and reduce the bitrate of the overall sequences by $8{\sim}10%$ on the average compared with existing coding methods.

• Journal of Broadcast Engineering
• /
• v.22 no.3
• /
• pp.381-396
• /
• 2017

In this paper, the perceptual rate control algorithm is studied for HEVC (High Efficiency Video Coding) encoder with bit allocation based on perceived visual quality. This paper proposes perceptual rate control algorithm which could consider perceived quality for HEVC encoding method. The proposed rate control algorithm employs adaptive bit allocation for frame and CTU level using the perceived visual importance of each CTU. For performance evaluation of the proposed algorithm, the proposed algorithm was implemented on HM 16.9 and tested for sequences in Class B under the CTC (Common Test Condition) RA (Random Access) case. Experimental results show that the proposed method reduces the bitrate of 3.12%, and improves BD-PSNR of 0.08dB and bitrate accuracy of 0.07% on average. And also, we achieved MOS improvement of 0.16 with the proposed method, compared with the conventional method based on DSCQS (Double Stimulus Continuous Quality Scale).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.74-79
• /
• 2008

In an H.264/AVC video encoder, the motion estimation at fractional pixel accuracy improves a coding efficiency and image quality. However, it requires additional computation overheads for fractional search and interpolation, and thus, reducing the computation complexity of fractional search becomes more important. This paper proposes fast fractional search algorithms by combining the SASR(Simplified Adaptive Search Range) and the MSDSP(Mixed Small Diamond Search Pattern) with the predicted fractional motion vector. Compared with the full search and the prediction-based directional fractional pixel search, the proposed algorithms can reduce up to 93.2% and 81% of fractional search points, respectively with the maximum PSNR lost less than 0.04dB. Therefore, the proposed fast search algorithms are quite suitable for mobile applications requiring low power and complexity.