• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.1
• /
• pp.23-30
• /
• 2010

The H.264/AVC is increasingly used in broadcast video applications such as Internet Protocol television (IPTV), digital multimedia broadcasting (DMB) because of high compression performance. But the H.264/AVC coded video can be delivered to the widespread end-user equipment for MPEG-2 after transcoding between this video standards. This paper suggests a new transcoding algorithm for H.264/AVC to MPEG-2 transcoder that uses motion vector clustering in order to reduce the complexity without loss of video quality. The proposed method is exploiting the motion information gathered during h.264 decoding stage. To reduce the search space for the MPEG-2 motion estimation, the predictive motion vector is selected with a least distortion of the candidated motion vectors. These candidate motion vectors are considering the correlation of direction and distance of motion vectors of variable blocks in H.264/AVC. And then the best predictive motion vector is refined with full-search in ${\pm}2$ pixel search area. Compared with a cascaded decoder-encoder, the proposed transcoder achieves computational complexity savings up to 64% with a similar PSNR at the constant bitrate(CBR).

• Journal of Broadcast Engineering
• /
• v.14 no.1
• /
• pp.93-98
• /
• 2009

While the Motion JPEG2000 has been considered as a unique encoder for digital cinema due to its high quality coding and large screen format, the realization of a digital cinema system and its service cost enormous fund and time. In this paper a digital cinema transmission system with PC and RTP protocol over the Internet is proposed, and showed how tiles of moving images are transmitted, decoded independently and combined to reconstruct and display at a large screen for digital cinema service. The simulation has been carried out for tiles of 128${\times}$128, 256${\times}$256, 512${\times}$512, and 1024${\times}$1024 pixels. In the experiment, two clients of PC’s received and decoded tiles of video and constructed whole size of moving images successfully. The PSNR’s of the video ranges 30dB to 40dB at compression rate of 160:1 and 30dB to 50dB at and below 16:1, respectively. The result showed a possibility for the reconstruction of video in multi-vision.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.578-591
• /
• 2016

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.16 no.5
• /
• pp.793-796
• /
• 2011

H.264/AVC compresses video data by applying DCT transform, quantization and entropy coding processes to the residual signal obtained by inter/intra prediction. This paper proposes a method enhancing an existing DC offset adjustment technology which uses information of neighboring blocks to reduce residual information for improving coding efficiency. DC offset information is not sent over bitstreams, but calculated in the same way both in the decoder and in the encoder. Experimental results show that the proposed method enhances coding efficiency by 0.25% in average BD-Rate compared to H.264/AVC and gives better or worse coding efficiency compared to the existing DC offset method depending on video sequences with coding efficiency degradation by 0.09% in average BD-Rate. This experimental results also show that further coding efficiency improvement is possible by applying the proposed method adaptively to slice or macroblock coding units.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.1029-1039
• /
• 2012

In this papar, we propose a new motion estimation and coding technique using adaptive motion vector resolution. Currently, HEVC encodes a video using 1/4 motion vector resolution. If there are high texture regions in a picture, HEVC can't get a performance enough. So, we insert additional 1-bit flag meaning whether motion vector resolution is 1/4 or 1/8 in PU syntax. Therefore, decoder can recognize the transmitted motion vector resolution. Experimental results show that maximum coding efficiency gain of the proposed method is up to 5.3% in luminance and 7.9% in chrominance. Average computional time complexity is increased about 33% in encoder and up to 5% in decoder.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.405-414
• /
• 2014

High Efficiency Video Coding(HEVC) obtains high compression ratio by applying recursive quad-tree structured coding unit(CU). However, this recursive quad-tree structure brings very high computational complexity to HEVC encoder. In this paper, we present fast CU decision algorithm in recursive quad-tree structure. The proposed algorithm estimates initial CU size before CTU encoding and checks the proposed condition using Coded Block Flag(CBF) and Rate-distortion cost to achieve the fast encoding time saving. And, intra mode estimation is also possible to be skipped using the CBF values acquired during the inter PU mode estimations. Experiment results shows that the proposed algorithm saved about 49.91% and 37.97% of encoding time according to the weighting condition.

• 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.

• The Journal of the Korea Contents Association
• /
• v.12 no.12
• /
• pp.14-24
• /
• 2012

DVC (Distributed Video Coding) techniques need feedback channel for parity bit control to achieve the good RD performances, however, this causes the DVC system to have high decoding latency. In order to implement in real time environments and to accelerate commercializations, many research works have been focusing on the development of fast video decoding algorithm. As one of the real time implementations, this paper deals with a novel DVC scheme suitable for some application areas where source statistics such as motion information can be provided to the encoder side from the decoder side. That is, this paper propose a fast distributed video decoding scheme to improve the decoding speed by using the feedback of motion information derived in SI generation. Through computer simulations, it is shown that the proposed method outperforms the conventional fast DVC decoding schemes.