• Title/Summary/Keyword: compression coding

Search Result 828, Processing Time 0.035 seconds

Wavelet-Based Image Compression Using the Properties of Subbands (대역의 특성을 이용한 웨이블렛 기반 영상 압축 부호화)

  • 박성완;강의성;문동영;고성제
    • Journal of Broadcast Engineering
    • /
    • v.1 no.2
    • /
    • pp.118-132
    • /
    • 1996
  • This paper proposes a wavelet transform- based image compression method using the energy distribution. The proposed method Involves two steps. First, we use a wavelet transform for the subband decomposition. The original image Is decomposed into one low resolution subimage and three high frequency subimages. Each high frequency subimages have horizontal, vertical, and diagonal directional edges. The wavelet transform is luther applied to these high frequency subimages. Resultant transformed subimages have different energy distributions corresponding to different orientation of the high pass filter. Second, for higer compression ratio and computational effciency, we discard some subimages with small energy. The remaining subimages are encoded using either DPCM or quantization followed by entropy coding. Experimental results show that the proposed coding scheme has better performance in the peak signal to noise ratio(PSNR) and higher compression ratio than conventional image coding method using the wavelet transform followed by the straightforward vector quantization.

  • PDF

Quadtree Image Compression Using Edge-Based Decomposition and Predictive Coding of Leaf Nodes (에지-기반 분할과 잎 노드의 예측부호화를 적용한 쿼드트리 영상 압축)

  • Jang, Ho-Seok;Jung, Kyeong-Hoon;Kim, Ki-Doo;Kang, Dong-Wook
    • Journal of Broadcast Engineering
    • /
    • v.15 no.1
    • /
    • pp.133-143
    • /
    • 2010
  • This paper proposes a quadtree image compression method which encodes images efficiently and also makes unartificial compressed images. The proposed compression method uses edge-based quadtree decomposition to preserve the significant edge-lines, and it utilizes the predictive coding scheme to exploit the high correlation of the leaf node blocks. The simulation results with $256\times256$ grayscale images verify that the proposed method yields better coding efficiency than the JPEG by about 25 percents. The proposed method can provide more natural compressed images as it is free from the ringing effect in the compressed images which used to be in the images compressed by the fixed block based encoders such as the JPEG.

Design of CAVLC Decoder for H.264/AVC (H.264/AVC용 CAVLC 디코더의 설계)

  • Jung, Duck-Young;Sonh, Seung-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1104-1114
    • /
    • 2007
  • Digital video compression technique has played an important role that enables efficient transmission and storage of multimedia data where bandwidth and storage space are limited. The new video coding standard, H.264/AVC, developed by Joint Video Team(JVT) significantly outperforms previous standards in compression performance. Especially, variable length code(VLC) plays a crucial pun in video and image compression applications. H.264/AVC standard adopted Context-based Adaptive Variable Length Coding(CAVLC) as the entropy coding method. CAVLC of H.264/AVC requires a large number of the memory accesses. This is a serious problem for applications such as DMB and video phone service because of the considerable amount of power that is consumed in accessing the memory. In order to overcome this problem in this paper, we propose a variable length technique that implements memory-free coeff_token, level, and run_before decoding based on arithmetic operations and using only 70% of the required memory at total_zero variable length decoding.

Lossless Image Compression Using Block-Adaptive Context Tree Weighting (블록 적응적인 Context Tree Weighting을 이용한 무손실 영상 압축)

  • Oh, Eun-ju;Cho, Hyun-ji;Yoo, Hoon
    • Journal of Internet Computing and Services
    • /
    • v.21 no.4
    • /
    • pp.43-49
    • /
    • 2020
  • This paper proposes a lossless image compression method based on arithmetic coding using block-adaptive Context Tree Weighting. The CTW method predicts and compresses the input data bit by bit. Also, it can achieve a desirable coding distribution for tree sources with an unknown model and unknown parameters. This paper suggests the method to enhance the compression rate about image data, especially aerial and satellite images that require lossless compression. The value of aerial and satellite images is significant. Also, the size of their images is huger than common images. But, existed methods have difficulties to compress these data. For these reasons, this paper shows the experiment to prove a higher compression rate when using the CTW method with divided images than when using the same method with non-divided images. The experimental results indicate that the proposed method is more effective when compressing the divided images.

