• Title/Summary/Keyword: compression coding

Search Result 828, Processing Time 0.027 seconds

An Efficient Dynamic Entropy Coding by using Multiple Codeword in H.264/AVC (다중 부호어를 이용한 효율적인 H.264/AVC 동적 부호화 방법)

  • Baek, Seong-hak;Moon, Yong-hoo;Kim, Jae-ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9C
    • /
    • pp.1244-1251
    • /
    • 2004
  • In this paper, we propose an efficient dynamic coding scheme by using multiple code words in H.264/A VC entropy coding. The exponential Golomb (Exp-Golomb) code words used in H 264/A VC do not reflect enough the symbol distributions of the combined syntax element in [7] due to their static probability distribution characteristics However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax clement according to given image sequences. Simulation results show that our proposed scheme outperforms the existing [7] me in compression efficiency without loss of quality.

Complexity of Distributed Source Coding using LDPCA Codes (LDPCA 부호를 이용한 실용적 분산 소스 부호화의 복호복잡도)

  • Jang, Min;Kang, Jin-Whan;Kim, Sang-Hyo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4C
    • /
    • pp.329-336
    • /
    • 2010
  • Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

Shuffled Discrete Sine Transform in Inter-Prediction Coding

  • Choi, Jun-woo;Kim, Nam-Uk;Lim, Sung-Chang;Kang, Jungwon;Kim, Hui Yong;Lee, Yung-Lyul
    • ETRI Journal
    • /
    • v.39 no.5
    • /
    • pp.672-682
    • /
    • 2017
  • Video compression exploits statistical, spatial, and temporal redundancy, as well as transform and quantization. In particular, the transform in a frequency domain plays a major role in energy compaction of spatial domain data into frequency domain data. The high efficient video coding standard uses the type-II discrete cosine transform (DCT-II) and type-VII discrete sine transform (DST-VII) to improve the coding efficiency of residual data. However, the DST-VII is applied only to the Intra $4{\times}4$ residual block because it yields relatively small gains in the larger block than in the $4{\times}4$ block. In this study, after rearranging the data of the residual block, we apply the DST-VII to the inter-residual block to achieve coding gain. The rearrangement of the residual block data is similar to the arrangement of the basis vector with a the lowest frequency component of the DST-VII. Experimental results show that the proposed method reduces the luma-chroma (Cb+Cr) BD rates by approximately 0.23% to 0.22%, 0.44% to 0.58%, and 0.46% to 0.65% for the random access, low delay B, and low delay P configurations, respectively.

Wavelet Transform Coding for Image Conference (화상회의를 위한 웨이브렛 변환 부호화)

  • 김정일
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.73-77
    • /
    • 1999
  • In this paper. wavelet transform coding for image conference is studied. Original video frames are transformed into hierarchical pyramidal images with multiresolution using the band property of wavelet transform coefficients. Moving information between neighboring frames is obtained from the low-resolution band. Also, to control the video coding procedure. a new picture set filter is proposed. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently. video quality can be preserved and bit rate can be controlled adaptively In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. Consequently. the proposed method shows a reasonably good performance over existing ones.

An Efficient Compression Algorithm for Simple Computer Cell Animation (단순 컴퓨터 셀 애니메이션 영상에 효율적인 압축 알고리듬)

  • 민병석;정제창;최병욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.211-220
    • /
    • 2002
  • In this paper, we propose an efficient algorithm to compress simple computer cell animation at very low bit rate. The structure of proposed algorithm consists of intra frame coding and inter frame coding. In inter frame coding, animation is encoded by color quantization using a palette, rearrangement of index, ADPCM used in JPEG-LS, mapping, classification, and entropy coding. In interframe coding, classifying the characteristics of motion, animation is encoded by block based motion replenishment. Experimental results show that the proposed methods turns out to outperform conventional methods including Flash, FLC, Motion-JPEG, MPEG-1, and MPEG-4.

