Canonical Huffman Coding for Image Compression

被引：0

作者：

Khaitu, Shree Ram ^{[1
]}

Panday, Sanjeeb Prasad ^{[2
]}

机构：

[1] Purbanchal Univ, Khwopa Engn Coll, Dept Comp Engn, Bhaktapur, Nepal

[2] Tribhuvan Univ, Inst Engn, Dept Elect & Comp Engn, Pulchowk Campus, Kathmandu, Nepal

来源：

PROCEEDINGS ON 2018 IEEE 3RD INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND SECURITY (ICCCS) | 2018年

关键词：

Image Compression; Entropy encoding; Huffman Coding; Canonical Huffman Coding; PSNR;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

With the rapid growth of multimedia technology, sharing of multimedia components have become a common practice. Thus, compression of image has become an integral approach that motivates the image compression for the efficient and lossless transmission and for storage of digital data. Huffman coding is one of the entropy encoding approach for compression of image. This paper is based on the fractal image in which Canonical Huffman coding is used for better fractal compression than arithmetic encoding. The result obtained shows that Canonical Huffman coding increases the speed of the compression and has good PNSR, as well as it has better compression ratio than standard Huffman coding.

引用

页码：184 / 190

页数：7

共 11 条

[1]

[Anonymous], 2007, IEEE T IMAGE PROCESS, V11, P605

[2]

[Anonymous], 2009, INT C ADV COMP COMM

[3]

[Anonymous], 2005, GECCO 05

[4]

[Anonymous], 2014, ICTACT J IMAGE VIDEO, V04

[5]

[Anonymous], ARPN J ENG APPL SCI

[6]

[Anonymous], 2005, MRS BULL, V30, P5

[7]

CREST KPIT Cummins Info System Ltd., LOSSL IM COMPR BAS D, DOI [10.1109/ICRTIT.2011.5972472,@011IEEE, DOI 10.1109/ICRTIT.2011.5972472,@011IEEE]

[8]

Somasundaramrt K., 2011, RGB GRAY SCALE COMPO, V3

[9]

Universite' d'Adrar Alge'rie, 2012, CTIC 2012

[10]

Venkatasekhar, 2012, ASIAN J COMPUTER SCI, V2, P272

← 1 2 →