Scribd
Upload
55 views22 pages

Multimedia System: Safeen H. Rasool

1. Lossy compression discards some data to minimize file size, commonly used for multimedia like audio and video. 2. The JPEG compression process involves color space transform, discrete cosine transform (DCT), quantization, zigzag scan, and entropy encoding. 3. Quantization compresses a range of DCT coefficient values to single values, reducing colors/detail and file size. Matrices prioritize lower frequencies for better quality.

Uploaded by

asmahan abdulwahid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
55 views22 pages

Multimedia System: Safeen H. Rasool

1. Lossy compression discards some data to minimize file size, commonly used for multimedia like audio and video. 2. The JPEG compression process involves color space transform, discrete cosine transform (DCT), quantization, zigzag scan, and entropy encoding. 3. Quantization compresses a range of DCT coefficient values to single values, reducing colors/detail and file size. Matrices prioritize lower frequencies for better quality.

Uploaded by

asmahan abdulwahid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

Multimedia System

Safeen H. Rasool
Lossy compression
• lossy compression is a data encoding method that
compresses data by discarding (losing) some of it.
• The procedure aims to minimize the amount of
data that needs to be held, handled, and/or
transmitted by a computer.
• Lossy compression is most commonly used to
compress multimedia data (audio, video,
and images), especially in applications such
internet telephony. 
Loosy Compression

Low Compression Medium Compression High Compression


9.37 KB 4.82 KB 1.14 KB
• A file that uses greater compression will take up
less space, but may not look or sound as good as a
less compressed file.
• For example, a JPEG image may reduce an image's
file size by more than 80%, with little noticeable
effect. Similarly, a compressed MP3 file may be
one tenth the size of the original audio file and
may sound almost identical.
• In color television, encoding color via a luminance-
chrominance transform domain (such as YUV).
Compression: Images (JPEG)
• JPEG: Joint Photographic Expert Group — an
international standard since 1992.
• Works with color and grayscale images
• Up to 24 bit color images.
• Target photographic quality images Suitable
for many applications e.g., satellite, medical,
general photography...
Basic JPEG Compression Pipeline
• JPEG compression involves the following:
The Major Steps in JPEG Coding involve:

• Color Space Transform and subsampling (YIQ


or YCbCr)
• DCT (Discrete Cosine Transformation)
• Quantization
• Zigzag Scan
• DPCM on DC component
• RLE on AC Components
• Huffman or Arithmetic coding
Discrete cosine transform
• DCTs are used to convert data into the
summation of a series of cosine waves at
different frequencies which convert data from
a spatial-domain into a frequency-domain.
• They are widely used in image and audio
compression.
DCT Transformation
• Quantization, involved in image processing, is
a lossy compression technique achieved by
compressing a range of values to a single
quantum value. When the number of discrete
symbols in a given stream is reduced, the
stream becomes more compressible. For
example, reducing the number of colors
required to represent a digital image makes it
possible to reduce its file size.
Quantization matrices
• A typical video codec works by breaking the picture
into discrete blocks (8×8 pixels).
• These blocks can then be subjected to discrete
cosine transform (DCT) to calculate the frequency
components, both horizontally and vertically. The
resulting block (the same size as the original block)
is then pre-multiplied by the quantization scale
code and divided element-wise by the quantization
matrix, and rounding each resultant element.
• The quantization matrix is designed to provide
more resolution to more perceivable frequency
components over less perceivable components
(usually lower frequencies over high frequencies)
in addition to transforming as many components
to 0.
• This can be encoded with greatest efficiency.
Many video encoders (such as DivX, Xvid,
and 3ivx) and compression standards (such
as MPEG-2 and H.264/AVC) allow custom matrices
to be used.
This is an example of DCT coefficient matrix:
Quantizer matrix
• Dividing the DCT coefficient matrix element-
wise with this quantization matrix, and
rounding to integers results in:
By dividing the two matrices and rounding
the result
• Typically this process will result in matrices
with values primarily in the upper left (low
frequency) corner.
• By using a zig-zag ordering to group the non-
zero entries and run length encoding, the
quantized matrix can be much more efficiently
stored than the non-quantized version.
Zig-zag Scan
• What is the purpose of the Zig-zag Scan:
• To group low frequency coefficients in top of
vector.
• Maps 8 x 8 to a 1 x 64 vector
Differential Pulse Code Modulation

• DC component is large and varies, but often


close to previous value.
• Differential Pulse Code Modulation (DPCM):
Encode the difference between the current
and previous 8x8 block.
• Remember, smaller number -> fewer bits

You might also like