Image Compression with Huffman Coding

About

A Design and Analysis of Algorithms course project implementing Huffman coding — a classic lossless compression algorithm — and applying it to images.

How it works

• Builds a frequency table of pixel values, then constructs the Huffman tree so frequent values get the shortest binary codes.
• Encodes the image into a compact bitstream and decodes it back without any loss of quality.
• Demonstrates how much redundancy can be removed from an image purely through smarter entropy coding.