SlideShare uma empresa Scribd logo
1 de 36
Produced by
Omar Ghazi Abbood Khukre
Master Student in Department of Information
Technology, Institute of Graduate Studies and Research,
Alexandria University, Egypt
.
Contents
Introduction
Image Compression Definition
Image Compression Types
Wavelet Transforms
Problem Statement
Objective
Methodology
Experiments and Results Analysis
Conclusion
Future work
INTRODUCTION
 Image Compression: It is the Art & Science of reducing the amount of
data required to represent an image.
 It is the most useful and commercially successful technologies in the
field of Digital Image Processing.
 The number of images compressed and decompressed daily is
innumerable.
 Web page images & High-resolution digital camera photos also are also
compressed to save storage space & reduce transmission time.
 The researchers have faced in the field of Image compression some
difficulties especially in get the best accuracy of the image with a high
compression ratio.
 This research aims an improving the image compression process to the
maximum extent.
Image Compression Definition
Image compression is minimizing the size in bytes
of a graphics file without degrading the quality of
the image to an unacceptable level .
The reduction in file size allows more images
to be stored in a given amount of disk or memory
space. It also reduces the time required for
images to be sent over the Internet or downloaded
from Web pages.
 Lossy Compression Techniques
In information technology, lossy compression or irreversible
compression is the class of data encoding methods that uses
inexact approximations and partial data discarding to represent
the content. These techniques are used to reduce data size for
storage, handling, and transmitting content. The amount of data
reduction possible using lossy compression is often much higher
than through lossless techniques.
 Lossless Compression Techniques
Lossless compression is a class of data compression
algorithms that allows the original data to be perfectly
reconstructed from the compressed data. By contrast, lossy
compression permits reconstruction only of an approximation of
the original data, though this usually improves compression rates
(and therefore reduces file sizes)
Image Compression Types
Lossy Compression Techniques
LossyCompressionVectorquantizationbyLinde-Buzo-Gray
Lossy compression technique provides higher compression ratio
than lossless compression.
A lossy compression scheme, shown in Figure, may examine the
color data for a range of pixels, and identify subtle variations in
pixel color values that are so minute that the human eye/brain is
unable to distinguish the difference between them.
Vector quantization (VQ) is a classical quantization technique
from signal processing that allows the modeling of probability
density functions by the distribution of prototype vectors. It was
originally used for data compression. It works by dividing a large
set of points (vectors) into groups having approximately the same
number of points closest to them.
Linde, Buzo, and Gray (LBG) proposed a VQ design
algorithm based on a training sequence. The use of a training
sequence bypasses the need for multi-dimensional integration.
The LBG algorithm Algorithm They used a mapping function
to partition training vectors into clusters and be is of iterative
type and in each iteration a large set of vectors, generally
referred to as training set, is needed to be processed.
Lossy Compression Techniques (cont.)
Wavelet Transforms
Represent an image as a sum of wavelet functions (wavelets)
with different locations and scales. Any decomposition of an
image into wavelets involves a pair of waveforms: one to
represent the high frequencies corresponding to the detailed
parts of an image and one for the low frequencies or smooth
parts of an image.
 Discrete Wavelet Transform
The Discrete Wavelet Transform (DWT) of image signals produces
a nonredundant image representation, which provides better
spatial and spectral localization of image formation, compared
with other multi scale representations such as Gaussian and
Laplacian pyramid. Recently, Discrete Wavelet Transform has
attracted more and more interest in image fusion .An image can
be decomposed into a sequence of different spatial resolution
images using DWT.In case of a 2D image, an N level decomposition
can be performed resulting in 3N+1 different frequency bands and
it is shown in figure.
Wavelet Transforms (cont.)
Wavelet Transforms (cont.)
2D - Discrete wavelet transform
 Lifting Wavelet Transform
The lifting scheme is a technique for both designing wavelets an
d performing the discrete wavelet transform. Actually it is worth
while to merge these steps and design the wavelet filters while pe
rforming the wavelet transform. This is then called the second g
eneration wavelet transform.
Wavelet Transforms (cont.)
Diagram lifting wavelet scheme transform
 Stationary Wavelet Transform
The stationary wavelet transform (SWT) is a wavelet transform
algorithm designed to overcome the lack of translation invariance
of the Discrete Wavelet Transform (DWT). Translation invariance
is achieved by removing the down samplers and up samplers in
the Discrete Wavelet Transform (DWT) and up sampling the filter
coefficients by a factor of in the level of the algorithm. The SWT
is an inherently redundant scheme as the output of each level of
SWT contains the same number of samples as the input.
Wavelet Transforms (cont.)
The Stationary Wavelet Transform (SWT) is similar to the DWT
except the signal is never sub-sampled and instead the filters are
up sampled at each level of decomposition. The following block
diagram depicts the digital implementation of SWT as shown in
figure.
Wavelet Transforms (cont.)
Problem Statement
• The large increase in the data lead to delays in access to the
information required and this leads to a delay in the time. Large
data lead to data units and storage is full this leads to the need
to buy a bigger space for storage and losing money. Large data
lead to give inaccurate results for the similarity of data and this
leads to getting inaccurate information.
• Also to show the difference between the types of transforms
Stationary Wavelet Transform, Discrete Wavelet Transform,
and Lifting Wavelet Transform because they are very similar
at one level so we used three levels.
Research Objective
In lossy compression, the compression ratio is
unaccepted. The proposed system suggests an image
compression method of lossy image compression
through the three types of transformations such as
stationary wavelet transform, discrete wavelet
transform , and lifting wavelet transform and the
comparison between the three types and the use of
vector quantization (VQ) to improve the image
compression process.
Methodology
The proposed lossy compression approach applied SWT
and VQ techniques in order to compressed input images
in four phases; namely preprocessing, image
transformation, zigzag scan, and lossy/lossless
compression. In figure shows the main steps of the
system that follows the schema independent and image
compression techniques. We discuss how a matrix
arrangement gives us the best compression ratio and
lessloss of the characteristics of the image through
a wavelet transform with lossy compression techniques.
Methodology (cont.)
In Block Diagram in the following shows the work in sequence.
Methodology (cont.)
Step 1
Pre Processing
First step of the proposed
system When enter five images to
the system, pre-processing will be
applied on images which are
resize of the image in accordance
with the measured rate of
different sizes to (8 × 8) And then
converted from (RGB) to (gray
scale).
Methodology(cont.)
Step 2
Wavelet transforms
Image transformation phase
received the resizable gray
scale images and produced
transformed images. This
phase used the three types of
wavelet transforms such as
DWT, LWT, and SWT.
Methodology(cont.)
Step 3
Zigzag Scan
In this step we convert the matrix
from 2-D to 1-D by zigzag scan.
Zigzag scans ordering converting a
2-D matrix into a 1-D array, so that
the frequency (horizontal + vertical)
increase in this order and the
coefficient variance decreases in this
order as figure.
Step 4
Lossy compression
In this step we do more than
try to get the highest possible
compression ratio. We enter the
matrix to lossy compression
using (VQ). And again we enter
the matrix to lossless
compression(Huffman Coding
and Arithmetic Coding) and
make a comparison of the
results Between the two
experiments. And again we
enter the matrix to lossy
compression using (VQ), output
of this process, introduce it to
lossless compression(Huffman
Coding and Arithmetic Coding)
to get the highest possible
compression ratio and compare
the results and find the best
Methodology(cont.)
Methodology(cont.)
Compression Ratio
Compression Ratio: is the ratio of size of the compressed database
system with the original size of the uncompressed database
systems. Also known as compression power is a computer-science
term used to quantify the reduction in data-representation size
produced by a data compression algorithm. Compression ratio is
defined as follows:
Compression Time
• Compression Time = represents the elapsed time during the
compression process.
Experiments and Results Analysis
Experiments
In this section of the performance of three types of wavelet transform
(SWT, DWT, and LWT) and the impact of each type on the image
lossy compression performance also it shows the lossy using vector
quantization (LBG) and lossless compression using Arithmetic coding
and Huffman coding.
The First Experiment
In this experiment, four operations:
 1- DWT-Zigzag-Arithmetic
 2- DWT-Zigzag-LBG–Arithmetic
 3- DWT-Zigzag-Huffman
 4- DWT-Zigzag-LBG–Huffman
