• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.6
• /
• pp.1273-1278
• /
• 2012

In this paper, we introduce modified integer transforms for lossless image compression and evaluate their performances for two-dimensional transforms. The two-dimensional extensions of the modified integer transforms show different performances in terms of coding efficiency and computational complexity. Thus, we measure performances for two-dimensional separable transforms and a two-dimensional non-separable transform. The separable modified integer transform used in H.264, the modified integer transform using the lifting scheme, and the non-separable transform in JPEG XR are evaluated in this paper. Also, experiments and their results are given. The experimental results indicate that the modified integer transform using the lifting scheme shows the best performance in terms of compression efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2254-2260
• /
• 2010

This papers describes modification of the integer transform used in H.264/AVC in order to efficiently apply to lossless compression. The previous reversible integer transform is not efficient for lossless compression due to large dynamic range of the transform coefficients. To reduce the problem, efficient and reversible integer transforms are proposed. The modified transforms are designed based on the lifting scheme for fast transforms. This paper introduces signal flow graphs for the proposed fast transforms and provides corresponding experimental results. The results indicate that the proposed modified reversible integer transform are superior to the previous transform in terms of lossless compression efficiency.

• ETRI Journal
• /
• v.27 no.5
• /
• pp.511-524
• /
• 2005

In this paper, we propose a novel hardware architecture for an intra-prediction, integer transform, quantization, inverse integer transform, inverse quantization, and mode decision module for the macroblock engine of a new video coding standard, H.264. To reduce the cycle of intra prediction, transform/quantization, and inverse quantization/inverse transform of H.264, a reduction method for cycle overhead in the case of I16MB mode is proposed. This method can process one macroblock for 927 cycles for all cases of macroblock type by processing $4{\times}4$ Hadamard transform and quantization during $16{\times}16$ prediction. This module was designed using Verilog Hardware Description Language (HDL) and operates with a 54 MHz clock using the Hynix $0.35 {\mu}m$ TLM (triple layer metal) library.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.253-256
• /
• 2000

In this paper, we propose the lossless image compression algorithm using the integer wavelet transform. Recently, the S＋P transform is widely used and computed with only integer addition and bit-shift operations, but not proper to remove the correlation of smooth images. then we compare the Harr wavelet of the S＋P transform with various integer coefficient filter banks and apply 9/7 ICFB to the wavelet transform. In addition, we propose a entropy-coding method that exploits the multiresolution structure and the feedback of the prediction error, and can efficiently compress the transformed image for progressive transmission. Simulation results are compared to the compression ratio using the S+P transform with different types of images.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.106-114
• /
• 2016

In this paper, we propose an efficient integer inverse transform structure for vp9 decoder. The proposed structure is a hardware structure which is easy to control and requires less hardware resources, and shares algorithms for realizing entire DCT(Discrete Cosine Transform), ADST(Asymmetric Discrete Sine Transform) and WHT(Walsh-Hadamard Transform) in vp9. The integer inverse transform for vp9 google model has a fast structure, named butterfly structure. The integer inverse transform for google C model, unlike universal fast structure, takes a constant rounding shift operator on each stage and includes an asymmetrical sine transform structure. Thus, the proposed structure approximates matrix coefficient values for all transform mode and is used to matrix operation method. With the proposed structure, shared operations for all inverse transform algorithm modes can be possible with reduced number of multipliers compared to the butterfly structure, which in turn manages the hardware resources more efficiently.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.388-393
• /
• 2007

In designing transform coders bit allocation is one of the important issues. In this paper we propose two optimal algorithms for integer bit allocation in transform coding. Based on high-resolution formulas for bit allocation, the most and least greedy algorithms are developed to optimally adjust non-integer bit rates of coefficient quantizers to integer values. In particular, a duality property is observed between the two greedy algorithms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1207-1214
• /
• 1995

We present an optimized integer cosine transform(OICT) as an alternative approach to the conventional discrete cosine transform(DCT), and its fast computational algorithm. In the actual implementation of the OICT, we have used the techniques similar to those of the orthogonal integer transform(OIT). The normalization factors are approximated to single one while keeping the reconstruction error at the best tolerable level. By obtaining a single normalization factor, both forward and inverse transform are performed using only the integers. However, there are so many sets of integers that are selected in the above manner, the best OICT matrix obtained through value minimizing the Hibert-Schmidt norm and achieving fast computational algorithm. Using matrix decomposing, a fast algorithm for efficient computation of the order-8 OICT is developed, which is minimized to 20 integer multiplications. This enables us to implement a high performance 2-D DCT processor by replacing the floating point operations by the integer number operations. We have also run the simulation to test the performance of the order-8 OICT with the transform efficiency, maximum reducible bits, and mean square error for the Wiener filter. When the results are compared to those of the DCT and OIT, the OICT has out-performed them all. Furthermore, when the conventional DCT coefficients are reduced to 7-bit as those of the OICT, the resulting reconstructed images were critically impaired losing the orthogonal property of the original DCT. However, the 7-bit OICT maintains a zero mean square reconstruction error.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.7
• /
• pp.1003-1008
• /
• 2013

This paper proposes a compression scheme based on the modified reversible integer transform (MRIT) and forward adaptive prediction for lossless image compression. JPEG XR is the newest image coding standard with high compression ratio and that composed of the Photo Core Transform (PCT) and backward adaptive prediction. To improve the efficiency and quality of compression, we substitutes the PCT and backward adaptive prediction for the modified reversible integer transform (MRIT) and forward adaptive prediction, respectively. Experimental results indicate that the proposed method are superior to the previous method of JPEG XR in terms of lossless compression efficiency and computational complexity.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.3
• /
• pp.45-50
• /
• 2009

Recently, block-based transforms, like discrete cosine transform (DCT), have been widely used in image and video coding standards, but block-based transforms have a weak point with blocking effect. However, the integer lapped orthogonal transform (ILOT) is a tool for block-based coding with bases functions that overlap near blocks, so it has a strong point against blocking effect. Although it has slightly higher arithmetic complexity than the DCT, the coding gain is significantly higher with much less blocking artifacts. This paper introduces the integer lapped orthogonal transforms and discrete cosine transform. And we compare the performance of DCT with ILOT which is proposed a new efficient method for image coding applications.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.6
• /
• pp.525-531
• /
• 2013

In this paper, we propose to apply low delay algorithm using power complementary window to Integer Modified Discrete Cosine Transform (IntMDCT). Conventional transform, the Modified Discrete Cosine Transform (MDCT) usually produces floating point values for integer input values. This causes the expansion of the data. To refine on this, IntMDCT that produces integer values even for integer input values have emerged. However, IntMDCT has a problem of the algorithm delay, such as MDCT. Delay has became a key issue in environments for the purpose of real-time communications. In order to reduce the delay, the proposed algorithm was applied and the results of the performance evaluation show that delay of IntMDCT has reduced by halfexisting delay.