Compression of 3D color integral images using 2D referencing technique (2차원 참조 기법을 이용한 3D 컬러 집적 영상의 압축)

  • Kim, Jong-Ho;Yoo, Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2693-2700
    • /
    • 2009
  • This paper proposes an effective compression method to utilize the 3D integral image with large amount of data obtained by a lens array in various applications. The conventional compression methods for still images exhibit low performance in terms of coding efficiency and visual quality, since they cannot remove the correlation between elemental images. In the moving picture compression methods, 1D scanning techniques that produce a sequence of elemental images are not enough to remove the directional correlation between elemental images. The proposed method effectively sequences the elemental images from an integral image by the 2D referencing technique and compresses them using the multi-frame referencing of H.264/AVC. The proposed 2D referencing technique selects the optimal reference image according to vertical, horizontal, and diagonal correlation between elemental images. Experimental results show that compression with the sequence of elemental images presents better coding efficiency than that of still image compression. Moreover, the proposed 2D referencing technique is superior to the 1D scanning methods in terms of the objective performance and visual quality.

Image Data Compression Based On Region Analysis (Region 재구성에 의한 영상 Data압축)

  • Kim, Hae-Soo;Lee, Keun-Young
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1390-1393
    • /
    • 1987
  • This paper describes the image data compression based on the image decomposition. We reduced the processing time using the segmentation based on the distribution of grey level, and obtained high compression rate using the Huffman run-length coding for the segmented image, and the 2-Dimensional least square curve fitting and the shift coder for each region.

  • PDF

Lossless/lossy Image Compression based on Non-Separable Two-Dimensional LWT

  • Chokchaitam, Somchart;Iwahashi, Masahiro
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.912-915
    • /
    • 2002
  • In this report, we propose a non-separable two-dimensional (2D) Lossless Wavelet Transform (LWT) for image compression. Filter characteristics of our proposed LWT are the same as those or conventional 2D LWT based on applying 1D LWT twice but our coding performance is better due to reduction of rounding effects. Simulation results confirm effectiveness of our proposed LWT.

  • PDF

Reference Frame Memory Compression Using Selective Processing Unit Merging Method (선택적 수행블록 병합을 이용한 참조 영상 메모리 압축 기법)

  • Hong, Soon-Gi;Choe, Yoon-Sik;Kim, Yong-Goo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.339-349
    • /
    • 2011
  • IBDI (Internal Bit Depth Increase) is able to significantly improve the coding efficiency of high definition video compression by increasing the bit depth (or precision) of internal arithmetic operation. However the scheme also increases required internal memory for storing decoded reference frames and this can be significant for higher definition of video contents. So, the reference frame memory compression method is proposed to reduce such internal memory requirement. The reference memory compression is performed on 4x4 block called the processing unit to compress the decoded image using the correlation of nearby pixel values. This method has successively reduced the reference frame memory while preserving the coding efficiency of IBDI. However, additional information of each processing unit has to be stored also in internal memory, the amount of additional information could be a limitation of the effectiveness of memory compression scheme. To relax this limitation of previous memory compression scheme, we propose a selective merging-based reference frame memory compression algorithm, dramatically reducing the amount of additional information. Simulation results show that the proposed algorithm provides much smaller overhead than that of the previous algorithm while keeping the coding efficiency of IBDI.

Improved FGS Coding System Based on Sign-bit Reduction in Embedded Bit-plane Coding

  • Seo, Kwang-Deok;Davies, Robert J.
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.3
    • /
    • pp.129-137
    • /
    • 2007
  • MPEG-4 FGS is one of scalable video coding schemes specified In ISO/IEC 14496-2 Amendment 2, and particularly standardized as a scheme for providing fine granular quality and temporal scalabilities. In this paper, we propose a sign-bit reduction technique in embedded bit-plane coding to enhance the coding efficiency of MPEG-4 FGS system. The general structure of the FGS system for the proposed scheme is based on the standard MPEG-4 FGS system. The proposed FGS enhancement-layer encoder takes as input the difference between the original DCT coefficient and the decision level of the quantizer instead of the difference between the original DCT coefficient and its reconstruction level. By this approach, the sign information of the enhancement-layer DCT coefficients can be the same as that of the base-layer ones at the same frequency index in DCT domain. Thus, overhead bits required for coding a lot of sign information of the enhancement-layer DCT coefficients in embedded bit-plane coding can be removed from the generated bitstream. It is shown by simulations that the proposed FGS coding system provides better coding performance, compared to the MPEG-4 FGS system in terms of compression efficiency.

  • PDF

Forward Adaptive Prediction on Modified Integer Transform Coefficients for Lossless Image Compression (무손실 영상 압축을 위한 변형된 정수 변환 계수에 대한 순방향 적응 예측 기법)

  • Kim, Hui-Gyeong;Yoo, Hoon
    • 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.