BCS064BCS064H

Data Compression

L-T-P3-0-0 Credits3 Session2024-25 TypeTheory
Appears in 6 semesters · 6 branches

B.Tech Computer Science & Engineering · Sem 6 (Departmental Elective-III, code BCS064) · B.Tech Information Technology · Sem 6 (Departmental Elective-III, code BCS064) · B.Tech CSE (Cyber Security) · Sem 6 (Departmental Elective-III, code BCS064) · B.Tech CSE (Internet of Things) · Sem 6 (Departmental Elective-III, code BCS064) · B.Tech Computer Science (Hindi) · Sem 6 (Departmental Elective-III, code BCS064H) · B.Tech Electrical & Computer Engineering · Sem 6 (Department Elective-III, code BCS064)

Syllabus

5 units · 40 lecture hours
Unit1

Unit 1: Compression Techniques

8 hrs

Loss less compression, Lossy Compression, Measures of performance, Modeling and coding, Mathematical Preliminaries for Lossless compression: A brief introduction to information theory, Models: Physical models, Probability models, Markov models, composite source model, Coding: uniquely decodable codes, Prefix codes.

Unit2

Unit 2: The Huffman coding algorithm

8 hrs

Minimum variance Huffman codes, Adaptive Huffman coding: Update procedure, Encoding procedure, Decoding procedure. Golomb codes, Rice codes, Tunstall codes, Applications of Hoffman coding: Loss less image compression, Text compression, Audio Compression.

Unit3

Unit 3

8 hrs

Coding a sequence, Generating a binary code, Comparison of Binary and Huffman coding, Applications: Bi-level image compression-The JBIG standard, JBIG2, Image compression. Dictionary Techniques: Introduction, Static Dictionary: Diagram Coding, Adaptive Dictionary. The LZ77 Approach, The LZ78 Approach, Applications: File Compression-UNIX compress, Image Compression: The Graphics Interchange Format (GIF), Compression over Modems: V.42 bits, Predictive Coding: Prediction with Partial match (ppm): The basic algorithm, The ESCAPE SYMBOL, length of context, The Exclusion Principle, The Burrows-Wheeler Transform: Moveto-front coding, CALIC, JPEG-LS, Multi-resolution Approaches, Facsimile Encoding, Dynamic Markoy Compression.

Unit4

Unit 4: Distortion criteria, Models, Scalar Ouantization

8 hrs

The Quantization problem, Uniform Quantizer, Adaptive Quantization, Non uniform Quantization.

Unit5

Unit 5

8 hrs

Advantages of Vector Quantization over Scalar Quantization, The Linde-Buzo-Gray Algorithm, Tree structured Vector Quantizers. Structured VectorQuantizers.

Course Outcomes (COs)5 outcomes

After completion of the course student will be able to:

  1. CO1Describe the evolution and fundamental concepts of Data Compression and Coding Techniques.K1, K2
  2. CO2Apply and compare different static coding techniques (Huffman & Arithmetic coding) for text compression.K2, K3
  3. CO3Apply and compare different dynamic coding techniques (Dictionary Technique) for text compression.K2, K3
  4. CO4Evaluate the performance of predictive coding technique for Image Compression.K2, K3
  5. CO5Apply and compare different Quantization Techniques for Image Compression.K2, K3

Note: The AKTU syllabus PDF of some branches prints this subject with small differences in the course outcomes (CSE (Cyber Security), CSE (IoT)). Please also check the official AKTU PDF of your branch, linked at the end of your semester page.

Text books

  1. Khalid Sayood, Introduction to Data Compression, Morgan Kaufmann Publishers
  2. Elements of Data Compression,Drozdek, Cengage Learning
  3. Introduction to Data Compression, Second Edition, Khalid Sayood,The Morgan aufmann Series
  4. Data Compression: The Complete Reference 4th Edition byDavid Salomon, Springer
  5. Text Compression1st Edition by Timothy C. Bell Prentice Hall

Official AKTU syllabus

This subject is on page 31 of the original AKTU PDF.

Official AKTU syllabus PDF ↗