• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2376-2385
• /
• 1994

In receiving the digital TV signal, both decoding delay and the channel hopping delay are very critical factors in applications. The intra-slice coding in the MPEG-2 SIMPLE PROFLE of No B-picture is one of the primary methods for short delay time in video decoding. It has the advantage of short decoding delay, but has the drawback of long channel hopping delay time. In this paper, we propose a method to reduce the channel delay with negligible loss in SNR performance. It is shown that dividing pictures into several regions of slices and adding some restriction in motion vector search for inter-frame coding. hence the random acess points are effectively increased. and the channel hopping delay is reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.426-445
• /
• 2012

Conventional rate control (RC) schemes for H.264 video coding usually regulate output bit rate to match channel bandwidth by adjusting quantization parameter (QP) at fixed full frame rate, and the passive frame skipping to avoid buffer overflow usually occurs when scene changes or high motions exist in video sequences especially at low bit rate, which degrades spatial-temporal quality and causes jerky effect. In this paper, an active content adaptive frame skipping scheme is proposed instead of passive methods, which skips subjectively trivial frames by structural similarity (SSIM) measurement between the original frame and the interpolated frame via motion vector (MV) copy scheme. The saved bits from skipped frames are allocated to coded key ones to enhance their spatial quality, and the skipped frames are well recovered based on MV copy scheme from adjacent key ones at the decoder side to maintain constant frame rate. Experimental results show that the proposed active SSIM-based frameskip scheme acquires better and more consistent spatial-temporal quality both in objective (PSNR) and subjective (SSIM) sense with low complexity compared to classic fixed frame rate control method JVT-G012 and prior objective metric based frameskip method.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.162-165
• /
• 2010

In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2/4 AVC standards.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.459-470
• /
• 2008

In this paper, we propose a fast ME (motion estimation) algorithm for MPEG-4 to H.264 Transcoder. Whereas 2 modes ($8{\times}8$, $16{\times}16$) are used for ME in MPEG-4 simple profile, ME using 7 modes is supported for further enhanced coding efficiency in H.264. The transcoding speed is affected dominantly by the computational complexity of encoder part in transcoder, where ME module of H.264 encoder has high complexity due to using 7 modes. In order to increase the speed of transcoding between MPEG-4 and H.264, we use 3 PMVs (predicted motion vectors) and the mode information of MBs (macroblocks) provided from the decoder part of transcoder. Since the proposed 3 PMVs are very close to an optimal motion vector, and we consider only some restricted modes according to the MB information transferred from decoder part, the proposed scheme can speed up the transcoding procedure without loss of image quality. We show experimental results which demonstrate the effectiveness of the proposed algorithm, where performance of our scheme is compared with that of the conventional fast algorithm for H.264.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.312-320
• /
• 2008

The macroblock-based adaptive interpolation filter method has been considered to be able to achieve high coding efficiency in H.264/AVC. In this method, although the filter selection criterion considered in terms of rate and distortion have showed a good performance, it still leaves room for improvement. To improve high coding efficiency better than conventional method, we propose a new filter selection criterion which considers two bit rates, motion vector and prediction error, and reconstruction error. In addition, the algorithm for reducing the overhead of transmitting the selected filter information is presented. Experimental results show that the proposed method significantly improves the coding efficiency compared to ones using conventional criterion. It leads to about a 5.19% (1 reference frame) and 5.14% (5 reference frames) bit rate savings on average compared to H.264/AVC, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.355-363
• /
• 2011

Recently, as one of several methods to improve the performance of DVC(Distributed Video Coding) system, many research works are focusing on the iterative refinement of side information. Most of the conventional techniques are mainly based on the relationship between the reconstruction level and side information, or the vector median filtering of motion vectors, but, their performance improvements are restricted. In order to overcome the performance limit of the conventional schemes, in this paper, a side information generation scheme is designed by measuring the block-cost estimation. Then, by adaptively selecting the compensation mode using the received bit-plane information, we propose a block-adaptive iterative refinement which is efficient for non-symmetric moving objects. Computer simulations show that, by using the proposed refinement method, the performance can be improved up to 0.2 dB in rate-distortion.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.31-43
• /
• 1999

The main goal of this paper is to design a high performance SVP(Stack based Video Processor) for network applications. The SVP is a comprehensive scheme; 'better' in the sense that it is an optimal selection of previously proposed enhancements of a stack machine and a video processor. This can process effectively object-based video data using a S-RISC(Stack-based Reduced Instruction Set Computer) with a semi -general-purpose architecture having a stack buffer for OOP(Object-Oriented Programming) with many small procedures at running programs. And it includes a vector processor that can improve the MPEG coding speed. The vector processor in the SVP can execute advanced mode motion compensation, motion prediction by half pixel and SA-DCT(Shape Adaptive-Discrete Cosine Transform) of MPEG-4. Absolutors and halfers in the vector processor make this architecture extensive to a encoder. We also designed a VLSI stack-oriented video processor using the proposed architecture of stack-oriented video decoding. It was designed with O.5$\mu\textrm{m}$ 3LM standard-cell technology, and has 110K logic gates and 12 Kbits SRAM internal buffer. The operating frequency is 50MHz. This executes algorithms of video decoding for QCIF 15fps(frame per second), maximum rate of VLBV(Very Low Bitrate Video) in MPEG-4.

• 전자공학회논문지 IE
• /
• v.47 no.2
• /
• pp.21-26
• /
• 2010

This paper proposed an efficient algorithm to reduce the amount of calculation for Scalability Extension which takes a great deal of the operational time in H.264/AVC. This algorithm decides a search range according to the direction of predicted motion vector, and then performs an adaptive spiral search for the candidates with JM(Joint Model) FME(Fast Motion Estimation) which employs the rate-distortion optimization(RDO) method. Experimental results by applying the proposed method to various video sequences showed that the process time was decreased up to 80% comparing to the previous prediction methods. The degradation of video Quality was only from 0.05dB to 0.19dB and the compression ratio decreased as small as 0.58% in average. Therefore, we are sure that the proposed method is an efficient method for the fast inter prediction.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.75-84
• /
• 2006

With considering center-biased characteristic, NTSS(New Three-Step Search Algorithm) can improve the performance of TSS(Three-Step Search Algorithm) which is one of the most popular fast block matching algorithms(BMA) to search a motion vector in a video sequence. Although NTSS has generally better Quality than TSS for a small motion sequence, it is hard to say that NTSS can provide better quality than TSS for a large motion sequence. It even deteriorates the quality to increase a search window size using NTSS. In order to address this drawback, this paper aims to develop a new adaptive window size-based three step search scheme, called AWTSS, which can improve quality at various window sizes in both the small and the large motion video sequences. In this scheme, the search window size is dynamically changed to improve coding efficiency according to the characteristic of motion vectors. AWTSS can improve the video quality more than 0.5dB in case of large motion with keeping the same quality in case of small motion.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.991-999
• /
• 2010

In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.