• 제목/요약/키워드: compression coding

검색결과 828건 처리시간 0.033초

A Study on the Composition of Compact Code using Octal-Compact Mapping Technique (OCM방법을 이용한 Compact Code의 구성에 관한 연구)

  • 김경태;민용식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제9권3호
    • /
    • pp.103-107
    • /
    • 1984
  • According to rapid developments in data communication, we have being used every infromation with ease. In receiving and transmitting the infromation acquired, it is being needed to transmit it with minimizing bits if possible. Therefore this paper suggests the efficient coding system, that is, OCM(Octal-Compact Mapping) technique. In case of average-case, it has 3.5bytes in entropy with 8 symbols. This means it is compressed more than at least 1 byte as compared with another coding techniques. It decreases the redundancy of data and is superior to another data compression techniques.

  • PDF

ECG Data Coding Using Piecewise Fractal Interpolation

  • Jun, Young-Il;Jung, Hyun-Meen;Yoon, Young-Ro;Yoon, Hyung-Ro
    • Proceedings of the KOSOMBE Conference
    • /
    • 대한의용생체공학회 1994년도 추계학술대회
    • /
    • pp.134-137
    • /
    • 1994
  • In this paper, we describe an approach to ECG data coding based on a fractal theory of iterated contractive transformations defined piecewise. The main characteristic of this approach is that it relies on the assumption that signal redundancy can be efficiently captured and exploited through piecewise self-transformability on a block-wise basis. The variable range size technique is employed to reduce the reconstruction error. Large ranges are used for encoding the smooth waveform to yield high compression efficiency, and the smaller ranges are used for encoding rapidly varying parts of the signal to preserve the signal quality. The suggested algorithm was evaluated using MIT/BIH arrhythmia database. A high compression ratio is achieved with a relatively low reconstruction error.

  • PDF

Colorization-based Coding By Using Watershed Segmentation For Optimization

  • Wang, Ping;Lee, Byung-Gook
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
    • /
    • pp.40-42
    • /
    • 2012
  • Colorization is a method using computer to add color to a black and white image automatically. The input is a grayscale image and some representative pixels (RPs). The RPs contain the color information for the image, and it indicates each region's color information. Colorization-based coding is a novel way for lossy image compression, it decodes a color image to get grayscale image and extracts RPs from the image. Because RPs decides the region's color and we also want small data size for image compression, form this viewpoint the paper proposes a way to get better and fewer RPs based on watershed segmentation. According to the segmentation result we also improve the original chrominance blending colorization method to save decode time and get better reconstruct image.

  • PDF

Image Data Compression Using Laplacian Pyramid Processing and Vector Quantization (라플라시안 피라미드 프로세싱과 백터 양자화 방법을 이용한 영상 데이타 압축)

  • Park, G.H.;Cha, I.H.;Youn, D.H.
    • Proceedings of the KIEE Conference
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.1347-1351
    • /
    • 1987
  • This thesis aims at studying laplacian pyramid vector quantization which keeps a simple compression algorithm and stability against various kinds of image data. To this end, images are devied into two groups according to their statistical characteristics. At 0.860 bits/pixel and 0.360 bits/pixel respectively, laplacian pyramid vector quantization is compared to the existing spatial domain vector quantization and transform coding under the same condition in both objective and subjective value. The laplacian pyramid vector quantization is much more stable against the statistical characteristics of images than the existing vector quantization and transform coding.

  • PDF

Adaptive Near-Lossless Image Coding (적응적 준무손실 영상 부호화)

  • Kim, Young-Ro;Yi, Joon-Hwan
    • 전자공학회논문지 IE
    • /
    • 제46권4호
    • /
    • pp.42-48
    • /
    • 2009
  • In this paper, we propose adaptive near-lossless image coding algorithm according to bandwidth while maintaining image quality. The proposed method adjusts error range using amounts of encoded bits and target bits at a slice encoding interval. Experimental results show that our proposed method not only almost fits compression into bandwidth, but also has better image quality.

