ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Bit-Precision Method for Low Complex Lossless Image Coding
Cited 1 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
원종우, 안현수, 김욱중, 장의선
발행일
200508
출처
International Conference on Intelligent Computing (ICIC) 2005 (LNCS 3644), v.3644, pp.155-164
DOI
https://dx.doi.org/10.1007/11538059_17
협약과제
05MR1100, 지능형 통합정보방송(SmarTV)기술개발, 안치득
초록
In this paper, we proposed a novel entropy coding called bitprecision 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. © Springer-Verlag Berlin Heidelberg 2005.
KSP 제안 키워드
Coding method, Entropy Coding, Huffman coding, Lossless Image Coding, Lower computational complexity, arithmetic coding, compression efficiency, computation complexity, simulation results