Table 1 showing results for the process lossy and lossless image
compression to the five images using the discrete wavelet transform
with arithmetic coding and huffman coding without the use of the
LBG, as well as with the use of the LBG and that using three
decomposition levels.
Experiments (cont.)
Discrete wavelet transform, vector quantization (LBG), Arithmetic and Huffman coding
DWT
DWT Zigzag
Arithmetic
DWT Zigzag LBG &
Arithmetic
DWT Zigzag
Huffman
DWT Zigzag LBG &
Huffman
Image Level C.Ratio
Running
time(Sec) C.Ratio psnr
Running
time(Sec) C.Ratio
Running
time(Sec) C.Ratio psnr
Running
time (Sec)
Lena
1 1.1934 0.4919 1.2549 18.2975 0.0157 1.1403 0.0735 1.1879 18.2975 0.057
2 1.261 0.0459 1.3027 18.2745 0.012 1.0556 0.0785 1.1403 18.2745 0.0438
3 1.2994 0.0721 1.28 18.2449 0.0164 1.026 0.1237 1.1583 18.2449 0.0465
Camera
man
1 1.2518 0.0351 1.2549 18.2588 0.0158 1.177 0.0611 1.2549 18.2588 0.0421
2 1.2549 0.0498 1.2641 18.1648 0.0125 1.1557 0.0904 1.2047 18.1648 0.0459
3 1.2896 0.062 1.2457 18.0733 0.0111 1.1454 0.1148 1.2018 18.0733 0.0609
Tulips
1 1.1851 0.093 1.2427 17.4091 0.0153 1.1824 0.1483 1.199 17.4091 0.0657
2 1.1934 0.0965 1.28 17.4196 0.0105 1.177 0.1231 1.199 17.4196 0.0458
3 1.0916 0.1131 1.2864 17.3919 0.011 1.1479 0.2548 1.1824 17.3919 0.0447
White
flower
1 1.0622 0.0431 1.2549 16.7503 0.0128 1.0385 0.0764 1.1879 16.7503 0.0413
2 1.1203 0.0546 1.2549 16.7639 0.0106 1.0893 0.075 1.1934 16.7639 0.0458
3 1.0916 0.0457 1.2518 16.8377 0.0169 1.026 0.0785 1.1879 16.8377 0.047
Fruits
1 1.2047 0.0489 1.28 17.5693 0.013 1.1428 0.0829 1.2104 17.5693 0.0513
2 1.2104 0.0922 1.2427 17.6137 0.0139 1.1302 0.0967 1.2161 17.6137 0.044
3 1.2161 0.0508 1.2641 17.5718 0.0148 1.1252 0.0831 1.1962 17.5718 0.0455
Experiments (cont.)
The Second Experiment
In this experiment, four operations:
 1- LWT-Zigzag-Arithmetic
 2- LWT-Zigzag-LBG–Arithmetic
 3- LWT-Zigzag- Huffman
 4- LWT-Zigzag-LBG–Huffman
Table 2 showing results for the process lossy and lossless
image compression to the five images using the lifting
wavelet transform with arithmetic coding and huffman
coding without the use of the LBG, as well as with the
use of the LBG and that using three decomposition levels
.
Experiments (cont.)
Lifting wavelet transform, vector quantization (LBG), Arithmetic and Huffman coding
LWT
LWT Zigzag
Arithmetic
LWT Zigzag LBG &
Arithmetic
LWT Zigzag
Huffman
LWT Zigzag LBG &
Huffman
Image Level C.Ratio
Running
time (Sec)
C.Ratio psnr
Running
time (Sec)
C.Ratio
Running
time (Sec)
C.Ratio psnr
Running
time (Sec)
Lena
1 1.4065 0.3177 1.6842 13.1876 0.0081 1.3763 0.0674 1.4545 13.1876 0.0216
2 1.3763 0.4231 1.641 11.9784 0.0097 1.113 0.0527 1.4712 11.9784 0.0162
3 1.1636 0.0489 1.6842 17.4394 0.0073 1.094 0.0708 1.4545 17.4394 0.0154
Camera
man
1 1.5421 0.0658 1.641 13.6895 0.0076 1.2673 0.0511 1.4712 13.6895 0.017
2 1.2427 0.0326 1.7534 12.7065 0.0093 1.1327 0.0401 1.4222 12.7065 0.0155
3 1.1428 0.0376 1.6623 16.9649 0.0074 1.1228 0.0836 1.4222 16.9649 0.0204
Tulips
1 1.0275 0.0947 1.7777 16.2979 0.0122 1.3763 0.1357 1.4545 17.0032 0.0196
2 1.4382 0.1336 1.641 12.2671 0.0111 1.094 0.1054 1.4712 12.2671 0.0225
3 1.2549 0.1174 1.6842 19.5465 0.0073 1.0578 0.1067 1.4545 19.5465 0.0162
White
flower
1 1.3913 0.04 1.641 15.4661 0.0073 1.3763 0.0537 1.4712 15.4661 0.0182
2 1.3061 0.0473 1.7066 14.3703 0.0118 1.2549 0.0528 1.4545 14.3703 0.0186
3 1.1636 0.0827 1.641 16.1241 0.0074 1.2549 0.0599 1.4712 16.1241 0.0162
Fruits
1 1.2397 0.0453 1.7777 12.3394 0.0091 1.1228 0.0557 1.4065 12.3394 0.016
2 1.3763 0.079 1.641 12.2289 0.0089 1.113 0.0902 1.4712 12.2289 0.0164
3 1.1962 0.0874 1.6202 18.1602 0.0074 1.0756 0.0652 1.4065 18.1602 0.0164
Experiments (cont.)
The Third Experiment
In this experiment, four operations:
 1- SWT-Zigzag-Arithmetic
 2- SWT–Zigzag-LBG–Arithmetic
 3- SWT-Zigzag- Huffman
 4- SWT–Zigzag-LBG–Huffman
