• Title/Summary/Keyword: Block Adaptive Quantization

Search Result 48, Processing Time 0.021 seconds

The Variable Block-based Image Compression Technique using Wavelet Transform (웨이블릿 변환을 이용한 가변블록 기반 영상 압축)

  • 권세안;장우영;송광훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1378-1383
    • /
    • 1999
  • In this paper, an effective variable-block-based image compression technique using wavelet transform is proposed. Since the statistical property of each wavelet subband is different, we apply the adaptive quantization to each wavelet subband. In the proposed algorithm, each subband is divided into non-overlapping variable-sized blocks based on directional properties. In addition, we remove wavelet coefficients which are below a certain threshold value for coding efficiency. To compress the transformed data, the proposed algorithm quantizes the wavelet coefficients using scalar quantizer in LL subband and vector quantizers for other subbands to increase compression ratio. The proposed algorithm shows improvements in compression ratio as well as PSNR compared with the existing block-based compression algorithms. In addition, it does not cause any blocking artifacts in very low bit rates even though it is also a block-based method. The proposed algorithm also has advantage in computational complexity over the existing wavelet-based compression algorithms since it is a block-based algorithm.

  • PDF

An Adaptive Intra Coding Technique Using 1-D and 2-D Integer Transforms (1차원 및 2차원 정수 변환을 이용한 적응적 화면내 코딩 기법)

  • Park, Min-Cheol;Kim, Dong-Won;Moon, Joo-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.5
    • /
    • pp.66-79
    • /
    • 2009
  • In this paper, we propose a new adaptive intra coding technique using 1-D and 2-D integer transforms for improving coding efficiency of H.264/AVC. Proposed technique selects the most effective transform and prediction mode for each block after processing 1-D and 2-D transforms of all prediction modes. In case of using 1-D transform, $4{\times}4$ block is divided into four $1{\times}4$ or $4{\times}1$ subblocks and then each subblock is predicted and subtracted by using the decoded subblock located at the nearest position in the direction of prediction. After prediction error subblock is processed by 1-D transform and quantization, four subblocks are merged back into original $4{\times}4$ block and then, reordered as 1-D signal by a DC biased zigzag scanning pattern according to the prediction mode. Finally, comparing the coding efficiency between bitstreams based on 1-D transform and conventional 2-D transform, prediction mode and quantized coefficients for each block are decided and corresponding quantized coefficients are transmitted. Experimental results show that the proposed adaptive technique increases 0.34dB in BD-PSNR and decreases 4.03% in BD-Bitrate on the average compared with H.264/AVC.

Iterative Reduction of Blocking Artifact in Block Transform-Coded Images Using Wavelet Transform (웨이브렛 변환을 이용한 블록기반 변환 부호화 영상에서의 반복적 블록화 현상 제거)

  • 장익훈;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2369-2381
    • /
    • 1999
  • In this paper, we propose an iterative algorithm for reducing the blocking artifact in block transform-coded images by using a wavelet transform. In the proposed method, an image is considered as a set of one-dimensional horizontal and vertical signals and one-dimensional wavelet transform is utilized in which the mother wavelet is the first order derivative of a Gaussian like function. The blocking artifact is reduced by removing the blocking component, that causes the variance at the block boundary position in the first scale wavelet domain to be abnormally higher than those at the other positions, using a minimum mean square error (MMSE) filter in the wavelet domain. This filter minimizes the MSE between the ideal blocking component-free signal and the restored signal in the neighborhood of block boundaries in the wavelet domain. It also uses local variance in the wavelet domain for pixel adaptive processing. The filtering and the projection onto a convex set of quantization constraint are iteratively performed in alternating fashion. Experimental results show that the proposed method yields not only a PSNR improvement of about 0.56-1.07 dB, but also subjective quality nearly free of the blocking artifact and edge blur.

  • PDF

Design of video encoder using Multi-dimensional DCT (다차원 DCT를 이용한 비디오 부호화기 설계)

  • Jeon, S.Y.;Choi, W.J.;Oh, S.J.;Jeong, S.Y.;Choi, J.S.;Moon, K.A.;Hong, J.W.;Ahn, C.B.
    • Journal of Broadcast Engineering
    • /
    • v.13 no.5
    • /
    • pp.732-743
    • /
    • 2008
  • In H.264/AVC, 4$\times$4 block transform is used for intra and inter prediction instead of 8$\times$8 block transform. Using small block size coding, H.264/AVC obtains high temporal prediction efficiency, however, it has limitation in utilizing spatial redundancy. Motivated on these points, we propose a multi-dimensional transform which achieves both the accuracy of temporal prediction as well as effective use of spatial redundancy. From preliminary experiments, the proposed multi-dimensional transform achieves higher energy compaction than 2-D DCT used in H.264. We designed an integer-based transform and quantization coder for multi-dimensional coder. Moreover, several additional methods for multi-dimensional coder are proposed, which are cube forming, scan order, mode decision and updating parameters. The Context-based Adaptive Variable-Length Coding (CAVLC) used in H.264 was employed for the entropy coder. Simulation results show that the performance of the multi-dimensional codec appears similar to that of H.264 in lower bit rates although the rate-distortion curves of the multi-dimensional DCT measured by entropy and the number of non-zero coefficients show remarkably higher performance than those of H.264/AVC. This implies that more efficient entropy coder optimized to the statistics of multi-dimensional DCT coefficients and rate-distortion operation are needed to take full advantage of the multi-dimensional DCT. There remains many issues and future works about multi-dimensional coder to improve coding efficiency over H.264/AVC.

