• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1093-1104
• /
• 2014

The High Efficiency Video Coding (HEVC) is a new video coding standard that can provide much better compression efficiency than its predecessor H.264/AVC. However, it is computationally more intensive due to the use of flexible quadtree coding unit structure and more choices of prediction modes. In this paper, a fast intraframe coding scheme is proposed for HEVC. Firstly, a fast bottom-up pruning algorithm is designed to skip the mode decision process or reduce the candidate modes at larger block size coding unit. Then, a low complexity rough mode decision process is adopted to choose a small candidate set, followed by early DC and Planar mode decision and mode filtering to further reduce the number of candidate modes. The proposed method is evaluated by the HEVC reference software HM8.2. Averaging over 5 classes of HEVC test sequences, 41.39% encoding time saving is achieved with only 0.77% bitrate increase.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.492-499
• /
• 2019

HEVC is the high efficiency video coding standard, which provides better coding efficiency contrasted with the other video coding standard. But at the same time the computational complexity increases drastically. Thirty-five kinds of intra-prediction modes are defined in HEVC, while 9 kinds of intra prediction modes are defined in H.264/AVC. This paper proposes a fast rough mode decision (RMD) algorithm which adopts the smoothness of the up-reference pixels and the left-reference pixels to decrease the computational complexity. The three step search method is implemented in RMD process. The experimental results compared with HM13.0 indicate that the proposed algorithm can save 39.7% of the encoding time, while Bjontegaard delta bitrate (BDBR) is increased slightly by 1.35% and Bjontegaard delta peak signal-to-noise ratio (BDPSNR) loss is negligible.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.3
• /
• pp.171-181
• /
• 2012

In the new video coding standard, called high efficiency video coding (HEVC), the coding unit (CU) is adopted as a basic unit of a coded block structure. Therefore, the rate control (RC) methods of H.264/AVC, whose basic unit is a macroblock, cannot be applied directly to HEVC. This paper proposes the largest CU (LCU) level RC method for hierarchical video coding in a HEVC. In the proposed method, the effective bit allocation is performed first based on the hierarchical structure, and the quantization parameters (QP) are then determined using the Cauchy density based rate-quantization (RQ) model. A novel method based on the linear rate model is introduced to estimate the parameters of the Cauchy density based RQ model precisely. The experimental results show that the proposed RC method not only controls the bitrate accurately, but also generates a constant number of bits per second with less degradation of the decoded picture quality than with the fixed QP coding and latest RC method for HEVC.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.339-345
• /
• 2007

Video transcoding is a technique used to convert a compressed input video stream with an arbitrary format, size, and bitrate into a different attribute video stream different attributes to provide a efficient video streaming service for the customers is dispersed in the heterogeneous networks. Specifically, frames deletion occur in a transcoding scheme that exploits the adjustment of frame rate, and at this time, the loss in temporal relation among frames due to frame deletion is compensated for the prediction of motion estimation by reusing motion vectors in the would-be deleted frames. But the processing time for transcoding don't have an improvement as much as our expectation because transcoding is done only within the transcoder. So in this paper, we propose a new transcoding algorithm based on prediction period to improve transcoding-related processing time. For this, we also modify the existing encoder so as to adjust dynamically frame rate based on the prediction period and deletion period of frames. To check how the proposed algorithm works nicely, we implement a video streaming system with the new transcoder and encoder to which it is applied. The result of the performance test shows that the streaming system with proposed algorithm improve 60% above in processing time and also PSNR have a good performance while the quality of pictures is preserved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1123-1129
• /
• 2003

In the H.264 video coding standard, the information for the macroblock is encoded by the independent syntax elements, called RUN and MB_type. Through the experimental observation for various test sequences, it is shown that the performance of the video coding is improved by using the combined RUN and MB_type as an entity. Based on this fact, we propose an unified new syntax element composed of the RUN and MB_type in order to improve the compression ratio of H.264 video coding. In the proposed syntax element, an EOF(End-Of-Frame) symbol indicating the end of picture is used for enhancing the performance of video coding. The simulation result shows that the proposed method outperforms maximally 15 % to the conventional method for the bitrate of the macroblock.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.640-655
• /
• 2014

