SlideServe
Menu
Préférences
© SlideServe · v2026

Lossy Data Compression Methods: A Cost-Effective Approach for Efficient Picture and Video Compression

gfrancisco avatar
9 diapositives · 132 Views · Dec 19, 2019

Learn about Lossy Data Compression methods such as JPEG and MPEG, their cost-effective and time-efficient benefits, and the process of spatially and temporally compressing images and videos. Understand the operations involved in reducing redundancies and optimizing compression through quantization and linearization techniques.

Lossy Data Compression Methods: A Cost-Effective Approach for Efficient Picture and Video Compression - slide 1
1 / 9

Télécharger la présentation

Lossy Data Compression Methods: A Cost-Effective Approach for Efficient Picture and Video Compression
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation
  1. DATA COMPRESSION LOSSY COMPRESSION METHODS

  2. A compression of information that is acceptable in pictures or videos, but not texts or programs. Methods of Lossy Data Compression are: Joint Photographic Experts Group (JPEG) Motion Picture Experts Group (MPEG) What it is…

  3. Why use it? • Cost effective • Time Efficient

  4. How It’s Done! • Change the picture into a linear set of numbers that reveals the redundancies. • Redundancies can be removed. • The set of bits is simplified. • Each block of 64 pixels goes through the discrete cosine transform (DCT) P(x,y) T(x,y) Value of each pixel before DCT Value after DCT

  5. Operation: • If a block has two different sections, each uniform in its respective section, you can decrease the amount of operations performed to display the image by 4800 times. How? • By doing the DCT operation: 7 7 • 0.25 x c(x) x c(y) x Σ Σ x P(x,y) m=0 n=0 • If there is no change to any one pixel out of the 64 in the chart, then 0’s are created for the spot.

  6. Quantization • After all that math, there’s more math… • Divide the number of bits needed for compression by a constant • Drop the fraction • # of bits and # of 0’s are now optimized for compression

  7. Compression • After quantization, redundant 0’s are removed • Done by zigzag linearization rather than row by row, to conceal fine changes.

  8. Means spatially compressing each frame while temporally compressing a set of frames Types: I-frames—intracoded frame= an independent frame from a set P-frames—predicted frame= related to the previous frame, without the possibility for changes being recorded B-frames—bidirectional frame= relative to preceding and future frames, never related to another B-frame MPEG’s

  9. Summation