• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.113-116
• /
• 2007

T-DMB (Terrestrial-DMB) service is now available in the metropolitan area, but due to the bandwidth limitation, it is allowed to provide up to CIF resolution. As users' requests for high-quality mobile multimedia services are rapidly increasing and additional bandwidth can be provided by adopting the hierarchical modulation transmission technology, the research on the Advanced Terrestrial-DMB(AT-DMB) service using the SVC(Scalable Video Coding) scheme is being actively studied. In this paper, through computer simulations, first, while keeping the current T-DMB service unchanged, the visual qualities of AT-DMB services are investigated by varying the additional bandwidth. Then, by considering the cases that the overall bandwidth can be allowed to dynamically allocate to the T-DMB/AT-DMB video services, the performance characteristics between two layers are compared over the different kinds of video sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.5
• /
• pp.521-530
• /
• 1989

Broadband ATM(Asynchronous Transfer Mode) networking techniques based on lightwave technology and high speed integrated circuits appear to be the choice of transport technology for broadband ISDN. Among other problems, the issue of video transport over broadband packet(ATM) networks still requries further investigation. In this paper, the problems of transporting video signals over a broaband packet network are investigated together with possible solutions. In particular, clock recovery packet loss compensation and transport technique based on hierarchical video coding scheme are described in detail. This would allow efficient bandwidth sharing and minimum degradation in video quality.

• Journal of Broadcast Engineering
• /
• v.12 no.3
• /
• pp.250-265
• /
• 2007

In this paper, a fast intermode decision scheme is introduced by efficiently performing the mode decision using statistical hypothesis testing for hierarchical B-picture coding of SVC, in which much computational power is expensed for combined variable block sizes and hierarchical B-pictures. The hypothesis testing in the proposed method is performed on $16{\times}16\;and\;8{\times}8$ blocks to have early termination for RD computation of all possible modes. The early termination in intermode decision is performed by comparing the pixel values of current blocks and corresponding motion-compensated blocks. The proposed scheme exhibits effective early termination behavior in intermode decision and leads to a significant reduction up to 69% in computational complexity with slight increment in bit amounts. The degradation of visual quality turns out to be negligible in terms of PSNR values.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.26-32
• /
• 2008

Video compression schemes have been developed and used for many years. Currently, H.264/AVC is the most efficient video coding standard. The H.264/AVC baseline profile adopts CAVLC(Context-Adaptive Variable Length Coding) method as an entropy coding method. CAVLC gives better performance in compression ratios than conventional VLC(Variable Length Coding). However, because CAVLC decoder uses a lot of VLC tables, the CAVLC decoder requires a lot of area in terms of hardware. Conversely, since it must look up the VLC tables, it gives a worse performance in terms of software. In this paper, we propose a new hierarchical grouping method for the VLC tables. We can obtain an index of codes in the reconstructed VLC tables by simple arithmetic operations. In this method, the VLC tables are accessed just once in decoding a symbol. We modeled the proposed algorithm in C language, compiled under ARM ADS1.2 and simulated it with Armulator. Experimental results show that the proposed algorithm reduces execution time by about 80% and 15% compared with the H.264/AVC reference program JM(Joint Model) 10.2 and the arithmetic operation algorithm which is recently proposed, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11C
• /
• pp.655-661
• /
• 2011

The transmission issues for the scalable video coding extension of H.264/AVC (H.264 SVC) video has been widely studied. In this paper, we propose an objective video-quality assessment metric based on no-reference for H.264 SVC using scalability information. The proposed metric estimate the perceptual video-quality reflecting error conditions with the consideration of the motion vectors, error propagation patterns with the hierarchical prediction structure, quantization parameters, and number of frame which damaged by packet loss. The proposed metric reflects the human perceptual quality of video and we evaluate the performance of proposed metric by using correlation relationship between differential mean opinion score (DMOS) as a subjective quality and proposed one.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.835-849
• /
• 2013

Joint Collaborative Team on Video Coding (JCT-VC), which have founded ISO/IEC MPEG and ITU-T VCEG, has standardized High Efficiency Video Coding (HEVC). Standardization of HEVC has started with purpose of twice or more coding performance compared to H.264/AVC. However, flexible and hierarchical coding block and recursive coding structure are problems to overcome of HEVC standard. Many fast encoding algorithms for reducing computational complexity of HEVC encoder have been proposed. However, it is hard to implement a real-time HEVC encoder only with those fast encoding algorithms. In this paper, for implementation of software-based real-time HEVC encoder, data-level parallelism using SIMD instructions and CPU/GPU multi-threading methods are proposed. And we also proposed appropriate operations and functional modules to apply the proposed methods on HM 10.0 software. Evaluation of the proposed methods implemented on HM 10.0 software showed 20-30fps for $832{\times}480$ sequences and 5-10fps for $1920{\times}1080$ sequences, respectively.

• Journal of information and communication convergence engineering
• /
• v.14 no.4
• /
• pp.240-245
• /
• 2016

Scalable video streaming over wireless networks has many challenges. The most significant challenge is related to packet loss. To overcome this problem, in this paper, we propose an unequal loss protection (ULP) method using a new forward error correction (FEC) mechanism for robust scalable video streaming over wireless networks. For an efficient FEC assignment considering video quality, we first introduce a simple and efficient performance metric, the layer-based recovery rate (LRR), for quantifying the unequal error propagation effects of the temporal and quality layers on the basis of packet losses. LRR is based on the unequal importance in both the temporal and the quality layers of a hierarchical scalable video coding structure. Then, the proposed ULP-LRR method assigns an appropriate number of FEC packets on the basis of the LRR to protect the video layers against packet lossy network environments. Compared with conventional ULP algorithms, the proposed ULP-LRR algorithm demonstrates a higher performance for various error-prone wireless channel statuses.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• Journal of Broadcast Engineering
• /
• v.13 no.4
• /
• pp.501-515
• /
• 2008

Recently, as users' requests for high quality mobile multimedia services are rapidly increasing and additional bandwidth can be provided by adopting the hierarchical modulation transmission technology, the research on the Advanced Terrestrial DMB (AT-DMB) service using the SVC (Scalable Video Coding) scheme is being actively studied. But, in order to realize a compatible video service and to accelerate the successful standardization and commercialization, it is necessary to simplify the compatible encoder structure. In this parer, we propose a fast mode decision method by constraining the redundant coding modes in the spatial scalable encoder that keeps the current T-DMB video in base layer. The proposed method is based on the statistical characteristics of each coding mode at both base and enhancement layers, inter-layer predictions, which are derived by investigating macroblock-layer coding modes of the spatial scalable encoder's functional structure. Through computer simulations, it is shown that a simplified encoder model that reduces the heavy computational burden can be found, while keeping the objective visual quality very high.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.57-61
• /
• 2015

This paper proposes a fast intra prediction algorithm for the High Efficiency Video Coding (HEVC). HEVC has 35 modes, such as DC mode, Planar mode, and 33 angular modes for the intra-prediction. To reduce the complexity and to support fast decision for intra prediction, this paper proposes a hierarchical mode decision method (HMD). The proposed HMD mainly focuses on how to reduce the number of prediction modes. The experimental results show that the proposed HMD can reduce the encoding time about 39.17% with little BDBR loss. On average, the proposed HMD can achieve the encoding time saving e about 14.13 ~ 19.37% compared to that of the existing algorithms with slightly increasing 0.01 ~ 0.42% BDBR.