Earticle

초록

영어

Many of the standard compression methods are based, at their lowest level, in coding digital words of variable length or VLC, Huffman type, designed in 1952 or in any of its versions, as canonical. This article presents an VLC with greater efficiency than Huffman encoding, named as “Leveling”, which uses two variants, “Leveled Reordering” for low redundancy, e.g. for text and, “Segmented Leveling” for middle and high redundancy, for image processing. Leveling, developed by Javier Joglar in 1995, uses the concepts of “meaning” and “ordering” of the VLC codes generated, to get optimum performance in terms of “compression ratio”, higher than any other non-adaptive VLC.

목차

Abstract
 1. Introduction
 2. Leveling Encoding Process
  2.1. Coding Rules for Leveling
  2.2. Code Table and Reduced Code Vector c(j) Generation
  2.3. Reduced Code Vector c(j) Decoding
  2.4. “Meaning” in Leveling Encoding
  2.5. Disadvantages of Canonical Coding vs. Leveling
 3. Segmented Leveling
  3.1. Run Length Encoding
  3.2. Huffman, canonical Huffman and leveling encoding
  3.3. Huffman, canonical Huffman and leveling encoding with VLI
  3.4. Huffman, canonical Huffman and leveling encoding segmented with VLI
  3.5. Canonical Huffman and Leveling Encoding Segmented with Double VLI
  3.6. Summary of Encoding Results
 4. Leveled Reordering
 Appendix: Abstract in Spanish
 5. Conclusions
 References

키워드

저자

• Javier Joglar Alcubilla [ Avionics Department, Barajas Institute, Avda. América 119, 28042, Madrid, Spain ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605