In the table 3, showing results for the process lossy and lossless
image compression to five images using stationary wavelet
transform with arithmetic coding and Huffman coding without the
use of the LBG, as well as with the use of the LBG and that using
three decomposition levels.
Experiments (cont.)
Stationary wavelet transform, vector quantization (LBG), Arithmetic and Huffman coding
SWT
SWT Zigzag
Arithmetic
SWT Zigzag LBG &
Arithmetic
SWT Zigzag
Huffman
SWT Zigzag LBG &
Huffman
Image Level C.Ratio
Running
time(Sec)
C.Ratio psnr
Running
time(Sec)
C.Ratio
Running
time(Sec)
C.Ratio psnr
Running
time(Sec)
Lena
1 4.3667 0.1155 5.0073 18.0121 0.0685 2.6256 0.859 4.8188 18.0121 0.0473
2 4.3667 0.0414 5.0073 18.8982 0.012 2.6256 0.8439 4.8188 18.8982 0.0455
3 4.3667 0.1906 5.0073 18.8982 0.0137 2.6256 0.8576 4.8188 18.8982 0.0422
Camera
man
1 4.1042 0.0651 5.0073 16.8483 0.011 2.6771 0.9157 4.853 16.8483 0.0419
2 4.1042 0.0537 5.0073 18.1099 0.011 2.6771 0.8346 4.853 18.1099 0.0447
3 4.1042 0.0398 5.0073 18.1099 0.0103 2.6771 0.9481 4.853 18.1099 0.0462
Tulips
1 3.8641 0.0934 5.6574 18.6787 0.0099 2.7563 0.8965 4.6022 18.6787 0.0461
2 3.8641 0.0961 5.6574 17.1798 0.0116 2.7563 0.9289 4.6022 17.1798 0.0456
3 3.8641 0.0969 5.6574 17.1798 0.0121 2.7563 0.8919 4.6022 17.1798 0.0421
White
flower
1 3.7372 0.0393 4.9588 17.3002 0.0117 2.7018 0.8483 4.6757 17.3002 0.0459
2 3.7372 0.0392 4.9588 17.2142 0.0128 2.7018 0.8438 4.6757 17.2142 0.0459
3 3.7372 0.041 4.9588 17.2142 0.012 2.7018 0.8411 4.6757 17.2142 0.0412
Fruits
1 3.828 0.0584 5.1072 18.9503 0.0132 2.7379 0.8438 4.3206 18.9503 0.0435
2 3.828 0.458 5.1072 18.1739 0.0105 2.7379 0.8585 4.3206 18.1739 0.0567
3 3.828 0.1188 5.1072 18.1739 0.012 2.7379 0.8463 4.3206 18.1739 0.043
Experiments (cont.)
 Average Compression Ratio Level – 1
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
5.5
Arithmatic LBG Zigzag Arithmatic Huffman LBG Zigzag Huffman
Average Compression Ratio (C.R) in Level -1
SWT
DWT
LWT
In level - 1, we find that SWT & LBG Zigzag arithmetic the best
thing, and find that arithmetic the best of huffman with everyone.
Experiments (cont.)
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
5.5
Arithmatic LBG Zigzag Arithmatic Huffman LBG Zigzag Huffman
Average Compression Ratio (C.R) in Level - 2
SWT
DWT
LWT
 Average Compression Ratio Level – 2
In level - 2 , We find that SWT & LBG Zigzag Arithmetic the best
thing , and find that Arithmetic the best of Huffman with everyone,
and firming (SWT) as in level 1, and the high rate of (DWT) and
low rate (LWT) .
Experiments (cont.)
 Average Compression Ratio Level – 3
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
5.5
Arithmatic LBG Zigzag Arithmatic Huffman LBG Zigzag Huffman
Average Compression Ratio (C.R) in Level - 3
SWT
DWT
LWT
In level - 3, we find that SWT & LBG Zigzag Arithmetic the best
thing, and find that Arithmetic the best of Huffman with everyone,
and firming (SWT) as in level 1 & 2, and the low rate of (DWT)
and low rate (LWT).
1- Compression ratio in LBG Bigger without LBG.
2- Stationary wavelet transform best transform.
3- Arithmetic coding best of Huffman coding.
4- That the best path for image compression is Stationary wavelet
transform - zigzag scan – Vector Quantization (LBG) - Arithmetic
coding where the compression ratio achieved 5.1476 in 0.02286
Running time (Sec).
Results Analysis
 This thesis introduced a novel approach that is built to work on
image compression. Our approach used vector quantization LB
G, Arithmetic coding and Huffman coding with three types of wa
velet transforms such as Discrete Wavelet Transform DWT, Lifti
ng Wavelet Transform LWT, and Stationary Wavelet Transform
SWT on three decomposition levels. As in Stationary Wavelet Tr
ansform (SWT) compression ratio is fixed at a high level, and Di
screte Wavelet Transform (DWT) compression ratio variable at a
high level, either Lifting Wavelet Transform (LWT) is less than t
he compression at high level.
 We conclude that arithmetic coding is better than Huffman codi
ng in terms of compression ratio and time. We found that the bes
t way to compression in this system is the stationary wavelet tran
sforms (SWT), LBG vector quantization, and arithmetic coding
where it gives the best compression ratio with less time possible.
Also the size of compressed data by adding arithmetic coding is b
etter than adding Huffman coding to SWT.
CONCLUSION
Presentation of Lossy compression
Presentation of Lossy compression

Mais conteúdo relacionado

Mais procurados

Image restoration and degradation model
Image restoration and degradation modelImage restoration and degradation model
Image restoration and degradation modelAnupriyaDurai
 
Watershed Segmentation Image Processing
Watershed Segmentation Image ProcessingWatershed Segmentation Image Processing
Watershed Segmentation Image ProcessingArshad Hussain
 
Interpixel redundancy
Interpixel redundancyInterpixel redundancy
Interpixel redundancyNaveen Kumar
 
Image Restoration
Image RestorationImage Restoration
Image RestorationPoonam Seth
 
Predictive coding
Predictive codingPredictive coding
Predictive codingp_ayal
 
Fundamental steps in image processing
Fundamental steps in image processingFundamental steps in image processing
Fundamental steps in image processingPremaPRC211300301103
 
Homomorphic filtering
Homomorphic filteringHomomorphic filtering
Homomorphic filteringGautam Saxena
 
