Name
Abstract | ||
|---|---|---|
In this paper, we proposed a novel entropy coding called bit-precision method. Huffman coding and arithmetic coding are among the most popular methods for entropy-coding the symbols after quantization in image coding. Arithmetic coding outperforms Huffman coding in compression efficiency, while Huffman coding is less complex than arithmetic coding. Usually, one has to sacrifice either compression efficiency or computational complexity by choosing Huffman coding or arithmetic coding. We proposed a new entropy coding method that simply defines the bit precision of given symbols, which leads to a comparable compression efficiency to arithmetic coding and to the lower computation complexity than Huffman coding. The proposed method was tested for lossless image coding and simulation results verified that the proposed method produces the better compression efficiency than (single model) arithmetic coding and the substantially lower computational complexity than Huffman coding. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11538059_17 | ICIC (1) |
Keywords | Field | DocType |
bit-precision method,lossless image coding,huffman coding,comparable compression efficiency,image coding,low complex lossless image,compression efficiency,arithmetic coding,popular method,computational complexity,huffman codes,entropy coding | Modified Huffman coding,Tunstall coding,Entropy encoding,Computer science,Arithmetic,Algorithm,Huffman coding,Shannon–Fano coding,Arithmetic coding,Variable-length code,Context-adaptive binary arithmetic coding | Conference |
Volume | ISSN | ISBN |
3644 | 0302-9743 | 3-540-28226-2 |
Citations | PageRank | References |
1 | 0.41 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jong Woo Won | 1 | 1 | 0.41 |
| Hyun Soo Ahn | 2 | 1 | 0.41 |
| Wook-Joong Kim | 3 | 48 | 8.00 |
| Euee S. Jang | 4 | 40 | 15.77 |