JPEG Pleno: Providing representation interoperability for holographic applications and devices

  • Schelkens, Peter;Ebrahimi, Touradj;Gilles, Antonin;Gioia, Patrick;Oh, Kwan-Jung;Pereira, Fernando;Perra, Cristian;Pinheiro, Antonio M.G.
    • ETRI Journal
    • /
    • v.41 no.1
    • /
    • pp.93-108
    • /
    • 2019
  • Guaranteeing interoperability between devices and applications is the core role of standards organizations. Since its first JPEG standard in 1992, the Joint Photographic Experts Group (JPEG) has published several image coding standards that have been successful in a plethora of imaging markets. Recently, these markets have become subject to potentially disruptive innovations owing to the rise of new imaging modalities such as light fields, point clouds, and holography. These so-called plenoptic modalities hold the promise of facilitating a more efficient and complete representation of 3D scenes when compared to classic 2D modalities. However, due to the heterogeneity of plenoptic products that will hit the market, serious interoperability concerns have arisen. In this paper, we particularly focus on the holographic modality and outline how the JPEG committee has addressed these tremendous challenges. We discuss the main use cases and provide a preliminary list of requirements. In addition, based on the discussion of real-valued and complex data representations, we elaborate on potential coding technologies that range from approaches utilizing classical 2D coding technologies to holographic content-aware coding solutions. Finally, we address the problem of visual quality assessment of holographic data covering both visual quality metrics and subjective assessment methodologies.

Light Field Image Compression using Versatile Video Coding Intra Prediction (VVC 인트라 부호화기술을 이용한 라이트필드 영상 부호화)

  • Duong, Vinh Van;Nguyen, Thuc Huu;Lee, Jaelin;Jeon, Byeungwoo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2019.06a
    • /
    • pp.222-224
    • /
    • 2019
  • Light Field (LF) camera captures not only the light intensity but also the light direction coming to camera. While the rich information captured by LF camera enables many interesting applications such as digital refocusing, viewpoint changing, and 3D reconstruction, but it also requires powerful coding tools to reduce its large volume of data. In this paper, we investigate using the intra prediction scheme of the versatile video coding (VVC), which is the most recent video coding technology currently under developing, to compress the LF image. The Intra Block Copy (IBC) technique in VVC is exploited considering special LF image structure. The experimental result shows that VVC intra predict ion outperforms the H.265/HEVC intra coding technique in encoding LF data irrespective of using the IBC mode or not.

  • PDF

On Improving Compression Ratio of JPEG Using AC-Coefficient Separation (교류 계수 분할 압축에 의한 JPEG 정지영상 압축 효율 향상 기법 연구)

  • Ahn, Young-Hoon;Shin, Hyun-Joon;Wee, Young-Cheul
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.1
    • /
    • pp.29-35
    • /
    • 2010
  • In this paper, we introduce a novel entropy coding method to improve the JPEG image compression standard. JPEG is one of the most widely used image compression methods due to its high visual quality for the compression ratio, and especially because of its high efficiency. Based on the observation that the blocks of data fed to the entropy coder usually contain consecutive sequences of numbers with small magnitudes including 0, 1, and -1, we separate those sequences from the data and encode them using a method dedicated to those values. We further improve the compression ratio based on the fact that this separation makes the lengths of blocks much shorter. In our experiment, we show that the proposed method can outperform the JPEG standard preserving its visual characteristics.

An Efficient Test Data Compression/Decompression Using Input Reduction (IR 기법을 이용한 효율적인 테스트 데이터 압축 방법)

  • 전성훈;임정빈;김근배;안진호;강성호
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.11
    • /
    • pp.87-95
    • /
    • 2004
  • This paper proposes a new test data compression/decompression method for SoC(Systems-on-a-Chip). The method is based on analyzing the factors that influence test parameters: compression ratio and hardware overhead. To improve compression ratio, the proposed method is based on Modified Statistical Coding (MSC) and Input Reduction (IR) scheme, as well as a novel mapping and reordering algorithm proposed in a preprocessing step. Unlike previous approaches using the CSR architecture, the proposed method is to compress original test data and decompress the compressed test data without the CSR architecture. Therefore, the proposed method leads to better compression ratio with lower hardware overhead than previous works. An experimental comparison on ISCAS '89 benchmark circuits validates the proposed method.

3D volumetric medical image coding using unbalanced tree structure (불균형 트리 구조를 이용한 3차원 의료 영상 압축)

  • Kim Young-Seop
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.4
    • /
    • pp.567-574
    • /
    • 2006
  • This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and 16 coding unit size. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. Then the encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with I(5,3)filter performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

  • PDF