By

G.SRUTHIRAGHAVI, R.PONNI& R.DHIVYA

III-B.Tech IT,AVCCE.
 Objective
 Introduction
 Illustration
 Flow Diagram
 Compression Process
 Efficiency of Compression
 Retrieving Image
 Compression criteria
 Exponential Reduction
 Conclusion
 To provide an efficient transmission of graphical image using
sand algorithm.
Introduction
 Sand works on the principle of elimination of repetitions, it
literally absorbs pixels of the same nature (color) as the name
suggests .
 In other words the pixels of the same nature converges to a
single point this reduces the number of pixels which in turn
reduces the size of the image there by increasing the rate of
transmission.
 The coding of the information is so done that during the
decompressing process not a single bit of information is lost.
 Every picture is made up of thousands of pixels and each
pixel has its color and these pixels in combination form the
image.
 That would mean each pixel requires 32 bits to represent a
pixel.
 The picture below shows an illustrative view of the
arrangement of pixels in a picture.
 The compression process can be broadly classified into two
sections
1. Latitudinal compression
2. Longitudinal compression
 To understand the compression process
in a better way let us take a segment of the
picture and implement the compression
process on that.
 The block(fig 1)shows a section of a picture with fig(1)
pixels arranged, each circle represents a pixel.
 In the latitudinal compression process, the block is first
divided into rows and processed separately.
 The processing involves taking the first pixel and comparing
them with the consecutive pixel.
 If the color of first pixel does not match with the second pixel,
both the pixels are retained.
 If both pixels tend to have the same color then the first pixel is
retained while the second pixel is eliminated or absorbed.
Original Block After Latitudinal Compression
 Single bit absorption table gives information regarding the
absorption pattern of the pixels.
 Absorbed pixels in the block are represented as “0” and the
unabsorbed pixels are represented as”1”.
 The size of the pixel is proportional to the size of the block.
 Thus we get the Single bit absorption table for latitudinal
compression.
 The pixel block after the latitudinal compression is taken and
is divided into columns and the compression process is carried
out vertically.
Size_before = (N * W)
Size_before = (25 * 24) =600

After the compression process,

Size_after = (Nr * W) + OH
Where,
OH = (2 * N) = (2 * 25) = 50.
Size_after = (12 * 24) + 50 = 338

 Thus, this yields a reduction of nearly 40% of the original size

of the block.
 The two tables are analyzed bit by bit; if the bit in both the
tables is “1” then the pixel is got from the “Resultant block”.
 The second condition is that when the bit in both the SBA
table is “0” then the pixel gets the color of the pixel on the left
in the recreation block.
 The third condition is encountered when the bit in the first
SBA table is “1” and the second table has the value as “0”.
 In such a case the pixel gets the color of the pixel above it in
the “Recreation table”.
 After every compression process the algorithm checks if the
criteria is satisfied which as given below
(Size_after + OH) < Size_before
 only If this criteria is satisfied the compression process carried
out.
 “Resultant block” can be further reduced by the same
compression process until the sand criteria is broken.
 Not only the pixel can be compressed but also the table can be
reduced the table which is in the binary format can be grouped
into “W” bits(24 bits) to form a colored pixel which can be
rearranged and then can be compressed to reduce the total over
head.
 The Sand algorithm is a promising idea waiting to be tapped
practically.
 The algorithm has extensive scope in various fields of research
and analysis.
 Though this algorithm cannot match the efficiency of other
lossy compression formats like (JPEG) .
 It would be an ideal choice in areas where quality of
information cannot be compensated for the cost.
 This algorithm will enable us to cut cost and increase the rate
of transmission of images with out any adverse effect on the
quality of the image.
Thank You!....