Many of today's video systems have additional depth camera to provide extra features such as 3D support. Thanks to these changes made in multimedia system, it is now much easier to obtain depth information of the video. Depth information can be used in various areas such as object classification, background area recognition, and so on. With depth information, we can achieve even higher coding efficiency compared to only using conventional method. Thus, in this paper, we propose the 2D video coding algorithm which uses depth information on top of the next generation 2D video codec HEVC. Background area can be recognized with depth information and by performing HEVC with it, coding complexity can be reduced. If current CU is background area, we propose the following three methods, 1) Earlier stop split structure of CU with PU SKIP mode, 2) Limiting split structure of CU with CU information in temporal position, 3) Limiting the range of motion searching. We implement our proposal using HEVC HM 12.0 reference software. With these methods results shows that encoding complexity is reduced more than 40% with only 0.5% BD-Bitrate loss. Especially, in case of video acquired through the Kinect developed by Microsoft Corp., encoding complexity is reduced by max 53% without a loss of quality. So, it is expected that these techniques can apply real-time online communication, mobile or handheld video service and so on.

• ETRI Journal
• /
• v.44 no.1
• /
• pp.38-50
• /
• 2022

This paper presents a study on the use of encoder-derived features in decoder-side depth estimation. The scheme of multiview video encoding does not require the transmission of depth maps (which carry the geometry of a three-dimensional scene) as only a set of input views and their parameters are compressed and packed into the bitstream, with a set of features that could make it easier to estimate geometry in the decoder. The paper proposes novel recursive block splitting for the feature extraction process and evaluates different scenarios of feature-driven decoder-side depth estimation, performed by assessing their influence on the bitrate of metadata, quality of the reconstructed video, and time of depth estimation. As efficient encoding of multiview sequences became one of the main scopes of the video encoding community, the experimental results are based on the "geometry absent" profile from the incoming MPEG Immersive video standard. The results show that the quality of synthesized views using the proposed recursive block splitting outperforms that of the state-of-the-art approach.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.6-11
• /
• 2001

본 논문에서는 서로 다른 공간해 상도를 갖는 두계층 영상부호화대서 하위계층에는 낮은 우선순위로 인하여 제한된 일정부호화율로 부호화하고, 반면에 각 영상의 상위계층에는 우선순위를 높게 하면서 서로간 균등한 화질을 제공하는 대역할당 방법을 제안한다. 이를 위해서 MPEG-2 공간계층적 부호화구조에서 부호화율-왜곡의 관계를 찾고, 실시간으로 상위계층 영상 사이에 균등한 화필을 제공하는 부호화율 제어방법을 제안한다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.62-69
• /
• 1992

The conventional BMA is performed with the fixed block size. For better performance at low bitrate, the block size is required to be large in relatively stationary area, while small in moving area. Thus, in this paper, a video coding technique using variable block size model is proposed. It decides the block size based on the degree of local motion defined by the local mean and variance of blocks. Computer simulation shows that the proposed method gives comparable performance to the conventional one with less bits required for motion vector coding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2430-2447
• /
• 2013

In recent years, HTTP adaptive streaming (HAS) has attracted considerable attention as the state-of-the-art technology for video transport. HAS dynamically adjusts the quality of video streaming according to the network bandwidth and device capability of users. Content-Centric Networking (CCN) has also emerged as a future Internet architecture, which is a novel communication paradigm that integrates content delivery as a native network primitive. These trends have led to the new research issue of harmonizing HAS with the in-network caching provided by CCN routers. Previous research has shown that the performance of HAS can be improved by using the H.264/SVC(scalable video codec) in the in-network caching environments. However, the previous study did not address the misbehavior that causes video freeze when overestimating the available network bandwidth, which is attributable to the high cache hit rate. Thus, we propose a new SVC-based adaptation algorithm that utilizes a drop timer. Our approach aims to stop the downloading of additional enhancement layers that are not cached in the local CCN routers in a timely manner, thereby preventing excessive consumption of the video buffer. We implemented our algorithm in the SVC-HAS client and deployed a testbed that could run Smooth-Streaming, which is one of the most popular HAS solutions, over CCNx, which is the reference implementation of CCN. Our experimental results showed that the proposed scheme (SLA) could avoid video freeze in an effective manner, but without reducing the high hit rate on the CCN routers or affecting the high video quality on the SVC-HAS client.