Huffman Coding Dr. Ying Lu RAIK 283 Data Structures & Algorithms.

Slides:

Advertisements

Similar presentations

EE 4780 Huffman Coding Example. Bahadir K. Gunturk2 Huffman Coding Example Suppose X is a source producing symbols; the symbols comes from the alphabet.

Advertisements

Introduction to Computer Science 2 Lecture 7: Extended binary trees

Lecture 4 (week 2) Source Coding and Compression

Lecture 3: Source Coding Theory TSBK01 Image Coding and Data Compression Jörgen Ahlberg Div. of Sensor Technology Swedish Defence Research Agency (FOI)

Michael Alves, Patrick Dugan, Robert Daniels, Carlos Vicuna

Greedy Algorithms Amihood Amir Bar-Ilan University.

Huffman Encoding Dr. Bernard Chen Ph.D. University of Central Arkansas.

Problem: Huffman Coding Def: binary character code = assignment of binary strings to characters e.g. ASCII code A = B = C =

Data Compressor---Huffman Encoding and Decoding. Huffman Encoding Compression Typically, in files and messages, Each character requires 1 byte or 8 bits.

Lecture 6: Huffman Code Thinh Nguyen Oregon State University.

Optimal Merging Of Runs

HUFFMAN TREES CSC 172 SPRING 2002 LECTURE 24. Prefix Codes Consider a binary trie representing a code

Chapter 9: Greedy Algorithms The Design and Analysis of Algorithms.

Lecture 6: Greedy Algorithms I Shang-Hua Teng. Optimization Problems A problem that may have many feasible solutions. Each solution has a value In maximization.

Chapter 9 Greedy Technique Copyright © 2007 Pearson Addison-Wesley. All rights reserved.

Data Structures – LECTURE 10 Huffman coding

CSE 326 Huffman coding Richard Anderson. Coding theory Conversion, Encryption, Compression Binary coding Variable length coding A B C D E F.

Greedy Algorithms Huffman Coding

Data Compression and Huffman Trees (HW 4) Data Structures Fall 2008 Modified by Eugene Weinstein.

Huffman Codes Message consisting of five characters: a, b, c, d,e

Huffman Coding Vida Movahedi October Contents A simple example Definitions Huffman Coding Algorithm Image Compression.

Approaches to Problem Solving greedy algorithms dynamic programming backtracking divide-and-conquer.

Huffman Codes. Encoding messages  Encode a message composed of a string of characters  Codes used by computer systems  ASCII uses 8 bits per character.

Huffman Encoding Veronica Morales.

1 Analysis of Algorithms Chapter - 08 Data Compression.

Lecture Objectives  To learn how to use a Huffman tree to encode characters using fewer bytes than ASCII or Unicode, resulting in smaller files and reduced.

Lossless Compression CIS 465 Multimedia. Compression Compression: the process of coding that will effectively reduce the total number of bits needed to.

Introduction to Algorithms Chapter 16: Greedy Algorithms.

Greedy Algorithms Input: Output: Objective: - make decisions “greedily”, previous decisions are never reconsidered Optimization problems.

Huffman coding Content 1 Encoding and decoding messages Fixed-length coding Variable-length coding 2 Huffman coding.

A. Levitin “Introduction to the Design & Analysis of Algorithms,” 3rd ed., Ch. 9 ©2012 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved.

Huffman Code and Data Decomposition Pranav Shah CS157B.

Huffman Encodings Section 9.4. Data Compression: Array Representation Σ denotes an alphabet used for all strings Each element in Σ is called a character.

Additive White Gaussian Noise

Abdullah Aldahami ( ) April 6,  Huffman Coding is a simple algorithm that generates a set of variable sized codes with the minimum average.

Dynamic programming vs Greedy algo – con’t Input: Output: Objective: a number W and a set of n items, the i-th item has a weight w i and a cost c i a subset.

CSCE350 Algorithms and Data Structure Lecture 19 Jianjun Hu Department of Computer Science and Engineering University of South Carolina

Huffman Codes Juan A. Rodriguez CS 326 5/13/2003.