Lossless Medical Image Compression with SPIHT and Lifting Steps (SPIHT알고리즘과 Lifting 스텝을 이용한 무손실 의료 영상 압축 방법)

  • 김영섭;정제창
    • Proceedings of the IEEK Conference
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2395-2398
    • /
    • 2003
  • This paper focuses on lossless medical image compression methods for medical images that operate on two-dimensional(2D) reversible integer wavelet transform. We offer an application of the Set Partitioning in Hierarchical Trees(SPIHT) algorithm [1][3][9] to medical images, using a 2D wavelet decomposition and a 2D spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method, where careful scaling and truncations keep the integer precision small and the transform unitary. We have tested our encoder on medical images using different integer filters. Results show that our algorithm with certain filters performs as well and sometimes better in lossless coding than previous coding systems using 2D integer wavelet transforms on medical images.

  • PDF

A Lossless Data Hiding Scheme for VQ Indexes Based on Joint Neighboring Coding

  • Rudder, Andrew;Kieu, The Duc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.2984-3004
    • /
    • 2015
  • Designing a new reversible data hiding technique with a high embedding rate and a low compression rate for vector quantization (VQ) compressed images is encouraged. This paper proposes a novel lossless data hiding scheme for VQ-compressed images based on the joint neighboring coding technique. The proposed method uses the difference values between a current VQ index and its left and upper neighboring VQ indexes to embed n secret bits into one VQ index, where n = 1, 2, 3, or 4. The experimental results show that the proposed scheme achieves the embedding rates of 1, 2, 3, and 4 bits per index (bpi) with the corresponding average compression rates of 0.420, 0.483, 0.545, and 0.608 bit per pixel (bpp) for a 256 sized codebook. These results confirm that our scheme performs better than other selected reversible data hiding schemes.

Medical Image Data Compression Based on the Region Segmentation (영역분할을 기반으로 한 의료영상 데이타 압축)

  • 김진태;두경수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제3권3호
    • /
    • pp.597-605
    • /
    • 1999
  • In this paper, we propose a cardioangiography sequence image coding scheme which use a subtraction between initial image and current frame inserted contrast dye. Stable regions are obtained by the multithreshold and meaningful region is extracted by the images with stable region. The image with meaningful region is classified into contour and texture information. Contour information is coded by contour coding. And texture information is approximated by two-dimensional polynomial function and each coefficients is coded. Experimental results confirm that the sequence of cardioangiography are well reconstructed at the low bit rate (0.02∼0.04 bpp) and high compression ratio.

  • PDF

Study of Image Transmission System Using Image Segmentation (영상 분할을 이용한 영상 전송 시스템에 대한 연구)

  • Kim, Youngseop;Park, Inho;Lee, Yonghwan
    • Journal of the Semiconductor & Display Technology
    • /
    • 제15권1호
    • /
    • pp.33-35
    • /
    • 2016
  • This paper proposes a method utilizing image compression and transmission method for image segmentation in order to reduce the time required in the process of analyzing the image information that has in the image compression process. Many studies of existing with respect to the image segmentation are being studied as a way to split a lot of a particular part in the image. We divide full image into the N equal parts. And it is compressed using the field coding. This will reduce the time-consuming than using the conventional method.

A Study on the Wavelet Based Algorithm for Lossless and Lossy Image Compression (무손실.손실 영상 압축을 위한 웨이브릿 기반 알고리즘에 관한 연구)

  • An, Chong-Koo;Chu, Hyung-Suk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • 제55권3호
    • /
    • pp.124-130
    • /
    • 2006
  • A wavelet-based image compression system allowing both lossless and lossy image compression is proposed in this paper. The proposed algorithm consists of the two stages. The first stage uses the wavelet packet transform and the quad-tree coding scheme for the lossy compression. In the second stage, the residue image taken between the original image and the lossy reconstruction image is coded for the lossless image compression by using the integer wavelet transform and the context based predictive technique with feedback error. The proposed wavelet-based algorithm, allowing an optional lossless reconstruction of a given image, transmits progressively image materials and chooses an appropriate wavelet filter in each stage. The lossy compression result of the proposed algorithm improves up to the maximum 1 dB PSNR performance of the high frequency image, compared to that of JPEG-2000 algorithm and that of S+P algorithm. In addition, the lossless compression result of the proposed algorithm improves up to the maximum 0.39 compression rates of the high frequency image, compared to that of the existing algorithm.