EE665000

2. 8.1 Basics of Image Compression

3. 8.1 Basics of Image Compression (cont.)

4. 8.1.1 Elements of an Image Compression System

5. 8.1.2 Information Theory

6. 8.1.2 Information Theory (cont.)

7. 8.1.2 Information Theory (cont.)

8. 8.1.2 Information Theory (cont.)

9. 8.1.2 Information Theory (cont.)

10. 8.1.2 Information Theory (cont.)

11. 8.1.2 Information Theory (cont.)

12. 8.1.2 Information Theory (cont.)

13. 8.2 Entropy Coding

14. 8.2.1 Huffman coding

15. 8.2.1 Huffman coding (cont.) l Procedure Two-stages: (Given probability distribution of X) Stage 1: Construct a binary tree from events Select two least probable events a & b, and replace them by a single node, where probability is the sum of the probability for a & b. Stage 2: Assign codes sequentially from the root.

16. 8.2.1 Huffman coding (cont.)

17. 8.2.1 Huffman coding (cont.)

18. 8.2.1 Huffman coding (cont.)

19. 8.2.1 Huffman coding (cont.)

20. 8.2.1 Huffman coding (cont.) Advantage: t Approach H(X) (with or without memory), when block size t Relative simple procedure, easy to follow.

21. 8.2.1 Huffman coding (cont.)

22. 8.2.1 Huffman coding (cont.)

23. 8.2.3 Arithmetic Coding

24. 8.2.3 Arithmetic Coding (cont.)

25. 8.2.3 Arithmetic Coding (cont.)

26. 8.2.3 Arithmetic Coding (cont.)

27. 8.2.3 Arithmetic Coding (cont.)

28. 8.2.3 Arithmetic Coding (cont.)

29. 8.2.3 Arithmetic Coding (cont.)

30. 8.2.3 Arithmetic Coding (cont.)

31. 8.2.3 Arithmetic Coding (cont.)

32. 8.2.3 Arithmetic Coding (cont.)

33. 8.3 Lossless Compression Methods

34. 8.3.1 Lossless Predictive Coding

35. 8.3.1 Lossless Predictive Coding (cont.)

36. 8.3.1 Lossless Predictive Coding (cont.)

37. 8.3.2 Run-Length Coding

38. 8.3.2 Run-Length Coding (cont.)

39. 8.3.2.1 Run-Length Coding of Bit-Plane

40. 8.4 Rate-Distortion Theory

41. 8.4 Rate-Distortion Theory (cont.)

42. 8.4.1 Rate-Distortion Function

43. 8.4.1 Rate-Distortion Function (cont.)

44. 8.4.2 Source Coding Theorem

45. 8.4.2 Source Coding Theorem (cont.)

46. 8.4.2 Source Coding Theorem (cont.)

47. 8.4.2 Source Coding Theorem (cont.)

48. 8.5 Scalar Quantization

49. 8.5.1 Lloyd-Max Quantizer (Nonuniform Quantizer)

50. 8.5.1 Lloyd-Max Quantizer (Nonuniform Quantizer) (cont.)

51. 8.5.1 Lloyd-Max Quantizer (Nonuniform Quantizer) (cont.)

52. 8.5.1 Lloyd-Max Quantizer (Nonuniform Quantizer) (cont.)

53. 8.5.1 Lloyd-Max Quantizer (Nonuniform Quantizer) (cont.)

54. 8.6 Differential Pulse Code Modulation (DPCM)

55. 8.6.1 Optimal Prediction

56. 8.6.1.1 Image Modeling

57. 8.6.1.1 Image Modeling (cont.)

58. 8.6.1.1 Image Modeling (cont.)

59. 8.6.1.1 Image Modeling (cont.)

60. 8.6.2 Adaptive Quantization

61. 8.7 Delta Modulation

62. 8.7 Delta Modulation (cont.)

63. 8.8 Transform Coding

64. 8.8.1 Linear Transforms

65. 8.8.1 Linear Transforms (cont.)

66. 8.8.1 Linear Transforms (cont.)

67. 8.8.2 Optimum Transform Coder

68. 8.8.2 Optimum Transform Coder (cont.)

69. 8.8.3 Bit Allocation

70. 8.8.3 Bit Allocation (cont.)

71. 8.8.3 Bit Allocation (cont.)

72. 8.8.3 Bit Allocation (cont.)

73. 8.8.3 Bit Allocation (cont.)

74. 8.8.4 Practical Transform Coding

75. 8.8.4 Practical Transform Coding (cont.)

76. 8.8.4 Practical Transform Coding (cont.)

77. 8.8.4 Practical Transform Coding (cont.)

78. 8.8.4 Practical Transform Coding (cont.)

79. 8.8.5 Performance