Digital Image Processing - Image Compression
Digital Image Processing - Image CompressionDigital Image Processing - Image Compression
Digital Image Processing - Image CompressionMathankumar S
 
Chapter 8 image compression
Chapter 8 image compressionChapter 8 image compression
Chapter 8 image compressionasodariyabhavesh
 
Histogram Processing
Histogram ProcessingHistogram Processing
Histogram ProcessingAmnaakhaan
 
Image Enhancement using Frequency Domain Filters
Image Enhancement using Frequency Domain FiltersImage Enhancement using Frequency Domain Filters
Image Enhancement using Frequency Domain FiltersKarthika Ramachandran
 
Introduction to Image Compression
Introduction to Image CompressionIntroduction to Image Compression
Introduction to Image CompressionKalyan Acharjya
 
Digital Image restoration
Digital Image restorationDigital Image restoration
Digital Image restorationMd Shabir Alam
 
Image Restoration (Digital Image Processing)
Image Restoration (Digital Image Processing)Image Restoration (Digital Image Processing)
Image Restoration (Digital Image Processing)Kalyan Acharjya
 

Mais procurados (20)

Region based segmentation
Region based segmentationRegion based segmentation
Region based segmentation
 
Image restoration and degradation model
Image restoration and degradation modelImage restoration and degradation model
Image restoration and degradation model
 
Watershed Segmentation Image Processing
Watershed Segmentation Image ProcessingWatershed Segmentation Image Processing
Watershed Segmentation Image Processing
 
Interpixel redundancy
Interpixel redundancyInterpixel redundancy
Interpixel redundancy
 
Image Restoration
Image RestorationImage Restoration
Image Restoration
 
Predictive coding
Predictive codingPredictive coding
Predictive coding
 
Fundamental steps in image processing
Fundamental steps in image processingFundamental steps in image processing
Fundamental steps in image processing
 
Bit plane coding
Bit plane codingBit plane coding
Bit plane coding
 
Homomorphic filtering
Homomorphic filteringHomomorphic filtering
Homomorphic filtering
 
Image Restoration
Image RestorationImage Restoration
Image Restoration
 
Digital image processing
Digital image processing  Digital image processing
Digital image processing
 
Digital Image Processing - Image Compression
Digital Image Processing - Image CompressionDigital Image Processing - Image Compression
Digital Image Processing - Image Compression
 
Chapter 8 image compression
Chapter 8 image compressionChapter 8 image compression
Chapter 8 image compression
 
Histogram Processing
Histogram ProcessingHistogram Processing
Histogram Processing
 
Image Enhancement using Frequency Domain Filters
Image Enhancement using Frequency Domain FiltersImage Enhancement using Frequency Domain Filters
Image Enhancement using Frequency Domain Filters
 
Introduction to Image Compression
Introduction to Image CompressionIntroduction to Image Compression
Introduction to Image Compression
 
Image segmentation
Image segmentation Image segmentation
Image segmentation
 
Noise Models
Noise ModelsNoise Models
Noise Models
 
Digital Image restoration
Digital Image restorationDigital Image restoration
Digital Image restoration
 
Image Restoration (Digital Image Processing)
Image Restoration (Digital Image Processing)Image Restoration (Digital Image Processing)
Image Restoration (Digital Image Processing)
 

Destaque

Lossless Compression
Lossless CompressionLossless Compression
Lossless CompressionPuchpa Oks
 
lossy compression JPEG
lossy compression JPEGlossy compression JPEG
lossy compression JPEGMahmoud Hikmet
 
Data compression introduction
Data compression introductionData compression introduction
Data compression introductionRahul Khanwani
 
Data Compression (Lossy and Lossless)
Data Compression (Lossy and Lossless)Data Compression (Lossy and Lossless)
Data Compression (Lossy and Lossless)Project Student
 
Hybrid compression based stationary wavelet transforms
Hybrid compression based stationary wavelet transformsHybrid compression based stationary wavelet transforms
Hybrid compression based stationary wavelet transformsOmar Ghazi
 
Characters and codings 1
Characters and codings 1Characters and codings 1
Characters and codings 1astaola
 
New trends in engineering contracts
New trends in engineering contractsNew trends in engineering contracts
New trends in engineering contractsMuhammad Aljalali
 
Lossy Compression Using Stationary Wavelet Transform and Vector Quantization
Lossy Compression Using Stationary Wavelet Transform and Vector QuantizationLossy Compression Using Stationary Wavelet Transform and Vector Quantization
Lossy Compression Using Stationary Wavelet Transform and Vector QuantizationOmar Ghazi
 
Voice Identification And Recognition System, Matlab
Voice Identification And Recognition System, MatlabVoice Identification And Recognition System, Matlab
Voice Identification And Recognition System, MatlabSohaib Tallat
 
Internet Protocol Routing
Internet Protocol RoutingInternet Protocol Routing
Internet Protocol RoutingMahmoud Hikmet
 
A VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTS
A VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTSA VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTS
A VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTSIAEME Publication
 
Data compression techniques
Data compression techniquesData compression techniques
Data compression techniquesDeep Bhatt
 
Audio and video compression
Audio and video compressionAudio and video compression
Audio and video compressionneeraj9217
 

Destaque (20)

Image Compression
Image CompressionImage Compression
Image Compression
 
Lossless Compression
Lossless CompressionLossless Compression
Lossless Compression
 
lossy compression JPEG
lossy compression JPEGlossy compression JPEG
lossy compression JPEG
 
Data compression
Data compression Data compression
Data compression
 
Data compression introduction
Data compression introductionData compression introduction
Data compression introduction
 
Compression
CompressionCompression
Compression
 
Data Compression (Lossy and Lossless)
Data Compression (Lossy and Lossless)Data Compression (Lossy and Lossless)
Data Compression (Lossy and Lossless)
 
Hybrid compression based stationary wavelet transforms
Hybrid compression based stationary wavelet transformsHybrid compression based stationary wavelet transforms
Hybrid compression based stationary wavelet transforms
 
Characters and codings 1
Characters and codings 1Characters and codings 1
Characters and codings 1
 
New trends in engineering contracts
New trends in engineering contractsNew trends in engineering contracts
New trends in engineering contracts
 
Lossy Compression Using Stationary Wavelet Transform and Vector Quantization
Lossy Compression Using Stationary Wavelet Transform and Vector QuantizationLossy Compression Using Stationary Wavelet Transform and Vector Quantization
Lossy Compression Using Stationary Wavelet Transform and Vector Quantization
 
Codings Standards
Codings StandardsCodings Standards
Codings Standards
 
Grade 8 image file format
Grade 8   image file formatGrade 8   image file format
Grade 8 image file format
 
Voice Identification And Recognition System, Matlab
Voice Identification And Recognition System, MatlabVoice Identification And Recognition System, Matlab
Voice Identification And Recognition System, Matlab
 
Internet Protocol Routing
Internet Protocol RoutingInternet Protocol Routing
Internet Protocol Routing
 
Lossy
LossyLossy
Lossy
 
A VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTS
A VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTSA VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTS
A VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTS
 
Data compression techniques
Data compression techniquesData compression techniques
Data compression techniques
 
Vector quantization
Vector quantizationVector quantization
Vector quantization
 
Audio and video compression
Audio and video compressionAudio and video compression
Audio and video compression
 

Semelhante a Presentation of Lossy compression

A Review on Image Compression using DCT and DWT
A Review on Image Compression using DCT and DWTA Review on Image Compression using DCT and DWT
A Review on Image Compression using DCT and DWTIJSRD
 
Comparative Study between DCT and Wavelet Transform Based Image Compression A...
Comparative Study between DCT and Wavelet Transform Based Image Compression A...Comparative Study between DCT and Wavelet Transform Based Image Compression A...
Comparative Study between DCT and Wavelet Transform Based Image Compression A...IOSR Journals
 
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...INFOGAIN PUBLICATION
 
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...INFOGAIN PUBLICATION
 
Image Compression using a Raspberry Pi
Image Compression using a Raspberry PiImage Compression using a Raspberry Pi
Image Compression using a Raspberry PiIRJET Journal
 
Image compression using embedded zero tree wavelet
Image compression using embedded zero tree waveletImage compression using embedded zero tree wavelet
Image compression using embedded zero tree waveletsipij
 
Image compression techniques by using wavelet transform
Image compression techniques by using wavelet transformImage compression techniques by using wavelet transform
Image compression techniques by using wavelet transformAlexander Decker
 
Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...
Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...
Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...IJSRD
 
An improved image compression algorithm based on daubechies wavelets with ar...
An improved image compression algorithm based on daubechies  wavelets with ar...An improved image compression algorithm based on daubechies  wavelets with ar...
An improved image compression algorithm based on daubechies wavelets with ar...Alexander Decker
 
BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...
BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...
BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...IJDKP
 
A Study of Image Compression Methods
A Study of Image Compression MethodsA Study of Image Compression Methods
A Study of Image Compression MethodsIOSR Journals
 
FAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLAB
FAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLABFAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLAB
FAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLABJournal For Research
 
Efficient Image Compression Technique using JPEG2000 with Adaptive Threshold
Efficient Image Compression Technique using JPEG2000 with Adaptive ThresholdEfficient Image Compression Technique using JPEG2000 with Adaptive Threshold
Efficient Image Compression Technique using JPEG2000 with Adaptive ThresholdCSCJournals
 
3 d discrete cosine transform for image compression
3 d discrete cosine transform for image compression3 d discrete cosine transform for image compression
3 d discrete cosine transform for image compressionAlexander Decker
 
High Speed and Area Efficient 2D DWT Processor Based Image Compression
High Speed and Area Efficient 2D DWT Processor Based Image CompressionHigh Speed and Area Efficient 2D DWT Processor Based Image Compression
High Speed and Area Efficient 2D DWT Processor Based Image Compressionsipij
 

Semelhante a Presentation of Lossy compression (20)

A Review on Image Compression using DCT and DWT
A Review on Image Compression using DCT and DWTA Review on Image Compression using DCT and DWT
A Review on Image Compression using DCT and DWT
 
Comparative Study between DCT and Wavelet Transform Based Image Compression A...
Comparative Study between DCT and Wavelet Transform Based Image Compression A...Comparative Study between DCT and Wavelet Transform Based Image Compression A...
Comparative Study between DCT and Wavelet Transform Based Image Compression A...
 
I017125357
I017125357I017125357
I017125357
 
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
 
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
4 ijaems jun-2015-5-hybrid algorithmic approach for medical image compression...
 
Image Compression using a Raspberry Pi
Image Compression using a Raspberry PiImage Compression using a Raspberry Pi
Image Compression using a Raspberry Pi
 
Image compression using embedded zero tree wavelet
Image compression using embedded zero tree waveletImage compression using embedded zero tree wavelet
Image compression using embedded zero tree wavelet
 
www.ijerd.com
www.ijerd.comwww.ijerd.com
www.ijerd.com
 
H0144952
H0144952H0144952
H0144952
 
Image compression techniques by using wavelet transform
Image compression techniques by using wavelet transformImage compression techniques by using wavelet transform
Image compression techniques by using wavelet transform
 
Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...
Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...
Implementation of Vedic Multiplier in Image Compression Using Discrete Wavele...
 
An improved image compression algorithm based on daubechies wavelets with ar...
An improved image compression algorithm based on daubechies  wavelets with ar...An improved image compression algorithm based on daubechies  wavelets with ar...
An improved image compression algorithm based on daubechies wavelets with ar...
 
BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...
BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...
BIG DATA-DRIVEN FAST REDUCING THE VISUAL BLOCK ARTIFACTS OF DCT COMPRESSED IM...
 
A Study of Image Compression Methods
A Study of Image Compression MethodsA Study of Image Compression Methods
A Study of Image Compression Methods
 
FAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLAB
FAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLABFAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLAB
FAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLAB
 
Image compression and jpeg
Image compression and jpegImage compression and jpeg
Image compression and jpeg
 
Efficient Image Compression Technique using JPEG2000 with Adaptive Threshold
Efficient Image Compression Technique using JPEG2000 with Adaptive ThresholdEfficient Image Compression Technique using JPEG2000 with Adaptive Threshold
Efficient Image Compression Technique using JPEG2000 with Adaptive Threshold
 
Bg044357364
Bg044357364Bg044357364
Bg044357364
 
3 d discrete cosine transform for image compression
3 d discrete cosine transform for image compression3 d discrete cosine transform for image compression
3 d discrete cosine transform for image compression
 
High Speed and Area Efficient 2D DWT Processor Based Image Compression
High Speed and Area Efficient 2D DWT Processor Based Image CompressionHigh Speed and Area Efficient 2D DWT Processor Based Image Compression
High Speed and Area Efficient 2D DWT Processor Based Image Compression
 

Último

On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptxOn_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptxPooja Bhuva
 
Plant propagation: Sexual and Asexual propapagation.pptx
Plant propagation: Sexual and Asexual propapagation.pptxPlant propagation: Sexual and Asexual propapagation.pptx
Plant propagation: Sexual and Asexual propapagation.pptxUmeshTimilsina1
 
Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...
Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...
Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...Pooja Bhuva
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17Celine George
 
Towards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptxTowards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptxJisc
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...Nguyen Thanh Tu Collection
 
How to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptxHow to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptxCeline George
 
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning PresentationSOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentationcamerronhm
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Jisc
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxDenish Jangid
 
NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...
NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...
NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...Amil baba
 
Understanding Accommodations and Modifications
Understanding  Accommodations and ModificationsUnderstanding  Accommodations and Modifications
Understanding Accommodations and ModificationsMJDuyan
 
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning ExhibitSociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibitjbellavia9
 
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptxCOMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptxannathomasp01
 
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptxHMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptxmarlenawright1
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxPooja Bhuva
 
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfKey note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfAdmir Softic
 
FSB Advising Checklist - Orientation 2024
FSB Advising Checklist - Orientation 2024FSB Advising Checklist - Orientation 2024
FSB Advising Checklist - Orientation 2024Elizabeth Walsh
 
ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxAreebaZafar22
 
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfUGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfNirmal Dwivedi
 

Último (20)

On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptxOn_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
 
Plant propagation: Sexual and Asexual propapagation.pptx
Plant propagation: Sexual and Asexual propapagation.pptxPlant propagation: Sexual and Asexual propapagation.pptx
Plant propagation: Sexual and Asexual propapagation.pptx
 
Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...
Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...
Sensory_Experience_and_Emotional_Resonance_in_Gabriel_Okaras_The_Piano_and_Th...
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17
 
Towards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptxTowards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptx
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
 
How to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptxHow to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptx
 
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning PresentationSOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentation
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
 
NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...
NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...
NO1 Top Black Magic Specialist In Lahore Black magic In Pakistan Kala Ilam Ex...
 
Understanding Accommodations and Modifications
Understanding  Accommodations and ModificationsUnderstanding  Accommodations and Modifications
Understanding Accommodations and Modifications
 
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning ExhibitSociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
 
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptxCOMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
 
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptxHMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptx
 
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfKey note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdf
 
FSB Advising Checklist - Orientation 2024
FSB Advising Checklist - Orientation 2024FSB Advising Checklist - Orientation 2024
FSB Advising Checklist - Orientation 2024
 
ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptx
 
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfUGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
 

