نتایج جستجو برای: huffman code

تعداد نتایج: 168910  

2013
Dalvir Kaur Kamaljit Kaur

Image compression is an application of data compression that encodes the original image with few bits. The objective of image compression is to reduce irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. So image compression can reduce the transmit time over the network and increase the speed of transmission. In Lossless image compress...

Journal: :IEEE Trans. Information Theory 1991
A. J. van Zanten

1229 compression of files of information retrieval systems. With this application in mind, bounds on the average codelength of an alphabetical code were studied. The major results of this correspondence are as follows. 1) A necessary and sufficient condition for the existence of a 2) An upper bound for Lopt (the average codelength of the binary alphabetical code was given. optimal alphabetical ...

Journal: :Information Processing Letters 2023

A canonical Huffman code is an optimal prefix-free compression whose codewords enumerated in the lexicographical order form a list of binary words non-decreasing lengths. Gagie et al. (2015) gave representation this coding capable encoding and decoding symbol constant worst-case time. It uses σlg⁡ℓmax+o(σ)+O(ℓmax2) bits space, where σ ℓmax are alphabet size maximum codeword length, respectively...

Journal: :CoRR 2006
Paul M. B. Vitányi Zvi Lotker

We study the new problem of Huffman-like codes subject to individual restrictions on the code-word lengths of a subset of the source words. These are prefix codes with minimal expected code-word length for a random source where additionally the code-word lengths of a subset of the source words is prescribed, possibly differently for every such source word. Based on a structural analysis of prop...

Journal: :SIAM J. Comput. 2012
Mordecai J. Golin Claire Mathieu Neal E. Young

We give a polynomial-time approximation scheme for the generalization of Huffman coding in which codeword letters have nonuniform costs (as in Morse code, where the dash is twice as long as the dot). The algorithm computes a (1 + )-approximate solution in time O(n+ f( ) log n), where n is the input size.

2001
Chi-Hung Chi Kwok-Shing Cheng Ling Wong

Traditional text compression algorithms such as Huffman and LZ variants are usually based on 8-bit characters sampling. However, under the unicode representation for multilingual information, the character set of each language such as Chinese and Japanese is consisted of a very number of distinct characters and thus 16-bit or 32-bit character sampling is needed. Consequently, when text compress...

Journal: :IOP Conference Series: Materials Science and Engineering 2021

2017
Srinivas Nagamalla Bibhas Chandra Dhara Jun Cai Jing Chen Xing Liang Yongjiao Wang Chuan Wang Georgia Sandbach Stefanos Zafeiriou Maja Pantic Lijun Yin

Human facial appearance is affected by lots of environmental and personal factors. The human face is a very challenging pattern to recognize because of its rigid anatomy. The main problem of face recognition is large variability of the recorded images due to pose, illumination conditions, facial expression, cosmetics, different hair styles and presence of glasses amongst others. Another major i...

1996
Marcelo J. Weinberger Gadiel Seroussi Guillermo Sapiro

LOCO-I (LOw COmplexity LOssless COmpression for Images) is a novel lossless compression algorithm for continuous-tone images which combines the simplicity of Huffman coding with the compression potential of context models, thus “enjoying the best of both worlds.” The algorithm is based on a simple fixed context model, which approaches the capability of the more complex universal context modelin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید