Beruflich Dokumente
Kultur Dokumente
m m
Uncompressed multimedia data occupies large
space.
Transfer of such content consumes more
bandwidth.
Processing of Uncompressed data requires storage
at least in range of Gigabytes.
Data Compression is done to provide a feasible and
cost effective solution.
Research is going on in this field to develop
reliable techniques.
Many compression techniques are available in
market.
?
ý àuality should be as good as possible after Compression
process.
Simple color display modes: Single pixel represented by 256 colors. One
byte per pixel is needed.
?
* Bandwidth Requirement:
(13.5+6.75+6.75)*8= 216x10^6 bits/sec (8 bits)
Éast forward and backward data retrieval with simultaneous
display should be possible.
Random access to single image and audio frames of data
stream should be possible.
Decompression of images, video or audio should be possible
without a link to other data units.
For both dialogue and retrieval modes
Should be compatible.
SOURCE, ENTROPY, HYBRID CODING
Compression techniques fit into different categories.
* Used regardless of media specific instructions.
* Data stream considered to be simple digital sequence.
* Data semantics is ignored.
* Decompression generates data completely. (Hence Lossless)
* Example: Run length Coding.
* One way relation between original data stream and encoded data.
Picture
preparation
Picture
Processing
Quantizatio
n
Entropy Compressed
Encoding Picture
Steps of compression
m
9 Analog to Digital Conversion
9 Digital representation of Information
9 Image is divided into 898 pixel blocks
m
9 first step of compression process and uses sophisticated algorithms
9 Transformation of time to frequency domain is done by DCT
à
9 Process results of previous step
9 Maps real numbers to integers
9 Reduces precision
9 last step of compression process and compresses sequential data stream
without loss
9 Example: Compress sequence of zeros by specifying no. of zeros followed by
zero
Processing and quantization can be repeated iteratively in
Adaptive differential Pulse Code Modulation.
Y
9 Variation of Run length encoding.
9 Based on combination of two data bytes.
9 Determines most frequently occurring pairs of bytes.
9 Replaces pair by special single byte.
9 Data reduction can be done more than 10%.
¬
?
P(ADCEB)=1.00
0 1
P(ADCE)=0.49 P(B)=0.51
0
1
P(CE)=0.20 P(AD)=0.29
1
1 0 0
p
9 Data transformed into Mathematical domain.
9 Éourier transformation: Widely used technique.
9 Discrete Cosine Transformation technique: Effective
for image compression.
9 ÉÉT for special filtering
?
xPEG
H. 261
MPEG
DVI