• Title/Summary/Keyword: compression coding

Search Result 828, Processing Time 0.029 seconds

A Spatial Band Wavelet Video Coding

  • Kim, Eung-Tae;Park, Sang-Ju
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.603-606
    • /
    • 2002
  • EZW, a wavelet transformation based compression algorithm, utilizes the correlations of the wavelet coefficients between subbands. Due to the reason that, it is based on Zero Tree's parent-descendant dependency of the subbands, subband coding is possible, but it is not efficient for applications, which require multi-resolution restorations. In this paper we compare and analyze the performance between spatial band coding, which apply the correlation between adjusting pixels, and EZW So as to prove that spatial band coding is superior to EZW in the sense that it exhibit higher PSNR values and that it is apt to molti-resolution restoration.

  • PDF

Linear Prediction of Multispectral Images Per Pel Using Classification (영역분류를 이용한 다분광 영상 데이터의 화소 단위 선형 예측 기법)

  • 조윤상;구한승;나성웅
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.163-166
    • /
    • 2000
  • In this paper, we will present a lossy data compression method for coding multispectral images. The proposed method uses both spatial and spectra] correlation inherent in multispectral images. First, band 2 and band 6 are vector quantized. Secondly, band 4 is estimated with the quantized band 2 using the predictive coding. Errors of band 4 are encoded at a second stage based on the magnitude of the errors. Thirdly, remaining bands are calculated with the quantized band 2 and band 4. Errors of residual bands are wavelet transformed and then we apply the SPIHT coding on the transformed coefficients. We classify classes without extra information transmitting and then use linear predictor. And errors can be encoded by SPIHT coding at any target rate we are want. It is shown that this method has better performance than FPVQ. Average PSNR rises 0.645 dB at the same bit rate.

  • PDF

An image coding algorithm using fractal interpolation method (이산 트랙탈 보간법을 이용한 영상 부호화 알고리즘)

  • 이승현;정현민;윤택현;최일상;박규태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.6
    • /
    • pp.82-91
    • /
    • 1996
  • In this paper, an image coding technique using fractal interpolation is proposed. Similar to the conventional methods, an image is partitioned into blocks and each block is coded independently. However, an interpolation point is ahsared by its neighboring blocks. This means that each block can use all its interpolation points with minimal increase of new data. For a simple implementation, triangular blocks are used instead of square blocks and new coefficients are difined. Data obtained in the encoding process hav estatistical characteristics suitable sfor entropy coding, an dthus arithmetic coding is perfomred for improving the compression efficiency. The results of the proposed coder in comparison with those of a conventional coder show that the interpolation method reduces block effect caused by a memoryless block coder, especially at low bit rates. This improvement is due to sharing of information between adjacent blocks. Moreover, th enumber of iteration required in ecoding process is reduced since more information is used to decode each block.

  • PDF

Edge-Based Fast Intra Mode Decision in HEVC

  • Na, Sangkwon;Lee, Wonjae;Lee, Kyohyuk;Yoo, Kiwon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.180-181
    • /
    • 2013
  • High efficiency video coding (HEVC) appears due to the demand on high compression video coding beyond H.264/AVC in ultra-high definition (UHD) videos. As for intra prediction, HEVC has 35 prediction modes while H.264/AVC has 9 intra modes. To exploit the spatial correlation, we adopt an edge detection method, establish the edge map, and adaptively select the candidate modes using the acquired edge information in a block. The number of the candidate modes is determined through trade-off between computational complexity and coding efficiency. Besides, the range of coding unit sizes is determined using the uniqueness of the edge directions for the given image block. As a result, we reduced the encoding time by 56.8% at the cost of 2.5% BD-BR increase on average compared to Full modes at the HEVC reference software (HM 6.0 [1]).

  • PDF

The efficient coding of the upper bands in subband image coding (대역분할 부호화에서 상위대역의 효율적인 부호화)

  • Han, Young-Oh;Park, Hyun-Soo;Shin, Joong-In;Kim, Hyung-Suk;Park, Sang-Hui
    • Proceedings of the KIEE Conference
    • /
    • 1993.11a
    • /
    • pp.346-349
    • /
    • 1993
  • A method for image compression based on decomposition is presented. We design the efficient coding technique for upper band image signals. This coding technique with directive 1-D DPCM is based on the statistical properties of upper bands. Lower band image signals is encoded using 2-D DPCM. The directive 1-D DPCM is performed, scanning upper bands according to edge direction. And then the predicted error signals of upper band sis coded using B1 and Huffman code, and the predicted error signals of lower band is coded using Huffman code. The proposed system shows improved performance when compared with other existing methods with respect to peak signal to noise ratio(PSMR) and human visual system(HVS) properties.

  • PDF

