电子科技大学：《图像处理及应用 Image Processing and Application》课程教学资源（课件讲稿）Chapter 08 Image Compression

电子科发女学光电科学与工程学院 SCHOOL OF OPTOELECTRONIC SCIENCE AND ENGINEERING OF UESTC 1.Huffman Coding The most popular technique for removing coding redundancy is due to Huffman(1952) Huffman Coding yields the smallest number of code symbols per source symbol The resulting code is optimal Huffman Coding is used in CCITT,JBIG2,JPEG,MPEG-1,2,4, H.261,H.262,H.263,H.264

 The most popular technique for removing coding redundancy is due to Huffman (1952)  Huffman Coding yields the smallest number of code symbols per source symbol  The resulting code is optimal  Huffman Coding is used in CCITT,JBIG2,JPEG,MPEG-1,2,4, H.261,H.262,H.263,H.264 1. Huffman Coding

电子科发女学光电科学与工程学院 SCHOOL OF OPTOELECTRONIC SCIENCE AND ENGINEERING OF UESTC 1.Huffman Coding Original source Source reduction Symbol Probability 1 2 3 4 2 0.4 0.4 0.4 0.40.6 ds 0.3 0.3 0.3 0.3 0.4 0.1 0.1 0.2T0.3 a4 0.1 0.1 0.1J 43 0.06 0.1 as 0.04

1. Huffman Coding

电子科发女学光电科学与工程学院 SCHOOL OF OPTOELECTRONIC SCIENCE AND ENGINEERING OF UESTC 1.Huffman Coding Symbol Probability 1 2 3 4 a2 0.4 0.4 0.4 0.4 0.60 a6 0.3 0.3 0.3 0.30 0.41 ar 0.1 0.10.200.31 a4 0.1 0.100.11 a 0.06 0r0.1 as 0.04

1 0.4 0.3 0.1 0.1 0.1 2 0.4 0.3 0.2 0.1 3 0.4 0.3 0.3 4 0.6 0.4 0 1 0 1 0 1 0 1 0 1 1. Huffman Coding Symbol a2 a6 a1 a4 a3 a5 Probability 0.4 0.3 0.1 0.1 0.06 0.04

电子发女学光电科学与工程学院 SCHOOL OF OPTOELECTRONIC SCIENCE AND ENGINEERING OF UESTC 1.Huffman Coding Original source Source reduction Sym. Prob. Code 1 2 3 4 2 0.4 1 0.41 0.41 0.41 -0.60 as 0.3 00 0.3 00 0.300 0.300 0.41 aj 0.1 011 0.1 011 -0.2 0104 0.301e a 0.1 0100 0.1 0100 0.1 0114 3 0.06 01010-4 -0.1 0101 as 0.04 01011 Lg=1(0.4)+2(0.3)+3(0.1)+4(0.1)+5(0.06)+5(0.04) =2.2 bits/pixel

1(0.4) 2(0.3) 3(0.1) 4(0.1) 5(0.06) 5(0.04) 2.2 / L avg bits pixel     1. Huffman Coding

电子科发女学光电科学与工程学院 SCHOOL OF OPTOELECTRONIC SCIENCE AND ENGINEERING OF UESTC 8,2 Some Basic Compression Methods ⊙ Agenda Huffman Coding Golomb Coding Arithmetic Coding◆ g LZW Coding◆ g Run-Length Coding◆ Symbol-Based Coding g Bit-Plane Coding g Block Transform Coding Predictive Coding◆ Agenda o Wavelet Coding

 Huffman Coding  Golomb Coding  Arithmetic Coding  LZW Coding  Run-Length Coding  Symbol-Based Coding  Bit-Plane Coding  Block Transform Coding  Predictive Coding  Wavelet Coding Agenda 8.2 Some Basic Compression Methods