1 Greedy Technique Constructs a solution to an optimization problem piece by piece through a sequence of choices that are: b feasible b locally optimal.

Huffman’s Algorithm 11/02/ Weighted 2-tree A weighted 2-tree T is an extended binary tree with n external nodes and each of the external nodes is.

Foundation of Computing Systems

Bahareh Sarrafzadeh 6111 Fall 2009

Lossless Decomposition and Huffman Codes Sophia Soohoo CS 157B.

Huffman Codes. Overview  Huffman codes: compressing data (savings of 20% to 90%)  Huffman’s greedy algorithm uses a table of the frequencies of occurrence.

1 Data Compression Hae-sun Jung CS146 Dr. Sin-Min Lee Spring 2004.

1 Huffman Codes. 2 ASCII use same size encoding for all characters. Variable length codes can produce shorter messages than fixed length codes Huffman.

Huffman encoding.

Analysis of Algorithms CS 477/677 Instructor: Monica Nicolescu Lecture 18.

CSCI 58000, Algorithm Design, Analysis & Implementation Lecture 12 Greedy Algorithms (Chapter 16)

Design & Analysis of Algorithm Huffman Coding

EE465: Introduction to Digital Image Processing

Assignment 6: Huffman Code Generation

Greedy Technique.

The Greedy Method and Text Compression

Proving the Correctness of Huffman’s Algorithm

The Greedy Method and Text Compression

Optimal Merging Of Runs

Chapter 16: Greedy Algorithms

Lecture 9 Greedy Strategy

Advanced Algorithms Analysis and Design

Data Structure and Algorithms

Greedy Algorithms Alexandra Stefan.

Chapter 16: Greedy algorithms Ming-Te Chi

CSE 326 Huffman coding Richard Anderson.

Algorithms CSCI 235, Spring 2019 Lecture 30 More Greedy Algorithms

Huffman Coding Greedy Algorithm

CSE 589 Applied Algorithms Spring 1999

Proving the Correctness of Huffman’s Algorithm

Analysis of Algorithms CS 477/677

Presentation transcript:

Huffman Coding Dr. Ying Lu RAIK 283 Data Structures & Algorithms

Giving credit where credit is due: Most of slides for this lecture are based on slides created by Dr. Richard Anderson, University of Washington. I have modified them and added new slides RAIK 283 Data Structures & Algorithms

Coding theory ASCII coding Conversion, Encryption, Compression Binary coding A B C D E F For fixed-length binary coding of a 6-character alphabet, how many bits are needed?

Coding theory (cont.) ASCII coding Conversion, Encryption, Compression Binary coding A000 B001 C010 D011 E100 F101

Coding theory (cont.) ASCII coding Conversion, Encryption, Compression Binary coding Variable length coding A B C D E F Probability Average bits/character = ? Compression Ratio = ?

Decode the following E0 T11 N100 I1010 S E0 T10 N100 I0111 S

Prefix(-free) codes No prefix of a codeword is a codeword Uniquely decodable A001 B C D E F

Prefix codes and binary trees Tree representation of prefix codes A00 B010 C0110 D0111 E10 F11 A 0 B C D E F

Minimum length code A1/4 B1/8 C1/16 D E1/2 Probability How to code so that average bits/character is minimized?

Minimum length code (cont.) Huffman tree – prefix codes tree with minimum weighted path length C(T) – weighted path length

Huffman code algorithm Derivation Two rarest items will have the longest codewords Codewords for rarest items differ only in the last bit Idea: suppose the weights are with and the smallest weights Start with an optimal code for and Extend the codeword for to get codewords for and

Huffman code H = new minHeap() for each w i T = new Tree(w i ) H.Insert(T) while H.Size() > 1 T 1 = H.DeleteMin() T 2 = H.DeleteMin() T 3 = Merge(T 1, T 2 ) H.Insert(T 3 )

Example characterABCD_ probability

In-class exercises P332 Exercises 9.4.1

In-class exercises What is the maximal length of a codeword possible in a Huffman encoding of an alphabet of n characters? Show that a Huffman tree can be constructed in linear time if the alphabet’s characters are given in a sorted order of their frequencies.