Matlab Code For Image Compression Using SPIHT Algorithm

4/11/2018 Matlab Code for Image Compression using SPIHT Algorithm
solutions.net/checkout/cart/) / Checkout (https://www.pantechsolutions.net/checkout/onepage)
wcm9qZWN0cy9tYXRsYWItY29kZS1mb3ItaW1hZ2UtY29tcHJlc3Npb24tdXNpbmctc3BpaHQtYWxnb3JpdGhtP19fX1NJRD1V/)
(https://www.pantechsolutions.net/)
Search for products, categories, ...
0 My Bag
0 item(s) - 0.00
(https://www.pantechsolutions.n
Projects Source Code
8051 Projects (Https://Www.Pantechsolutions.Net/8051-Projects)
ARM7 Projects (Https://Www.Pantechsolutions.Net/Arm7-Projects)
Arduino Projects (Https://Www.Pantechsolutions.Net/Arduino-Projects)
Raspberry Pi Projects (Https://Www.Pantechsolutions.Net/Raspberry-Pi-Projects)
FPGA Projects (Https://Www.Pantechsolutions.Net/Fpga-Projects)
VLSI Projects (Https://Www.Pantechsolutions.Net/Vlsi-Projects)
IoT Projects (Https://Www.Pantechsolutions.Net/Iot-Projects)
Image Processing Projects (Https://Www.Pantechsolutions.Net/Image-Processing-Projects)
Video Processing Projects (Https://Www.Pantechsolutions.Net/Video-Processing-Projects)
Robotics Projects (Https://Www.Pantechsolutions.Net/Robotics-Projects)
Audio Processing Projects (Https://Www.Pantechsolutions.Net/Audio-Processing-Projects)
Brain Computer Interface (Https://Www.Pantechsolutions.Net/Brain-Computer-Interface)
Gesture Recognition Projects (Https://Www.Pantechsolutions.Net/Gesture-Recognition-Projects)
DSPIC Projects (Https://Www.Pantechsolutions.Net/Dspic-Projects)
VHDL Projects (Https://Www.Pantechsolutions.Net/Vhdl-Projects)
Power Electronics Projects (Https://Www.Pantechsolutions.Net/Power-Electronics-Projects)
Information Technology (Https://Www.Pantechsolutions.Net/Information-Technology)
DSP Projects (Https://Www.Pantechsolutions.Net/Dsp-Projects)
OpenCV Projects (Https://Www.Pantechsolutions.Net/Opencv-Projects)
Embedded Projects (Https://Www.Pantechsolutions.Net/Embedded-Projects)
Home (https://www.pantechsolutions.net/) / Projects Source Code / Image processing Projects (https://www.pantechsolutions.net/image-

processing-projects) / Matlab Code for Image Compression using SPIHT Algorithm
Matlab Code for Image Compression using SPIHT Algorithm

(/image-processing-projects/matlab-code-for-image-compression-
using-spiht-algorithm)
https://www.pantechsolutions.net/image-processing-projects/matlab-code-for-image-compression-using-spiht-algorithm 1/19
 Write a review

2,000.00
Add to Cart
Matlab Code for Image Compression using Spiht Algorithm

Introduction To Image Compression
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.
Demonstration Video
SPIHT Algorithm using Matlab
There are several different ways in which image files can be compressed. For Internet use, the two
most common compressed graphic image formats are the JPEG format and the GIF format. The
JPEG method is more often used for photographs, while the GIF method is commonly used for line
art and other images in which geometric shapes are relatively simple.
Other techniques for image compression include the use of fractals and wavelets. These methods
have not gained widespread acceptance for use on the Internet as of this writing. However, both
methods offer promise because they offer higher compression ratios than the JPEG or GIF methods
for some types of images. Another new method that may in time replace the GIF format is the PNG
format.
Compressing an image is significantly different than compressing raw binary data. Of course,
general-purpose compression programs can be used to compress images, but the result is less than
optimal. This is because images have certain statistical properties, which can be exploited by
encoders specifically designed for them. Also, some of the finer details in the image can be
sacrificed for the sake of saving a little more bandwidth or storage space. This also means that
lossy compression techniques can be used in this area.
A text file or program can be compressed without the introduction of errors, but only up to a certain
extent. This is called lossless compression. Beyond this point, errors are introduced. In text and
program files, it is crucial that compression be lossless because a single error can seriously
damage the meaning of a text file, or cause a program not to run. In image compression, a small
loss in quality is usually not noticeable. There is no "critical point" up to which compression works
perfectly, but beyond which it becomes impossible. When there is some tolerance for loss, the
compression factor can be greater than it can when there is no loss tolerance. For this reason,
graphic images can be compressed more than text files or programs.
Why Do We Need Compression?

One of the important aspects of image storage is its efficient compression. To make this fact clear
let's see an example. An image, 1024 pixel x 1024 pixel x 24 bit, without compression, would
require 3 MB of storage and 7 minutes for transmission, utilizing a high speed, 64 Kbit/s, ISDN line.
If the image is compressed at a 10:1 compression ratio, the storage requirement is reduced to 300
KB and the transmission time drops to under 6 seconds. Seven 1 MB images can be compressed
and transferred to a floppy disk in less time than it takes to send one of the original files,
uncompressed, over an AppleTalk network.
In a distributed environment large image files remain a major bottleneck within systems.
Compression is an important component of the solutions available for creating file sizes of
manageable and transmittable dimensions. Increasing the bandwidth is another method, but the
cost sometimes makes this a less attractive solution.
The figures in Table 1 show the qualitative transition from simple text to full-motion video data and
the disk space, transmission bandwidth, and transmission time needed to store and transmit such
uncompressed data.
Table.1 Multimedia data types and uncompressed storage space, transmission bandwidth,
and transmission time required. The prefix kilo- denotes a factor of 1000 rather than 1024.
Multimedia Size/Duration Bits/pixel or Uncompressed Transmission

Time (Using a
Data Bits/Sample Size 28.8K Modem)
(B for bytes)
A page of text 11˝X 8.5˝ Varying 4-8KB 1.1-2.2sec
resolution
Telephone 10 sec 8bps 80KB 22.2sec

Quality
Grayscale 512 X 512 8bpp 262KB 1 min 13 sec
Image
Color 512 X 512 24bpp 786KB 3 min 39 sec
Image
Medical 2048 X 1680 12bpp 5.16MB 23 min 54 sec
Image
SHD 2048 X 2048 24bpp 12.58MB 58 min 15 sec
Image
Full-motion 640 X 480, 24bpp 1.66GB 5 days 8 hrs
Video 1 min
(30 frames/sec)
br>
The examples above clearly illustrate the need for sufficient storage space, large transmission
bandwidth, and long transmission time for image, audio, and video data. At the present state of
technology, the only solution is to compress multimedia data before its storage and transmission,
and decompress it at the receiver for play back. For example, with a compression ratio of 32:1, the
space, bandwidth, and transmission time requirements can be reduced by a factor of 32, with
acceptable quality.
What are the principles behind compression?

A common characteristic of most images is that the neighboring pixels are correlated and therefore
contain redundant information. The foremost task then is to find less correlated representation of
the image.
Image compression addresses the problem of reducing the amount of data required to represent a
digital image. The underlying basis of the reduction process is the removal of redundant data. From
a mathematical viewpoint, this amounts to transforming a 2-D pixel array into a statistically
uncorrelated data set. The transformation is applied prior to storage and transmission of the image.
The compressed image is decompressed at some later time, to reconstruct the original image or an
approximation to it.
Two fundamental components of compression are redundancy and irrelevancy reduction.

Redundancy reduction aims at removing duplication from the signal source (image/video).
Irrelevancy reduction omits parts of the signal that will not be noticed by the signal receiver,
namely the Human Visual System (HVS). In general, three types of redundancy can be identified:
Spatial Redundancy or correlation between neighbouring pixel values.

Spectral Redundancy or correlation between different color planes or spectral bands.
Temporal Redundancy or correlation between adjacent frames in a sequence of images (in video
applications).
Image compression research aims at reducing the number of bits needed to represent an image by
removing the spatial and spectral redundancies as much as possible.
Different Classes Of Compression Techniques

Two ways of classifying compression techniques are mentioned here.
(a) Lossless vs. Lossy compression: In lossless compression schemes, the reconstructed image,
after compression, is numerically identical to the original image. However lossless compression can
only a achieve a modest amount of compression. An image reconstructed following lossy
compression contains degradation relative to the original. Often this is because the compression
scheme completely discards redundant information. However, lossy schemes are capable of
achieving much higher compression. Under normal viewing conditions, no visible loss is perceived
(visually lossless).
The information loss in lossy coding comes from quantization of the data. Quantization can be
described as the process of sorting the data into different bits and representing each bit with a
value. The value selected to represent a bit is called the reconstruction value. Every item in a bit
has the same reconstruction value, which leads to information loss (unless the quantization is so
fine that every item gets its own bit).
(b) Predictive vs. Transform coding: In predictive coding, information already sent or available is
used to predict future values, and the difference is coded. Since this is done in the image or spatial
domain, it is relatively simple to implement and is readily adapted to local image characteristics.
Differential Pulse Code Modulation (DPCM) is one particular example of predictive coding.
Transform coding, on the other hand, first transforms the image from its spatial domain
representation to a different type of representation using some well-known transform and then
codes the transformed values (coefficients). This method provides greater data compression
compared to predictive methods, although at the expense of greater computation
Image Compression Process

A typical lossy image compression system is shown in Fig. 1. It consists of three closely connected
components namely (a) Source Encoder (b) Quantizer, and (c) Entropy Encoder. Compression is
accomplished by applying a linear transform to decorrelate the image data, quantizing the resulting
transform coefficients, and entropy coding the quantized values
Source Encoder (or Linear Transformer):

Over the years, a variety of linear transforms have been developed which include Discrete Fourier
Transform (DFT), Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and many
more, each with its own advantages and disadvantages.
Quantizer:
A quantizer simply reduces the number of bits needed to store the transformed coefficients by
reducing the precision of those values. Since this is a many-to-one mapping, it is a lossy process
and is the main source of compression in an encoder. Quantization can be performed on each
individual coefficient, which is known as Scalar Quantization (SQ). Quantization can also be
performed on a group of coefficients together, and this is known as Vector Quantization (VQ). Both
uniform and non-uniform quantizers can be used depending on the problem at hand.
Entropy Encoder:
An entropy encoder further compresses the quantized values losslessly to give better overall
compression. It uses a model to accurately determine the probabilities for each quantized value and
produces an appropriate code based on these probabilities so that the resultant output code stream
will be smaller than the input stream. The most commonly used entropy encoders are the Huffman
encoder and the arithmetic encoder, although for applications requiring fast execution, simple run-
length encoding (RLE) has proven very effective.
It is important to note that a properly designed quantizer and entropy encoder are absolutely
necessary along with optimum signal transformation to get the best possible compression.
Wavelet Transform
One of the most important characteristics of wavelet transform is multiresolution decomposition. An
image decomposed by wavelet transform can be reconstructed with desired resolution. In the
thesis, a face image is first transformed to the wavelet domain using pyramid decomposition [16].
Fig. 3.1 shows a four-level wavelet decomposition. In our experiments, an image is decomposed
using the Daubechies orthogonal filter of
A four-level wavelet decomposition.
length 8 up to five decomposition levels [17]. The procedure goes like this. A low pass filter and a
high pass filter are chosen, such that they exactly halve the frequency range between themselves.
This filter pair is called the Analysis Filter pair. First, the low pass filter is applied for each row of
data, thereby getting the low frequency components of the row. But since the LPF is a half band
filter, the output data contains frequencies only in the first half of the original frequency range. So,
by Shannon's Sampling Theorem, they can be subsampled by two, so that the output data now
contains only half the original number of samples. Now, the high pass filter is applied for the same
row of data, and similarly the high pass components are separated, and placed by the side of the
low pass components. This procedure is done for all rows.
Next, the filtering is done for each column of the intermediate data. The resulting two-dimensional
array of coefficients contains four bands of data, each labelled as LL (low-low), HL (high-low), LH
(low-high) and HH (high-high). The LL band can be decomposed once again in the same manner,
thereby producing even more subbands. This can be done upto any level, thereby resulting in a
pyramidal decomposition as shown below.
Pyramidal Decomposition of an Image
As mentioned above, the LL band at the highest level can be classified as most important, and the
other 'detail' bands can be classified as of lesser importance, with the degree of importance
decreasing from the top of the pyramid to the bands at the bottom.
The three layer decomposition of the 'Lena' image.
The Inverse Dwt Of An Image

Just as a forward transform to used to separate the image data into various classes of importance,
a reverse transform is used to reassemble the various classes of data into a reconstructed image. A
pair of high pass and low pass filters is used here also. This filter pair is called the Synthesis Filter
pair. The filtering procedure is just the opposite - we start from the topmost level, apply the filters
column wise first and then row wise, and proceed to the next level, till we reach the first level.
SPIHT (Set Partitioning In Hierarchical Trees)

The SPIHT method is not a simple extension of traditional methods for image compression, and
represents an important advance in the field. The SPIHT (set partitioning in hierarchical trees) is an
efficient image coding method using the wavelet transform. Recently, image-coding using the
wavelet transform has attracted great attention. Among the many coding algorithms, the embedded
zero tree wavelet coding by Shapiro and its improved version, the set partitioning in hierarchical
trees (SPIHT) by Said and Pearlman have been very successful. Compared with JPEG - the current
standard for still image compression, the EZW and the SPIHT are more efficient and reduce the
blocking artifact.
The method deserves special attention because it provides the following:
Good image quality, high PSNR, especially for color images;

It is optimized for progressive image transmission;
Produces a fully embedded coded file;
Simple quantization algorithm;
Can be used for lossless compression;
Can code to exact bit rate or distortion;
Fast coding/decoding (nearly symmetric);
Has wide applications, completely adaptive;
Efficient combination with error protection.
Each of these properties is discussed below. Note that different compression methods were
developed specifically to achieve at least one of those objectives. What makes SPIHT really
outstanding is that it yields all those qualities simultaneously.
Image Quality
SPIHT wins in the test of finding the minimum rate required to obtain a reproduction
indistinguishable from the original. The SPIHT advantage is even more pronounced in encoding
color images, because the bits are allocated automatically for local optimality among the color
components, unlike other algorithms that encode the color components separately based on global
statistics of the individual components. We can see that visually lossless color compression is
obtained with some images at compression ratios from 100-200:1.
Progressive Image Transmission

In some systems with progressive image transmission (like WWW browsers) the quality of the
displayed images is inefficient. The problem is that such widely used schemes employ a very
primitive progressive image transmission method. On the other extreme, SPIHT is a state-of-the-art
method that was designed for optimal progressive transmission (and still beats most non-
progressive methods!). It does so by producing a fully embedded coded file, in a manner that at any
moment the quality of the displayed image is the best available for the number of bits received up to
that moment. So, SPIHT can be very useful for applications where the user can quickly inspect the
image and decide if it should be really downloaded, or is good enough to be saved, or need
refinement.
Optimized Embedded Coding

A strict definition of the embedded coding scheme is: if two files produced by the encoder have size
M and N bits, with M > N, then the file with size N is identical to the first N bits of the file with size
M.
Let's see how this abstract definition is used in practice. Suppose you need to compress an image
for three remote users. Each one have different needs of image reproduction quality, and you find
that those qualities can be obtained with the image compressed to at least 8 Kb, 30 Kb, and 80 Kb,
respectively. If you use a non-embedded encoder (like JPEG), to save in transmission costs (or
time) you must prepare one file for each user. On the other hand, if you use an embedded encoder
(like SPIHT) then you can compress the image to a single 80 Kb file, and then send the first 8 Kb of
the file to the first user, the first 30 Kb to the second user, and the whole file to the third user.
Surprisingly, with SPIHT all three users would get (for the same file size) an image quality
comparable or superior to the most sophisticated non-embedded encoders available today. SPIHT
achieves this feat by optimizing the embedded coding process and always coding the most
important information first.
Lossless Compression
SPIHT codes the individual bits of the image wavelet transform coefficients following a bit-plane
sequence. Thus, it is capable of recovering the image perfectly (every single bit of it) by coding all
bits of the transform. However, the wavelet transform yields perfect reconstruction only if its
numbers are stored as infinite-precision numbers. In practice it is frequently possible to recover the
image perfectly using rounding after recovery, but this is not the most efficient approach.
A codec that uses this transformation to yield efficient progressive transmission up to lossless
recovery is among the SPIHT .A surprising result obtained with this codec is that for lossless
compression it is as efficient as the most effective lossless encoders (lossless JPEG is definitely
not among them). In other words, the property that SPIHT yields progressive transmission with
practically no penalty in compression efficiency applies to lossless compression too.
Rate Or Distortion Specification
Almost all image compression methods developed so far do not have precise rate control. For some
methods you specify a target rate, and the program tries to give something that is not too far from
what you wanted. For others you specify a "quality factor" and wait to see if the size of the file fits
your needs.
The embedded property of SPIHT allows exact bit rate control, without any penalty in performance
(no bits wasted with padding, or whatever). The same property also allows exact mean squared-
error (MSE) distortion control. Even though the MSE is not the best measure of image quality, it is
far superior to other criteria used for quality specification.
Encoding/Decoding Speed
A straightforward consequence of the compression simplicity is the greater coding/decoding speed.
The SPIHT algorithm is nearly symmetric, i.e., the time to encode is nearly equal to the time to
decode. (Complex compression algorithms tend to have encoding times much larger than the
decoding times.)
Hierarchical Tree
In this subsection, we will describe the proposed algorithm to code the wavelet coefficients. In
general, a wavelet decomposed image typically has non-uniform distribution of energy within and
across subbands. This motivates us to partition each subband into different regions depending on
their significance and then assign these regions with different quantization levels.
The proposed coding algorithm is based on the set partitioning in hierarchical trees (SPIHT)
algorithm [18], which is an elegant bit-plane encoding method that generates M embedded bit
sequence through M stages of successive quantization. Let s0, s1, …, sM-1 denote the encoder’s
output bit sequence of each stage. These bit sequences are ordered in such a way that s0 consists
of the most significant bit, s1 consists of the next most significant bit, and so on.
The SPIHT algorithm forms a hierarchical quadtree data structure for the wavelet transformed
coefficients. The set of root node and corresponding descendents are referred to as a spatial
orientation tree (SOT)(see Fig. 3.2). The tree is defined in such a way that each node has either no
leaves or four offspring, which are from 2 x 2 adjacent pixels. The pixels on the LL subimage of the
highest decomposition level are the tree roots and are also grouped in 2 x 2 adjacent pixels.
However, the upper-left pixel in 2 x 2 adjacent pixels (as shown in Fig. 3.2) has no descendant.
Each of the other three pixels has four children.
Quadtree organization of wavelet coefficients in SPIHT algorithm
For the convenience of illustrating the real implementation of SPIHT, the following sets of
coordinates are defined.
O(i, j): set of coordinates of all offspring of node (i, j);

D(i, j): set of coordinates of all descendants of the node (i, j);
H: set of coordinates of all spatial orientation tree roots (nodes in the highest pyramid level);
L(i, j)=D(i, j)-O(i, j).
Thus, except at the highest and lowest levels, we have
O(i, j)={(2i, 2j), (2i, 2j+1), (2i+1, 2j), (2i+1, 2j+1)}.
Define the following function.
Sn(τ) indicate the significance of a set of coordinates ,where T(n) is the preset significant threshold
used in the nth stage. A detailed description of the SPIHT coding algorithm is given as follows.
Initially,T(0) is set to be 2M-1 , where M is selected such that the largest coefficient magnitude, say
cmax, satisfies 2M-1≤Cmax<2M . The encoding is progressive in coefficient magnitude for
successively using a sequence of thresholds T(n)=2(M-1)-n,n=0.1...,M-1. Since the thresholds are a
power of two, the encoding method can be regarded as "bit-plane" encoding of the wavelet
coefficients. At stage n, all coefficients with magnitudes between T(n) and 2T(n) are identified as
"significant," and their positions and sign bits are encoded. This process is called a sorting pass.
Then, every coefficient with magnitude at least 2T(n) is "refined" by encoding the nth most
significant bit. This is called a refinement pass. The encoding of significant coefficient position and
the scanning of the significant coefficients for refinement are efficiently accomplished through using
the following three lists: the list of significant pixels (LSP), the list of insignificant pixels (LIP), and
the list of insignificant set (LIS). Each entry in the LIP and LSP represents an individual pixel which
is identified by coordinates (i, j). While in the LIS, each entry represents either the set D(i j) or L(i,
j). An LIS entry is regarded as of type A if it represents D(i, j) and of type B if it represents L(i, j).
Algorithm: SPIHT coding algorithm

Step 1: (Initialization)
Output n= ⌈ log2 (maxi,j {∣ Ci,j ∣} ⌈ , set the LSP as an empty list,
add the coordinates (i,j) to the LIP,
add the coordinates (i,j) with descendants to the list LIS, as type A entries,
Step 2: (Sorting Pass)
2.1) for each entry (i, j) in the LIP do:
output Sn(i, j),
if Sn(i, j)=1
move (i, j) to the LSP,
output the sign of ci,j,
2.2) for each entry (i, j) in the LIS do: 2.2.1) if the entry is of type A then
output Sn(D(i, j)),
if Sn(D(i, j)) = 1 then
* for each (k,l) ∈ o(i,j) do:
output Sn(k, l),
if Sn(k, l) = 1 then
add (k, l) to the LSP,
output the sign of ck,l ,
if Sn(k, l)=0 then
add (k, l) to the end of the LIP,
*if L(i,j)≠ 0 then
move (i, j) to the end of the LIS, as an entry of type B,
go to Step 2.2.2).
otherwise
remove entry (i, j) from the LIS,
2.2.2) if the entry is of type B
output Sn(L(i, j)), if Sn(L(i, j)) = 1 then *add each to the end of the LIS as an entry of type A
Step 3: (Refinement Pass)
For each entry (i, j) in the LSP, except those included in the last sorting pass (i.e., with the
same n), output the nth most significant bit of | ci,j |,
Step 4: (Quantization-Step Update)
Decrement n by 1 and go to Step 2.
Conclusion And Future Work

We pointed out that this s transform can be assigned to the encoder or the decoder and that it can
hold compressed data. We provided an analysis for the case where both encoder and decoder are
symmetric in terms of memory needs and complexity. We described highly scalable spiht coding
algorithm that can work with very low memory in combination with the wavelet transform, and
showed that its performance can be competitive with state of the art image coders, at a fraction of
their memory utilization. To the best of our knowledge, our work is the first to propose a detailed
implementation of a low memory wavelet image coder. It others a significant advantage by making a
wavelet coder attractive both in terms of speed and memory needs. Further improvements of our
system especially in terms of speed can be achieved by introducing a lattice factorization of the
wavelet kernel or by using the lifting steps. This will reduce the computational complexity and
complement the memory reductions mentioned in this work
References
[1] C. Chrysa_s and A. Ortega, Line Based Reduced Memory Wavelet Image Compression," in
Proc. IEEE Data Compression Conference, (Snowbird, Utah), pp. 398{407, 1998.
[2] W. Pennebaker and J. Mitchell, JPEG Still Image Data Compression Standard. Van Nostrand
Reinhold, 1994.
[3] D. Lee, \New work item proposal: JPEG2000 image coding system." ISO/IEC JTC1/SC29/WG1
N390, 1996.
[4] J. M. Shapiro, \Embedded Image Coding Using Zerotrees ofWavelet Coe_cients," IEEE Trans.
Signal Processing, vol. 41, pp. 3445{3462, December 1993.
[5] habibollah danyoli and Alfred mertins .Highly scalable image compression based on spiht for
network applications
[6] Rafael C.Gonzalez,Richard E.Woods,Digital Image Processing,Prentice-Hall,2002 .
[7] Rafael C.Gonzalez,Richard E.Woods,Steven l.Eddins ,Digital Image Processing Using

MATLAB,Prentice-Hall, 2004.
[8] A. M. Tekalp, Digital Video Processing. Englewood Cliffs, NJ: Prentice-Hall, 1995.
[9] M. Antonini, M. Barlaud, P. Mathieu, and I. Daubechies, “Image coding using wavelet transform,”
IEEE Trans. Image Processing, vol. 1, pp. 205–220, Apr. 1992.
[10] D. Taubman and A. Zakhor, “Multirate 3-D subband coding of video,” IEEE Trans. Image
Processing, vol. 3, pp. 572–588, Sept. 1994.
Aucun commentaire
Powered by (http://my.yotpo.com/landing_page?redirect=https%3A%2F%2Fwww.y
reviews-by-
yotpo%2F&utm_campaign=branding_link_reviews_widget_v2&utm_medium=widge
 (http://my.yotpo.com/landing_page?redirect=h
Ajouter un commentaire en tant que hali
yotpo%2F&utm_campaign=branding_link_reviews

 WRITE A REVIEW

BE THE FIRST TO WRITE A REVIEW
More Information
Warranty Information (https://www.pantechsolutions.net/warranty-
Online Retail store for Trainer Kits,Lab equipment's,Electronic information/)

components,Sensors and open source hardware.
Return Policy (https://www.pantechsolutions.net/return-policy/)
     Cancellation Order (https://www.pantechsolutions.net/cancellation-
order/)
holidays (https://www.pantechsolutions.net/holidays/)
Terms for Softwares (https://www.pantechsolutions.net/terms-for-
software/)
rohs (https://www.pantechsolutions.net/rohs/)
Dealership (https://www.pantechsolutions.net/dealership/)
Shipping Policy (https://www.pantechsolutions.net/shipping-policy/)
Company Resources
About Us (https://www.pantechsolutions.net/about-us/) Blog (https://www.pantechsolutions.net/blog/)
Terms of use (https://www.pantechsolutions.net/terms-of-use/) Videos (http://youtube.com/user/pantechsolutions)
Privacy policy (https://www.pantechsolutions.net/privacy-policy/) Presentations (http://www.slideshare.net/pantechsolutions)
Terms & Conditions (https://www.pantechsolutions.net/terms-and-
conditions/)
Careers (https://www.pantechsolutions.net/careers/)
Events (https://www.pantechsolutions.net/events/)
SiteMap (https://www.pantechsolutions.net/site-map/)
Contact us (https://www.pantechsolutions.net/contact-us/)
BOARDS AND STARTER KITS
8051 BOARDS : 8051 Development Board (https://www.pantechsolutions.net/microcontroller-boards/8051-development-board) | 8051 Trainer Kit

(https://www.pantechsolutions.net/microcontroller-boards/8051-lab-trainer-kit) | 8051 Project Board
(https://www.pantechsolutions.net/microcontroller-boards/8051-project-board)
PIC BOARDS : PIC16F877A Development Board (https://www.pantechsolutions.net/microcontroller-boards/pic-development-board) | PIC Advanced
Development board (https://www.pantechsolutions.net/microcontroller-boards/pic-advanced-development-board)
AVR BOARDS : AVR Development Board (https://www.pantechsolutions.net/microcontroller-boards/avr-development-board)
ARM BOARDS : LPC2148 Starter Kit (https://www.pantechsolutions.net/microcontroller-boards/arm7-trainer-kit)| ARM Development Board
(https://www.pantechsolutions.net/microcontroller-boards/arm7-development-board) | ARM9 Development Board
(https://www.pantechsolutions.net/microcontroller-boards/arm-9-development-board)
PSOC BOARDS : PsOC Pioneer Kit (https://www.pantechsolutions.net/microcontroller-boards/psoc4-pioneer-kit) | PsOC Development Board
(https://www.pantechsolutions.net/microcontroller-boards/psoc3-development-board)
FPGA BOARDS : FPGA Starter Kit (https://www.pantechsolutions.net/cpld-fpga-boards/spartan3an-fpga-project-kit) | FPGA Development Board
(https://www.pantechsolutions.net/cpld-fpga-boards/spartan6-fpga-project-board) | FPGA Universal Development Board
(https://www.pantechsolutions.net/cpld-fpga-boards/fpga-universal-development-board)
DSP FLOATING POINT BOARDS : TMS320F2812 Development Board (https://www.pantechsolutions.net/dsp-dsc-boards/tms320f2812-dsp-
development-board) | TMS320C6745 DSP Trainner Kit (https://www.pantechsolutions.net/dsp-dsc-boards/tms320c6745-dsp-trainer-kit) |
TMS320F28335 Development Board (https://www.pantechsolutions.net/dsp-dsc-boards/tms320f28335-dsp-development-board)
DSP FIXED POINT BOARDS : TMS320C5505 Development Board (https://www.pantechsolutions.net/dsp-dsc-boards/tms320c5505-dsp-
development-board)
MSP430 BOARDS : MSP430 Launchpad (https://www.pantechsolutions.net/microcontroller-boards/msp430-launchpad) | MSP430 Development
Board (https://www.pantechsolutions.net/microcontroller-boards/msp430-development-board)
ARDUINO BOARDS : Arduino UNO | Arduino Basic Kit | Netduino | Arduino Due | Arduino ADK
RASPBERRY PI : Raspberry Pi 3| Rapserry Pi Accessories
WIRELESS COMMUNICATION BOARDS : GSM Modem (https://www.pantechsolutions.net/wireless-boards/sim900a-gsm-modem) | Zigbee Board
(https://www.pantechsolutions.net/wireless-boards/zigbee-module-with-base-board ) | WiFI Board (https://www.pantechsolutions.net/module-ic-s/wi-
fi-proto-board) | Bluetooth Board (https://www.pantechsolutions.net/wireless-boards/hc-05-bluetooth-module-with-base-board)
WIRED COMMUNICATION BOARDS : SPI to Ethernet Interface (https://www.pantechsolutions.net/interface-cards/serial-ethernet-card)

WEARABLE TECHNOLOGY : Neurosky Mindwave Mobile : Brainwave Starter Kit (https://www.pantechsolutions.net/sensors/brainwave-starter-kit)
ACCESSORY BOARDS : GPS Board (https://www.pantechsolutions.net/wireless-boards/l80-gps-module-with-baseboard)
MODULES : GSM Modules (https://www.pantechsolutions.net/module-ic-s/m10-gsm-module) | GPS Modules
(https://www.pantechsolutions.net/wireless-boards/gps-module) | Bluetooth Modules (https://www.pantechsolutions.net/module-ic-s/hc-05-bluetooth-
module) | WIFI Modues (https://www.pantechsolutions.net/wireless-boards/esp8266-wifi-module) | RF Modules
(https://www.pantechsolutions.net/module-ic-s/rf-module-433-mhz)
SENSORS : HM2007 Speech Recognition (https://www.pantechsolutions.net/sensors/hm2007-speech-recognition) | Gesture Recognition
(https://www.pantechsolutions.net/sensors/gesture-recognition) | Brain Computer Interface (https://www.pantechsolutions.net/sensors/brainsense) |
Brainsense (https://www.pantechsolutions.net/sensors/brainsense)
PROGRAMMERS AND EMULATORS : Xilinx platform usb download cable (https://www.pantechsolutions.net/xilinx-platform-usb-download-
cable)|FPGA JTAG Programmer (https://www.pantechsolutions.net/fpga-jtag-programmer)
ROBOTICS : Line Follower Robot (https://www.pantechsolutions.net/robotics/line-follower-robot) | Gesture Controlled Robot
(https://www.pantechsolutions.net/robotics/gesture-control-robot) | Robotic ARM (https://www.pantechsolutions.net/robotics/owi-robot-arm) | Android
Controlled Robot (https://www.pantechsolutions.net/robotics-projects/android-controlled-arduino-robot-car)
MOTOR DRIVES : PMSM Motor Drive (https://www.pantechsolutions.net/power-electronics-and-drives/pmsm-motor-control-using-dspic) | BLDC
Motor Drive (https://www.pantechsolutions.net/power-electronics-and-drives/bldc-motor-control-using-dspic) | Three Phase Induction Motor Drive
(https://www.pantechsolutions.net/power-electronics-and-drives/three-phase-induction-motor-control-using-dspic) | SRM Motor Drive
(https://www.pantechsolutions.net/power-electronics-and-drives/switched-reluctance-motor-control-using-dspic) | Stepper Motor Drive
(https://www.pantechsolutions.net/power-electronics-and-drives/stepper-motor-control-using-dspic)
MOTORS : PMSM Motor (https://www.pantechsolutions.net/motors/pmsm-motor) | BLDC Motor (https://www.pantechsolutions.net/motors/bldc-
motor) | Servo Motor (https://www.pantechsolutions.net/motors/ac-servo-motor) | Three Phase Induction Motor
(https://www.pantechsolutions.net/motors/three-phase-induction-motor) |
PROJECTS AND RESOURCES
ECE MINI PROJECTS : 8051 Projects (https://www.pantechsolutions.net/8051-projects) | ARM Projects (https://www.pantechsolutions.net/arm7-

projects) | FPGA Projects (https://www.pantechsolutions.net/fpga-projects) | VLSI Projects (https://www.pantechsolutions.net/vlsi-projects) | VHDL
Projects (https://www.pantechsolutions.net/vhdl-projects) |Robotics Projects (https://www.pantechsolutions.net/robotics-projects)
EEE MINI PROJECTS: Electrical Projects | Simulink Projects
DIP PROJECTS : Image Processing Projects (https://www.pantechsolutions.net/image-processing-projects) | Video Processing Projects
(https://www.pantechsolutions.net/video-processing-projects)
PROJECTS AND RESOURCES
MICROCONTROLLERS IC'S : P89V51RD2 (https://www.pantechsolutions.net/p89v51rd2) | AT89S51 (https://www.pantechsolutions.net/at89s51) |

LPC2148 (https://www.pantechsolutions.net/microcontrollers-ic-s/lpc2148) | LPC2929 (https://www.pantechsolutions.net/microcontrollers-ic-
s/lpc2929)
DISPLAY DEVICES :Seven segment -Common Anode (https://www.pantechsolutions.net/common-anode) | Seven segment-Common Cathode
(https://www.pantechsolutions.net/common-cathode) | 2.5 inch TFT | 3.5 inch TFT | Seven Segment Display | LED
CONNECTORS : USB Mini-B SMD Connector (https://www.pantechsolutions.net/usb-mini-b-smd-connector) | DB9 FEMALE CABLE CONNECTOR
(https://www.pantechsolutions.net/db9-female-cable-connector)

Matlab Code For Image Compression Using SPIHT Algorithm

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Matlab Code For Image Compression Using SPIHT Algorithm

Загружено:

Авторское право:

Доступные форматы

4/11/2018 Matlab Code for Image Compression using SPIHT Algorithm

solutions.net/checkout/cart/) / Checkout (https://www.pantechsolutions.net/checkout/onepage)

Search for products, categories, ...

Projects Source Code

8051 Projects (Https://Www.Pantechsolutions.Net/8051-Projects)

ARM7 Projects (Https://Www.Pantechsolutions.Net/Arm7-Projects)

Arduino Projects (Https://Www.Pantechsolutions.Net/Arduino-Projects)

Raspberry Pi Projects (Https://Www.Pantechsolutions.Net/Raspberry-Pi-Projects)

FPGA Projects (Https://Www.Pantechsolutions.Net/Fpga-Projects)

VLSI Projects (Https://Www.Pantechsolutions.Net/Vlsi-Projects)

IoT Projects (Https://Www.Pantechsolutions.Net/Iot-Projects)

Image Processing Projects (Https://Www.Pantechsolutions.Net/Image-Processing-Projects)

Video Processing Projects (Https://Www.Pantechsolutions.Net/Video-Processing-Projects)

Robotics Projects (Https://Www.Pantechsolutions.Net/Robotics-Projects)

Audio Processing Projects (Https://Www.Pantechsolutions.Net/Audio-Processing-Projects)

Brain Computer Interface (Https://Www.Pantechsolutions.Net/Brain-Computer-Interface)

Gesture Recognition Projects (Https://Www.Pantechsolutions.Net/Gesture-Recognition-Projects)

DSPIC Projects (Https://Www.Pantechsolutions.Net/Dspic-Projects)

VHDL Projects (Https://Www.Pantechsolutions.Net/Vhdl-Projects)

Power Electronics Projects (Https://Www.Pantechsolutions.Net/Power-Electronics-Projects)

Information Technology (Https://Www.Pantechsolutions.Net/Information-Technology)

DSP Projects (Https://Www.Pantechsolutions.Net/Dsp-Projects)

OpenCV Projects (Https://Www.Pantechsolutions.Net/Opencv-Projects)

Embedded Projects (Https://Www.Pantechsolutions.Net/Embedded-Projects)

Home (https://www.pantechsolutions.net/) / Projects Source Code / Image processing Projects (https://www.pantechsolutions.net/image-

Matlab Code for Image Compression using SPIHT Algorithm

 Write a review

Matlab Code for Image Compression using Spiht Algorithm

Why Do We Need Compression?

Multimedia Size/Duration Bits/pixel or Uncompressed Transmission

A page of text 11˝X 8.5˝ Varying 4-8KB 1.1-2.2sec

Telephone 10 sec 8bps 80KB 22.2sec

Grayscale 512 X 512 8bpp 262KB 1 min 13 sec

Color 512 X 512 24bpp 786KB 3 min 39 sec

Medical 2048 X 1680 12bpp 5.16MB 23 min 54 sec

SHD 2048 X 2048 24bpp 12.58MB 58 min 15 sec

Full-motion 640 X 480, 24bpp 1.66GB 5 days 8 hrs

What are the principles behind compression?

Two fundamental components of compression are redundancy and irrelevancy reduction.

Spatial Redundancy or correlation between neighbouring pixel values.

Different Classes Of Compression Techniques

Image Compression Process

Source Encoder (or Linear Transformer):

A four-level wavelet decomposition.

Pyramidal Decomposition of an Image

The three layer decomposition of the 'Lena' image.

The Inverse Dwt Of An Image

SPIHT (Set Partitioning In Hierarchical Trees)

The method deserves special attention because it provides the following:

Good image quality, high PSNR, especially for color images;

Progressive Image Transmission

Optimized Embedded Coding

Rate Or Distortion Specification

Quadtree organization of wavelet coefficients in SPIHT algorithm

O(i, j): set of coordinates of all offspring of node (i, j);

Thus, except at the highest and lowest levels, we have

O(i, j)={(2i, 2j), (2i, 2j+1), (2i+1, 2j), (2i+1, 2j+1)}.

Define the following function.

Algorithm: SPIHT coding algorithm

Output n= ⌈ log2 (maxi,j {∣ Ci,j ∣} ⌈ , set the LSP as an empty list,

add the coordinates (i,j) to the LIP,

Step 2: (Sorting Pass)

2.1) for each entry (i, j) in the LIP do: