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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2271-2288
• /
• 2015

The emerging high efficiency video coding (HEVC) standard adopts the quadtree-structured transform unit (TU) in the residual quadtree (RQT) coding. Each TU allows to be split into four equal sub-TUs recursively. The RQT coding is performed for all the possible transform depth levels to achieve the highest coding efficiency, but it requires a very high computational complexity for HEVC encoders. In order to reduce the computational complexity requested by the RQT coding, in this paper, we propose a fast TU size decision method incorporating an adaptive maximum transform depth determination (AMTD) algorithm and a full check skipping - early termination (FCS-ET) algorithm. Because the optimal transform depth level is highly content-dependent, it is not necessary to perform the RQT coding at all transform depth levels. By the AMTD algorithm, the maximum transform depth level is determined for current treeblock to skip those transform depth levels rarely used by its spatially adjacent treeblocks. Additionally, the FCS-ET algorithm is introduced to exploit the correlations of transform depth level between four sub-CUs generated by one coding unit (CU) quadtree partitioning. Experimental results demonstrate that the proposed overall algorithm significantly reduces on average 21% computational complexity while maintaining almost the same rate distortion (RD) performance as the HEVC test model reference software, HM 13.0.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2080-2089
• /
• 2015

In 3D video compression, a disparity vector (DV) pointing a corresponding block position in an adjacent view is a key coding tool to exploit statistical correlation in multi-view videos. In this paper, neighboring block-based disparity vector (NBDV) is shown with detail algorithm descriptions and coding performance analysis. The proposed method derives a DV from disparity motion vector information, obtained from spatially and temporally neighboring blocks, and provides a significant coding gain about 20% BD-rate saving in a texture-video-first-coding scheme. The proposed DV derivation method is adopted into the recent 3D video coding standards such as 3D-AVC and 3D-HEVC as the state-of-the-art DV derivation method.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.585-595
• /
• 2007

Distributed video coding is a new video coding paradigm based on Slepian-Wolf and Wyner-Ziv's information theory Distributed video coding whose decoder exploits side information transfers its computational burden from encoder to decoder, so that encoding with light computational power can be realized. RD performance is superior than that of standard video coding without motion compensation process but still has a gap with that of coding with motion compensation process. This parer introduces basic theory of distributed video coding and its structure and then shows RD performances of DVCs whose coding style is different from each other and of a DVC as a spatial scalable video coder.

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

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.160-174
• /
• 2008

In this paper, we propose new coding techniques for photometry data of three-dimensional(3-D) mesh models. We make a good use of geometry and connectivity information to improve coding efficiency of color, normal vector, and texture data. First of all, we determine the coding order of photometry data exploiting connectivity information. Then, we exploit the obtained geometry information of neighboring vortices through the previous process to predict the photometry data. For color coding, the predicted color of the current vertex is computed by a weighted sum of colors for adjacent vortices considering geometrical characteristics between the current vortex and the adjacent vortices at the geometry predictor. For normal vector coding, the normal vector of the current vertex is equal to one of the optimal plane produced by the optimal plane generator with distance equalizer owing to the property of an isosceles triangle. For texture coding, our proposed method removes discontinuity in the texture coordinates and reallocates texture image segments according to the coding order. Simulation results show that the proposed compression schemes provide improved performance over previous works for various 3-D mesh models.

• ETRI Journal
• /
• v.27 no.3
• /
• pp.330-333
• /
• 2005

The Inter-Channel Level Difference (ICLD) is a cue parameter to estimate spectral information in a binaural cue coding that has been recently in the spotlight as a multichannel audio signal compression technique. Even though the ICLD is an essential parameter, it is generally distorted by quantization. In this paper, a new modified ICLE representation method to minimize the quantization distortion is proposed by adopting a flexible determination of the reference channel and the unidirectional quantization. Our experimental result confirms that the proposed method improves the multichannel audio output quality even with the reduced bit-rate.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.281-284
• /
• 2002

Error resilience for image coding is an important component of multimedia communication system. Error resilience schemes address loss recovery from the compression perspective. Multiple description coding (MDC) is one of the error resilience techniques promising for robust video transmission. It is the way to achieve tradeoff description such as scalar quantization, correlating transform and the quantized frame expansion. In this paper, we consider Multiple Description Scalar Quantization (MDSQ) to wavelet domain. Conventional MDSQ schemes considered description with equal weights in each sub-bands. But, we can see that the each sub-bands is unequal contribution to whole image quality. Therefore, we experiment the multiple design MDSQ table to make probability of zero index high, which gives high efficiency in arithmetic symbol coder. We also compare our proposed method with the conventional methods and show improved performance in terms of redundancy-rate-distortion.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.2
• /
• pp.153-160
• /
• 2000

A Particle Image Velocimetry(PIV) algorithm is developed to analyze whole flow field both qualitatively and quantitatively. The practical use of PIV requires the use of fast, reliable, computer-based methods for tracking numerous particles suspended in a flow field. The TSS, NTSS, FFT-Hybrid, which are developed in the area of image compression and coding, are introduced to develop fast vector search algorithm. The numerical solution of the lid-driven cavity flow by the ADI algorithm with the Wachspress Formula is introduced to produce synthetic data for the validation of the tracking algorithms. The algorithms are applied to image data of real flow experiments. The comparisons in CPU time and mean error show, with a small loss of accuracy, CPU time for tracking is reduced considerably.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.11
• /
• pp.6810-6814
• /
• 2014

The concept of IFS (Iterated Function System) was applied to compress and transmit image data efficiently. To compress the image data with IFS, self-similarity was used to search a similar block. To improve the coding performance for the iterated function system with natural images, the image will be formed of properly transformed parts of itself to minimize the coding error. The simulation results using the proposed IFS represent high PSNR performance and improved compression efficiency with the coefficient of a recursive function.