Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 1K views

    AKTU Syllabus CS 3rd Yr

    Uploaded by

    PPDC NAGAUR
    This document outlines the course outcomes and syllabus for a data compression course. The 5 course outcomes cover describing data compression concepts and techniques, applying static and dynamic coding techniques for text compression, evaluating predictive coding for image compression, and applying quantization techniques for image compression. The syllabus is divided into 5 units that will cover topics such as lossless vs lossy compression, information theory models, Huffman coding, dictionary techniques, predictive coding, distortion criteria, scalar and vector quantization. Students will learn foundational concepts and apply various coding and quantization methods to compress text and images.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    AKTU Syllabus CS 3rd Yr

    Uploaded by

    PPDC NAGAUR
    1K views1 page
    This document outlines the course outcomes and syllabus for a data compression course. The 5 course outcomes cover describing data compression concepts and techniques, applying static and dynamic coding techniques for text compression, evaluating predictive coding for image compression, and applying quantization techniques for image compression. The syllabus is divided into 5 units that will cover topics such as lossless vs lossy compression, information theory models, Huffman coding, dictionary techniques, predictive coding, distortion criteria, scalar and vector quantization. Students will learn foundational concepts and apply various coding and quantization methods to compress text and images.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the course outcomes and syllabus for a data compression course. The 5 course outcomes cover describing data compression concepts and techniques, applying static and dynamic coding techniques for text compression, evaluating predictive coding for image compression, and applying quantization techniques for image compression. The syllabus is divided into 5 units that will cover topics such as lossless vs lossy compression, information theory models, Huffman coding, dictionary techniques, predictive coding, distortion criteria, scalar and vector quantization. Students will learn foundational concepts and apply various coding and quantization methods to compress text and images.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    1K views1 page

    AKTU Syllabus CS 3rd Yr

    Uploaded by

    PPDC NAGAUR
    This document outlines the course outcomes and syllabus for a data compression course. The 5 course outcomes cover describing data compression concepts and techniques, applying static and dynamic coding techniques for text compression, evaluating predictive coding for image compression, and applying quantization techniques for image compression. The syllabus is divided into 5 units that will cover topics such as lossless vs lossy compression, information theory models, Huffman coding, dictionary techniques, predictive coding, distortion criteria, scalar and vector quantization. Students will learn foundational concepts and apply various coding and quantization methods to compress text and images.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Data Compression (KCS-064)

    Course Outcome ( CO) Bloom’s Knowledge Level (KL)

    At the end of course , the student will be able to


    Describe the evolution and fundamental concepts of Data Compression and Coding K1, K2
    CO 1
    Techniques.
    Apply and compare different static coding techniques (Huffman & Arithmetic coding) for text K2, K3
    CO 2
    compression.
    Apply and compare different dynamic coding techniques (Dictionary Technique) for text K2, K3
    CO 3
    compression.
    CO 4 Evaluate the performance of predictive coding technique for Image Compression. K2, K3

    CO 5 Apply and compare different Quantization Techniques for Image Compression. K2,K3

    DETAILED SYLLABUS 3-0-0


    Unit Topic Proposed
    Lecture
    Compression Techniques: Loss less compression, Lossy Compression, Measures of performance,
    I Modeling and coding, Mathematical Preliminaries for Lossless compression: A brief introduction 08
    to information theory, Models: Physical models, Probability models, Markov models, composite
    source model, Coding: uniquely decodable codes, Prefix codes.
    The Huffman coding algorithm: Minimum variance Huffman codes, Adaptive Huffman coding:
    II Update procedure, Encoding procedure, Decoding procedure. Golomb codes, Rice codes, Tunstall 08
    codes, Applications of Hoffman coding: Loss less image compression, Text compression, Audio
    Compression.
    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 08
    III 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.
    IV Distortion criteria, Models, Scalar Ouantization: The Quantization problem, Uniform Quantizer, 08
    Adaptive Quantization, Non uniform Quantization.
    V Advantages of Vector Quantization over Scalar Quantization, The Linde-Buzo-Gray Algorithm, 08
    Tree structured Vector Quantizers. Structured VectorQuantizers.
    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

    Curriculum & Evaluation Scheme CS & CSE (V & VI semester) 29

    You might also like