Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Image Processing II: Coding and Compression
Graph Chatbot
Related lectures (31)
Data Compression and Shannon's Theorem: Recap
Explores entropy, compression algorithms, and optimal coding methods for data compression.
Principal Component Analysis: Dimensionality Reduction
Covers Principal Component Analysis for dimensionality reduction, exploring its applications, limitations, and importance of choosing the right components.
Data Compression and Shannon Fano Coding
Explores practical data compression using Shannon Fano coding and the engineering challenges of compressing diverse data types.
Polar Codes: Wrapping and Decoding
Covers the wrapping and decoding process of polar codes, exploring the trade-off between quality and efficiency in lossy compression.
Data Compression and Entropy: Compression
Explores lossless data compression techniques, emphasizing efficient message representation and encoding strategies.
PCA: Directions of Largest Variance
Covers PCA, finding directions of largest variance, data dimensionality reduction, and limitations of PCA.
Data Compression and Shannon-Fano Algorithm
Explores the Shannon-Fano algorithm for data compression and its efficiency in creating unique binary codes for letters.
Compression with Loss: Data and Signals
Explores compression with loss, covering limitations of lossless compression and techniques for compressing images and sound effectively.
Fourier Transform: Compression and Analysis
Covers the Fourier transform, compression techniques, and spectral analysis of periodic signals.
Mohr Circle: Stress Analysis
Explains stress analysis using Mohr circles and strain energy concepts.
Data Compression and Shannon's Theorem: Shannon-Fano Coding
Explores Shannon-Fano coding for efficient data compression and its comparison to Huffman coding.
Previous
Page 2 of 2
Next