Presentation of Lossy compression

  • 1.
  • 2. Produced by Omar Ghazi Abbood Khukre Master Student in Department of Information Technology, Institute of Graduate Studies and Research, Alexandria University, Egypt .
  • 3. Contents Introduction Image Compression Definition Image Compression Types Wavelet Transforms Problem Statement Objective Methodology Experiments and Results Analysis Conclusion Future work
  • 4. INTRODUCTION  Image Compression: It is the Art & Science of reducing the amount of data required to represent an image.  It is the most useful and commercially successful technologies in the field of Digital Image Processing.  The number of images compressed and decompressed daily is innumerable.  Web page images & High-resolution digital camera photos also are also compressed to save storage space & reduce transmission time.  The researchers have faced in the field of Image compression some difficulties especially in get the best accuracy of the image with a high compression ratio.  This research aims an improving the image compression process to the maximum extent.
  • 5. Image Compression Definition Image compression is minimizing the size in bytes of a graphics file without degrading the quality of the image to an unacceptable level . The reduction in file size allows more images to be stored in a given amount of disk or memory space. It also reduces the time required for images to be sent over the Internet or downloaded from Web pages.
  • 6.  Lossy Compression Techniques In information technology, lossy compression or irreversible compression is the class of data encoding methods that uses inexact approximations and partial data discarding to represent the content. These techniques are used to reduce data size for storage, handling, and transmitting content. The amount of data reduction possible using lossy compression is often much higher than through lossless techniques.  Lossless Compression Techniques Lossless compression is a class of data compression algorithms that allows the original data to be perfectly reconstructed from the compressed data. By contrast, lossy compression permits reconstruction only of an approximation of the original data, though this usually improves compression rates (and therefore reduces file sizes) Image Compression Types
  • 7. Lossy Compression Techniques LossyCompressionVectorquantizationbyLinde-Buzo-Gray Lossy compression technique provides higher compression ratio than lossless compression. A lossy compression scheme, shown in Figure, may examine the color data for a range of pixels, and identify subtle variations in pixel color values that are so minute that the human eye/brain is unable to distinguish the difference between them. Vector quantization (VQ) is a classical quantization technique from signal processing that allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of points (vectors) into groups having approximately the same number of points closest to them.
  • 8. Linde, Buzo, and Gray (LBG) proposed a VQ design algorithm based on a training sequence. The use of a training sequence bypasses the need for multi-dimensional integration. The LBG algorithm Algorithm They used a mapping function to partition training vectors into clusters and be is of iterative type and in each iteration a large set of vectors, generally referred to as training set, is needed to be processed. Lossy Compression Techniques (cont.)
  • 9. Wavelet Transforms Represent an image as a sum of wavelet functions (wavelets) with different locations and scales. Any decomposition of an image into wavelets involves a pair of waveforms: one to represent the high frequencies corresponding to the detailed parts of an image and one for the low frequencies or smooth parts of an image.
  • 10.  Discrete Wavelet Transform The Discrete Wavelet Transform (DWT) of image signals produces a nonredundant image representation, which provides better spatial and spectral localization of image formation, compared with other multi scale representations such as Gaussian and Laplacian pyramid. Recently, Discrete Wavelet Transform has attracted more and more interest in image fusion .An image can be decomposed into a sequence of different spatial resolution images using DWT.In case of a 2D image, an N level decomposition can be performed resulting in 3N+1 different frequency bands and it is shown in figure. Wavelet Transforms (cont.)
  • 11. Wavelet Transforms (cont.) 2D - Discrete wavelet transform
  • 12.  Lifting Wavelet Transform The lifting scheme is a technique for both designing wavelets an d performing the discrete wavelet transform. Actually it is worth while to merge these steps and design the wavelet filters while pe rforming the wavelet transform. This is then called the second g eneration wavelet transform. Wavelet Transforms (cont.) Diagram lifting wavelet scheme transform
  • 13.  Stationary Wavelet Transform The stationary wavelet transform (SWT) is a wavelet transform algorithm designed to overcome the lack of translation invariance of the Discrete Wavelet Transform (DWT). Translation invariance is achieved by removing the down samplers and up samplers in the Discrete Wavelet Transform (DWT) and up sampling the filter coefficients by a factor of in the level of the algorithm. The SWT is an inherently redundant scheme as the output of each level of SWT contains the same number of samples as the input. Wavelet Transforms (cont.)
  • 14. The Stationary Wavelet Transform (SWT) is similar to the DWT except the signal is never sub-sampled and instead the filters are up sampled at each level of decomposition. The following block diagram depicts the digital implementation of SWT as shown in figure. Wavelet Transforms (cont.)
  • 15. Problem Statement • The large increase in the data lead to delays in access to the information required and this leads to a delay in the time. Large data lead to data units and storage is full this leads to the need to buy a bigger space for storage and losing money. Large data lead to give inaccurate results for the similarity of data and this leads to getting inaccurate information. • Also to show the difference between the types of transforms Stationary Wavelet Transform, Discrete Wavelet Transform, and Lifting Wavelet Transform because they are very similar at one level so we used three levels.
  • 16. Research Objective In lossy compression, the compression ratio is unaccepted. The proposed system suggests an image compression method of lossy image compression through the three types of transformations such as stationary wavelet transform, discrete wavelet transform , and lifting wavelet transform and the comparison between the three types and the use of vector quantization (VQ) to improve the image compression process.
  • 17. Methodology The proposed lossy compression approach applied SWT and VQ techniques in order to compressed input images in four phases; namely preprocessing, image transformation, zigzag scan, and lossy/lossless compression. In figure shows the main steps of the system that follows the schema independent and image compression techniques. We discuss how a matrix arrangement gives us the best compression ratio and lessloss of the characteristics of the image through a wavelet transform with lossy compression techniques.
  • 18. Methodology (cont.) In Block Diagram in the following shows the work in sequence.
  • 19. Methodology (cont.) Step 1 Pre Processing First step of the proposed system When enter five images to the system, pre-processing will be applied on images which are resize of the image in accordance with the measured rate of different sizes to (8 × 8) And then converted from (RGB) to (gray scale).
  • 20. Methodology(cont.) Step 2 Wavelet transforms Image transformation phase received the resizable gray scale images and produced transformed images. This phase used the three types of wavelet transforms such as DWT, LWT, and SWT.
  • 21. Methodology(cont.) Step 3 Zigzag Scan In this step we convert the matrix from 2-D to 1-D by zigzag scan. Zigzag scans ordering converting a 2-D matrix into a 1-D array, so that the frequency (horizontal + vertical) increase in this order and the coefficient variance decreases in this order as figure.
  • 22. Step 4 Lossy compression In this step we do more than try to get the highest possible compression ratio. We enter the matrix to lossy compression using (VQ). And again we enter the matrix to lossless compression(Huffman Coding and Arithmetic Coding) and make a comparison of the results Between the two experiments. And again we enter the matrix to lossy compression using (VQ), output of this process, introduce it to lossless compression(Huffman Coding and Arithmetic Coding) to get the highest possible compression ratio and compare the results and find the best Methodology(cont.)
  • 23. Methodology(cont.) Compression Ratio Compression Ratio: is the ratio of size of the compressed database system with the original size of the uncompressed database systems. Also known as compression power is a computer-science term used to quantify the reduction in data-representation size produced by a data compression algorithm. Compression ratio is defined as follows: Compression Time • Compression Time = represents the elapsed time during the compression process.
  • 24. Experiments and Results Analysis Experiments In this section of the performance of three types of wavelet transform (SWT, DWT, and LWT) and the impact of each type on the image lossy compression performance also it shows the lossy using vector quantization (LBG) and lossless compression using Arithmetic coding and Huffman coding. The First Experiment In this experiment, four operations:  1- DWT-Zigzag-Arithmetic  2- DWT-Zigzag-LBG–Arithmetic  3- DWT-Zigzag-Huffman  4- DWT-Zigzag-LBG–Huffman Table 1 showing results for the process lossy and lossless image compression to the five images using the discrete wavelet transform with arithmetic coding and huffman coding without the use of the LBG, as well as with the use of the LBG and that using three decomposition levels.
  • 25. Experiments (cont.) Discrete wavelet transform, vector quantization (LBG), Arithmetic and Huffman coding DWT DWT Zigzag Arithmetic DWT Zigzag LBG & Arithmetic DWT Zigzag Huffman DWT Zigzag LBG & Huffman Image Level C.Ratio Running time(Sec) C.Ratio psnr Running time(Sec) C.Ratio Running time(Sec) C.Ratio psnr Running time (Sec) Lena 1 1.1934 0.4919 1.2549 18.2975 0.0157 1.1403 0.0735 1.1879 18.2975 0.057 2 1.261 0.0459 1.3027 18.2745 0.012 1.0556 0.0785 1.1403 18.2745 0.0438 3 1.2994 0.0721 1.28 18.2449 0.0164 1.026 0.1237 1.1583 18.2449 0.0465 Camera man 1 1.2518 0.0351 1.2549 18.2588 0.0158 1.177 0.0611 1.2549 18.2588 0.0421 2 1.2549 0.0498 1.2641 18.1648 0.0125 1.1557 0.0904 1.2047 18.1648 0.0459 3 1.2896 0.062 1.2457 18.0733 0.0111 1.1454 0.1148 1.2018 18.0733 0.0609 Tulips 1 1.1851 0.093 1.2427 17.4091 0.0153 1.1824 0.1483 1.199 17.4091 0.0657 2 1.1934 0.0965 1.28 17.4196 0.0105 1.177 0.1231 1.199 17.4196 0.0458 3 1.0916 0.1131 1.2864 17.3919 0.011 1.1479 0.2548 1.1824 17.3919 0.0447 White flower 1 1.0622 0.0431 1.2549 16.7503 0.0128 1.0385 0.0764 1.1879 16.7503 0.0413 2 1.1203 0.0546 1.2549 16.7639 0.0106 1.0893 0.075 1.1934 16.7639 0.0458 3 1.0916 0.0457 1.2518 16.8377 0.0169 1.026 0.0785 1.1879 16.8377 0.047 Fruits 1 1.2047 0.0489 1.28 17.5693 0.013 1.1428 0.0829 1.2104 17.5693 0.0513 2 1.2104 0.0922 1.2427 17.6137 0.0139 1.1302 0.0967 1.2161 17.6137 0.044 3 1.2161 0.0508 1.2641 17.5718 0.0148 1.1252 0.0831 1.1962 17.5718 0.0455
  • 26. Experiments (cont.) The Second Experiment In this experiment, four operations:  1- LWT-Zigzag-Arithmetic  2- LWT-Zigzag-LBG–Arithmetic  3- LWT-Zigzag- Huffman  4- LWT-Zigzag-LBG–Huffman Table 2 showing results for the process lossy and lossless image compression to the five images using the lifting wavelet transform with arithmetic coding and huffman coding without the use of the LBG, as well as with the use of the LBG and that using three decomposition levels .
  • 27. Experiments (cont.) Lifting wavelet transform, vector quantization (LBG), Arithmetic and Huffman coding LWT LWT Zigzag Arithmetic LWT Zigzag LBG & Arithmetic LWT Zigzag Huffman LWT Zigzag LBG & Huffman Image Level C.Ratio Running time (Sec) C.Ratio psnr Running time (Sec) C.Ratio Running time (Sec) C.Ratio psnr Running time (Sec) Lena 1 1.4065 0.3177 1.6842 13.1876 0.0081 1.3763 0.0674 1.4545 13.1876 0.0216 2 1.3763 0.4231 1.641 11.9784 0.0097 1.113 0.0527 1.4712 11.9784 0.0162 3 1.1636 0.0489 1.6842 17.4394 0.0073 1.094 0.0708 1.4545 17.4394 0.0154 Camera man 1 1.5421 0.0658 1.641 13.6895 0.0076 1.2673 0.0511 1.4712 13.6895 0.017 2 1.2427 0.0326 1.7534 12.7065 0.0093 1.1327 0.0401 1.4222 12.7065 0.0155 3 1.1428 0.0376 1.6623 16.9649 0.0074 1.1228 0.0836 1.4222 16.9649 0.0204 Tulips 1 1.0275 0.0947 1.7777 16.2979 0.0122 1.3763 0.1357 1.4545 17.0032 0.0196 2 1.4382 0.1336 1.641 12.2671 0.0111 1.094 0.1054 1.4712 12.2671 0.0225 3 1.2549 0.1174 1.6842 19.5465 0.0073 1.0578 0.1067 1.4545 19.5465 0.0162 White flower 1 1.3913 0.04 1.641 15.4661 0.0073 1.3763 0.0537 1.4712 15.4661 0.0182 2 1.3061 0.0473 1.7066 14.3703 0.0118 1.2549 0.0528 1.4545 14.3703 0.0186 3 1.1636 0.0827 1.641 16.1241 0.0074 1.2549 0.0599 1.4712 16.1241 0.0162 Fruits 1 1.2397 0.0453 1.7777 12.3394 0.0091 1.1228 0.0557 1.4065 12.3394 0.016 2 1.3763 0.079 1.641 12.2289 0.0089 1.113 0.0902 1.4712 12.2289 0.0164 3 1.1962 0.0874 1.6202 18.1602 0.0074 1.0756 0.0652 1.4065 18.1602 0.0164
  • 28. Experiments (cont.) The Third Experiment In this experiment, four operations:  1- SWT-Zigzag-Arithmetic  2- SWT–Zigzag-LBG–Arithmetic  3- SWT-Zigzag- Huffman  4- SWT–Zigzag-LBG–Huffman In the table 3, showing results for the process lossy and lossless image compression to five images using stationary wavelet transform with arithmetic coding and Huffman coding without the use of the LBG, as well as with the use of the LBG and that using three decomposition levels.
  • 29. Experiments (cont.) Stationary wavelet transform, vector quantization (LBG), Arithmetic and Huffman coding SWT SWT Zigzag Arithmetic SWT Zigzag LBG & Arithmetic SWT Zigzag Huffman SWT Zigzag LBG & Huffman Image Level C.Ratio Running time(Sec) C.Ratio psnr Running time(Sec) C.Ratio Running time(Sec) C.Ratio psnr Running time(Sec) Lena 1 4.3667 0.1155 5.0073 18.0121 0.0685 2.6256 0.859 4.8188 18.0121 0.0473 2 4.3667 0.0414 5.0073 18.8982 0.012 2.6256 0.8439 4.8188 18.8982 0.0455 3 4.3667 0.1906 5.0073 18.8982 0.0137 2.6256 0.8576 4.8188 18.8982 0.0422 Camera man 1 4.1042 0.0651 5.0073 16.8483 0.011 2.6771 0.9157 4.853 16.8483 0.0419 2 4.1042 0.0537 5.0073 18.1099 0.011 2.6771 0.8346 4.853 18.1099 0.0447 3 4.1042 0.0398 5.0073 18.1099 0.0103 2.6771 0.9481 4.853 18.1099 0.0462 Tulips 1 3.8641 0.0934 5.6574 18.6787 0.0099 2.7563 0.8965 4.6022 18.6787 0.0461 2 3.8641 0.0961 5.6574 17.1798 0.0116 2.7563 0.9289 4.6022 17.1798 0.0456 3 3.8641 0.0969 5.6574 17.1798 0.0121 2.7563 0.8919 4.6022 17.1798 0.0421 White flower 1 3.7372 0.0393 4.9588 17.3002 0.0117 2.7018 0.8483 4.6757 17.3002 0.0459 2 3.7372 0.0392 4.9588 17.2142 0.0128 2.7018 0.8438 4.6757 17.2142 0.0459 3 3.7372 0.041 4.9588 17.2142 0.012 2.7018 0.8411 4.6757 17.2142 0.0412 Fruits 1 3.828 0.0584 5.1072 18.9503 0.0132 2.7379 0.8438 4.3206 18.9503 0.0435 2 3.828 0.458 5.1072 18.1739 0.0105 2.7379 0.8585 4.3206 18.1739 0.0567 3 3.828 0.1188 5.1072 18.1739 0.012 2.7379 0.8463 4.3206 18.1739 0.043
  • 30. Experiments (cont.)  Average Compression Ratio Level – 1 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 Arithmatic LBG Zigzag Arithmatic Huffman LBG Zigzag Huffman Average Compression Ratio (C.R) in Level -1 SWT DWT LWT In level - 1, we find that SWT & LBG Zigzag arithmetic the best thing, and find that arithmetic the best of huffman with everyone.
  • 31. Experiments (cont.) 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 Arithmatic LBG Zigzag Arithmatic Huffman LBG Zigzag Huffman Average Compression Ratio (C.R) in Level - 2 SWT DWT LWT  Average Compression Ratio Level – 2 In level - 2 , We find that SWT & LBG Zigzag Arithmetic the best thing , and find that Arithmetic the best of Huffman with everyone, and firming (SWT) as in level 1, and the high rate of (DWT) and low rate (LWT) .
  • 32. Experiments (cont.)  Average Compression Ratio Level – 3 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 Arithmatic LBG Zigzag Arithmatic Huffman LBG Zigzag Huffman Average Compression Ratio (C.R) in Level - 3 SWT DWT LWT In level - 3, we find that SWT & LBG Zigzag Arithmetic the best thing, and find that Arithmetic the best of Huffman with everyone, and firming (SWT) as in level 1 & 2, and the low rate of (DWT) and low rate (LWT).
  • 33. 1- Compression ratio in LBG Bigger without LBG. 2- Stationary wavelet transform best transform. 3- Arithmetic coding best of Huffman coding. 4- That the best path for image compression is Stationary wavelet transform - zigzag scan – Vector Quantization (LBG) - Arithmetic coding where the compression ratio achieved 5.1476 in 0.02286 Running time (Sec). Results Analysis
  • 34.  This thesis introduced a novel approach that is built to work on image compression. Our approach used vector quantization LB G, Arithmetic coding and Huffman coding with three types of wa velet transforms such as Discrete Wavelet Transform DWT, Lifti ng Wavelet Transform LWT, and Stationary Wavelet Transform SWT on three decomposition levels. As in Stationary Wavelet Tr ansform (SWT) compression ratio is fixed at a high level, and Di screte Wavelet Transform (DWT) compression ratio variable at a high level, either Lifting Wavelet Transform (LWT) is less than t he compression at high level.  We conclude that arithmetic coding is better than Huffman codi ng in terms of compression ratio and time. We found that the bes t way to compression in this system is the stationary wavelet tran sforms (SWT), LBG vector quantization, and arithmetic coding where it gives the best compression ratio with less time possible. Also the size of compressed data by adding arithmetic coding is b etter than adding Huffman coding to SWT. CONCLUSION