Channel Expansion Technology in MPEG Audio (MPEG 오디오의 채널 확장 기술)

  • Pang, Hee-Suk
    • Journal of Broadcast Engineering
    • /
    • v.16 no.5
    • /
    • pp.714-721
    • /
    • 2011
  • MPEG audio uses the masking effect, high frequency component synthesis based on spectral band replication, and channel expansion based on parametric stereo for efficient compression of audio signals. In this paper, we present an overview of the state-of-the-art channel expansion technology in MPEG audio. We also present technical overviews and application examples to broadcasting services for HE-AAC v.2, MPEG Surround, spatial audio object coding (SAOC), and unified speech and audio coding (USAC) which are MPEG audio codecs based on the channel expansion technology.

ECVQ for Subband Pyramid Image Coding (ECVQ 를 이용한 영상의 계층적 대역분할 부호화)

  • 이광기;김인겸;정준용;류종일;박규태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.88-96
    • /
    • 1994
  • In this paper, we propose a subband pyramid image coding scheme that uses ECVQ (ntropy Constrained Vector Quantizer). In subband pyramid image coding, each subband can be encoded with a coder matched to the statistics of that particular subband, and available versions of the original image at different resolution are easily obtained. ECVQ, aiming at the minimization of the distortion for a fixed entropy of the quantizer output, is well combined with the subband pyramid image coding which yields high compression ratio and good image quality. The optimum bit allocation to each subbands corresponds to the points where the individual distortion rate curves are of particular slope, weighted to the number of samples in that subband, in designing ECVQ.

  • PDF

AN EFFICIENT CODING METHODS FOR THE TWO COMPOSITION TYPES OF THE KOREAN ALPHABET ON A MASPAR MACHINE

  • Min, Yong-Sik
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.1
    • /
    • pp.191-200
    • /
    • 1998
  • There are two types of composition systems for the Korean alphabet: a combined system and a composite system. This paper decribes an efficient coding method for both of these two types. Using this coding method with the combined system yields about 10.5% code-length savings per a Korean character while it yields about 45% savings with the composite system. In other words the coding method produces a better result(i.e. 34.5% better) with the composite system than with the combined system. The simulation has been performed on a MasPar machine having 64 processors. The results show that the combined system achieved a 45.851-fold speedup while the composite system achieved a 47.274-fold speedup.

Digital Hologram Coding Technique using Block Matching of Localized Region and MCTF (로컬영역의 정합기법 및 MCTF를 이용한 디지털 홀로그램 부호화 기술)

  • Seo, Young-Ho;Choi, Hyun-Jun;Kim, Dong-Wook
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.415-416
    • /
    • 2006
  • In this paper, we proposed a new coding technique of digital hologram video using 3D scanning method and video compression technique. The proposed coding consists of capturing a digital hologram to separate into RGB color space components, localization by segmenting the fringe pattern, frequency transform using $M{\tiems}N$ (segment size) 2D DCT (2 Dimensional Discrete Cosine Transform) for extracting redundancy, 3D scan of segment to form a video sequence, motion compensated temporal filtering (MCTF) and modified video coding which uses H.264/AVC.

  • PDF

Lossless Inter-frame Video Coding using Extended JPEG2000

  • IMAIZUMI, Shoko;TAKAGI, Ayuko;KIYA, Hitoshi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1803-1806
    • /
    • 2002
  • This paper describes an effective technique for lossless inter-frame video coding sequences based on a JPEG2000 CODEC. This technique has diminished the compression rate for lossless video coding. In this proposed method, firstly a predicted image for an in- put image is generated by motion estimation(ME), and then a difference image between the input image and the predicted image is calculated, and finally the difference image becomes an input image to a JPEG2000 encoder for lossless coding. Simulation results show the effectiveness of this method.

  • PDF