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

Recent advances in video coding technology have resulted in rapid growth of application in mobile communication, With this explosive growth reliable transmission and error resilient technique become increasingly necessary to offer high quality multimedia service. In this paper, we present the result of our investigation on the error resilient performance evaluation of the MPEG-4 simple profile under the H.324/M and the H.264/AVC baseline under the IP packet networks. Especially, we have tested error resilient tools of MPEG-4 simple profile such as resynchronization marker insertion, data partitioning, and of H.264/AVC baseline such as the flexible macroblock ordering (FMO) scheme. The objective quality of decoded video is measured in terms of rate and PSNR under various random bit and burst error conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2464-2479
• /
• 2014

Multi-view video coding is an international encoding standard that attains good performance by fully utilizing temporal and inter-view correlations. However, it suffers from high computational complexity. This paper presents a fast encoder design to reduce the level of complexity. First, when the temporal correlation of a group of pictures is sufficiently strong, macroblock-based inter-view prediction is not employed for the non-anchor pictures of B-views. Second, when the disparity between two adjacent views is above some threshold, frame-based inter-view prediction is disabled. Third, inter-view prediction is not performed on boundary macroblocks in the auxiliary views, because the references for these blocks may not exist in neighboring views. Fourth, finer partitions of inter-view prediction are cancelled for macroblocks in static image areas. Finally, when estimating the disparity of a macroblock, the search range is adjusted according to the mode size distribution of the neighboring view. Compared with reference software, these techniques produce an average time reduction of 83.65%, while the bit-rate increase and peak signal-to-noise ratio loss are less than 0.54% and 0.05dB, respectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.108-111
• /
• 2008

In this paper, we propose an advanced hardware architecture for the CAVLC entropy encoder engine for real time Full HD video compression. Since there are 384 data coefficients which are sum of 376 AC coefficient and 8 DC coefficient per one macroblock, 384 coefficient have to be processed per one macroblock in worst case for real time processing. We propose an novel architecture which includes parallel architecture and pipeline processing, and reduction "0" in AC/DC coefficient table. To verify the proposed architecture, we develop the reference C for CAVLC and verified the designed circuit with the test vector from reference C code.

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

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.868-876
• /
• 1999

In this paper, an efficient automatic video parsing technique on MPEG-compressed video that is fundamental for content-based indexing is described. The proposed method detects scene changes, regardless of IPB picture composition. To detect abrupt changes, the difference measure based on the dc coefficient in I picture and the macroblock reference feature in P and B pictures are utilized. For gradual scene changes, we use the macroblock reference information in P and B pictures. the process of scene change detection can be efficiently handled by extracting necessary data without full decoding of MPEG sequence. The performance of the proposed algorithm is analyzed based on precision and recall. the experimental results verified the effectiveness of the method for detecting scene changes of various MPEG sequences.

• Journal of the Semiconductor & Display Technology
• /
• v.13 no.1
• /
• pp.109-112
• /
• 2014

H.264/AVC is an international video coding standard that is established in cooperation with ITU-T VCEG and ISO/IEC MPEG, which shows improved code and efficiency than the previous video standards. Motion estimation using various macroblock from 44 to 1616 among the compression techniques of H.264/AVC contributes much to high compression efficiency. Generally, in the case of small motion vector or low complexity about P slice is decided $P16{\times}16$ mode encoding method. But according to circumstances, macroblock is decided $P16{\times}16$ mode despite large motion vector. If the motion vector variance is more than threshold and final select mode is $P16{\times}16$ mode, it is switched to $P8{\times}8$ mode, so this paper shows that the storage capacity is reduced. The results of experiment show that the proposed algorithm increases the compression efficiency of the H.264/AVC algorithm to 0.4%, even reducing the time and without increasing complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.445-452
• /
• 2010

In this paper, an attempt has been made to design the controller applicable for H.264 level3 encoder of baseline profile on full hardware basis. The designed controller module first stores the images supplied from CMOS Image Sensor(CIS) at main memory, and then reads or stores the image data in macroblock unit according to encoder operation. The timing cycle of the DMA controller required to process a macroblock is 478 cycles. In order to verify the our design, reference-C encoder, which is compatible to JM 9.4, is developed and the designed controller is verified by using the test vector generated from the reference C code. The number of cycle in the designed DMA controller is reduced by 40% compared with the cycle of using Xilinx MIG.

• Journal of KIISE:Software and Applications
• /
• v.29 no.7
• /
• pp.425-435
• /
• 2002

This paper introduces a macroblock-based rate control algorithm using the neural classifier based in Self Organization feature Maps (SOFM). In contrast to the conventional rate control methods based on the mathematical rate distortion (RD) model and the feedback regression, proposed method can actively adapt to the rapid-varying image characteristics by establishing the global model for bitrate control and by using the SOFM based neural classifier to manage that model. Proposed rate control algorithm has 0.2 dB ~ 0.6 dB better performances than MPEG-4 macroblock-based rate control algorithm by evaluating with the encoded Peak Signal to Noise Ratios while maintaining similar overall computational complexity.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.379-386
• /
• 2004

Video segmentation is a fundamental task in video indexing and it includes two kinds of shot change detections such as the abrupt transition and the gradual transition. The abrupt shot boundaries are detected by computing the image-based distance between adjacent frames and comparing this distance with a pre-determined threshold value. However, the gradual shot boundaries are difficult to detect with this approach. To overcome this difficulty, we propose the method that detects gradual transition in the MPEG compressed video using the HMM (Hidden Markov Model). We take two different HMMs such as a discrete HMM and a continuous HMM with a Gaussian mixture model. As image features for HMM's observations, we use two distinct features such as the difference of histogram of DC images between two adjacent frames and the difference of each individual macroblock's deviations at the corresponding macroblock's between two adjacent frames, where deviation means an arithmetic difference of each macroblock's DC value from the mean of DC values in the given frame. Furthermore, we obtain the DC sequences of P and B frame by the first order approximation for a fast and effective computation. Experiment results show that we obtain the best detection and classification performance of gradual transitions when a continuous HMM with one Gaussian model is taken and two image features are used together.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1359-1365
• /
• 2008

The portion of header in H.264 gets higher than those of previous standards instead of its better compression efficiency. Therefore, this paper proposes a new technique to compress the header of H.264. Unifying a sentence elementary in H.264, H.264 does not consider the distribution of element which be encoded and uses existing Exp-Golomb method, but it is uneffective for variable length coding. Most of the header are block type(s) and motion vector difference(s), and there are redundancies in the header of H.264. The redundancies in the header of H.264 which are analyzed in this paper are three. There are frequently appearing symbols and non-frequently appearing symbols in block types. And when mode 8 is selected in macroblock, all of four sub-macroblock types are transferred. At last, same values come in motion vector difference, especially '0.' This paper proposes the algorithm using type code and quadtree, and with them presents the redundant information of header in H.264. The type code indicates shape of the macroblock and the quadtree does the tree structured motion compensation. Experimental results show that proposed algorithm achieves lower total number of encoded bits over JM12.4 up to 32.51% bit reduction.