Wavelet-based Video Coding Scheme using Multi-resolution Motion Compensation (다중 해상도 움직임 보상을 이용하는 웨이브렛기반 동영상 부호화)

  • 양창모;이병기;조위덕;정하중;호용성
    • Journal of Broadcast Engineering
    • /
    • v.7 no.1
    • /
    • pp.37-44
    • /
    • 2002
  • In this paper. we propose a new video coding scheme with multi-resolution motion compensation and residual quantization. The main functional blocks of the proposed scheme include multi-level wavelet decomposition. motion estimation and motion compensation. raster scanning within each subband. formation of block trees and blocking partitioning. and adaptive arithmetic coding. Although the proposed ceding scheme is simple and requires low computational complexity, it produces bitstreams tilth good features. such as the embedded structure and SNR scalability. Experimental results demonstrate that the proposed coding scheme is quote competitive to and often outperforms other wavelet-based video coding schemes in the literature.

A Study on Image Coding using the Human Visual System and DCT (시각특성과 DCT를 이용한 영상부호화에 관한 연구)

  • 남승진;최성남;전중남;박규태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.4
    • /
    • pp.323-335
    • /
    • 1992
  • In this paper, an adaptive cosine transform coding scheme which incorporate human visual properties into the coding scheme is investigated. Human vision is relatively sensitive to mid-frequency band, and insensitive to very low and very high frequency band. These property was mathematically modelled with MTF(Modulation Transfer Function) through many psychovisual experiment. DCT transforms energy in spatial domain into frequency domain, so can exploit the MTF very efficiently. Another well-known visual characteristics is spatial masking effect that visibility of noise is less in regions of high activity than in regions of low activity. Proposed coding scheme imploys quantization matrix which represent the properties of these spatial frequency response of human vision, and adaptively quality of an image. To compute the activity index of an image block, simple operation is performed in spatial domain, and according to activity index. block of low activity region is more exactly quantized relatively than that of high activity region. Results showed that, at low bit rate, the subjective quality of the reconstructed images by proposed coding scheme is acceptible than that of coding scheme without HVS properties.

  • PDF

Hardware Design of Efficient SAO for High Performance In-loop filters (고성능 루프내 필터를 위한 효율적인 SAO 하드웨어 설계)

  • Park, Seungyong;Ryoo, Kwangki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.543-545
    • /
    • 2017
  • This paper describes the SAO hardware architecture design for high performance in-loop filters. SAO is an inner module of in-loop filter, which compensates for information loss caused by block-based image compression and quantization. However, HEVC's SAO requires a high computation time because it performs pixel-unit operations. Therefore, the SAO hardware architecture proposed in this paper is based on a $4{\times}4$ block operation and a 2-stage pipeline structure for high-speed operation. The information generation and offset computation structure for SAO computation is designed in a parallel structure to minimize computation time. The proposed hardware architecture was designed with Verilog HDL and synthesized with TSMC chip process 130nm and 65nm cell library. The proposed hardware design achieved a maximum frequency of 476MHz yielding 163k gates and 312.5MHz yielding 193.6k gates on the 130nm and 65nm processes respectively.

  • PDF

A Low-Complexity Image Compression Method Which Reduces Memories Used in Multimedia Processor Implementation (멀티미디어 프로세서 구현에 사용되는 메모리를 줄이기 위한 저 복잡도의 영상 압축 알고리즘)

  • Jung Su-Woon;Kim I-Rang;Lee Dong-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.1
    • /
    • pp.9-18
    • /
    • 2004
  • This paper presents an efficient image compression method for memory reduction in multimedia processor which can be simply implemented in hardware and provides high performance. The multimedia processor, which includes processing of high-resolution images and videos, requires large memories: they are external frame memories to store frames and internal line memories for implementing some linear filters. If we can reduce those memories by adopting a simple compression method in multimedia processor, it will strengthen its cost competitiveness. There exist many standards for efficiently compressing images and videos. However, those standards are too complex for our purpose and most of them are 2-D block-based methods, which do not support raster scanned input and output. In this paper, we propose a low-complexity compression method which has good performance, can be implemented with simple hardware logic, and supports raster scan. We have adopted 1${\times}$8 Hadamard transform for simple implementation in hardware and compression efficiency. After analyzing the coefficients, we applied an adaptive thresholding and quantization. We provide some simulation results to analyze its performance and compare with the existing methods. We also provide its hardware implementation results and discuss about cost reduction effects when applied in implementing a multimedia processor.