�ݺ�ߣ

EINSTEIN’S IMAGE COMPRESSION
ALGORITHM
By
Aanchal Kumari(Final ECE),
Guided by
Mrs. K.V. Archana AP/ECE
School Of Engineering
Avinashilingam Institute for Home Science and Higher
Education for Women, Coimbatore.1

Introduction:
 The Einstein’s compression technique is a new method of compression
and decompression of images by matrix addition and the possible
sequence of the sum.
 The main purpose of implementing a new algorithm is to reduce the
complexity of algorithms used for image compression.
 The major advantage of this technique is that the compression is
highly secure and highly compressed.
 This method of compression is a raster compression.
 This method can be used for astronomical images and medical images
because the image compression is considered to be lossless
2

Procedure
 The image is gained as an input preferably black.
 The value of colour will range from 0 to 255 as 0 is completely blank and
255 full.
 The image is processed in to the system and is converted in table of rows
and columns of pixels preferably .jpg or .bmp.
 The input image will be in the form of Fig 1 and converted values will
something be like Fig 2
 The image may be of any number of rows and columns .
 Rows=Columns (vice versa).
 The example taken have a matrix of 255 x 255.
3

Calculation of Rows and Columns
 A counter will be assigned to calculate the number of rows and
will be stored in a variable as ρ
 Another counter will be assigned to calculate the number of
columns and will be stored in a variable as χ
 ρ is nothing but the number of cells in each column and χ is
the
number of cells in each row
 According to the example the pattern will be: ρ = χ
Compression
4

The Database
 A database of all the possible sum is created.
 Example image is 255 x 255 ,which when processed will have
[1 × (255 × 255)]
 The maximum possible values in black and white image is 255
 So the maximum possible sum of the matrix is 16581375.
 The database is created for the values ranging from sum of all the
columns ranging from 0 to 16581375. For every possible value there is
number of possible values i.e. according to permutations for sum
 σ and µ columns in the row matrix we get ν combinations
i.e. ν = σ + (µ - 1) c (µ + 1)
5

An extra column is added in the table for generating sequence number Λ. The
table is stored in ascending order considering as digits.
Similarly, a database of all the possible values is generated. The database is
found to be so important that it is even required for decompression also.
6

The Second Step
 The second step involves the conversion of [ρ × χ] image into
[1 × (χρ)].
 On the first stage of conversion the image is cut into each row
matrices so that we get ρ[1 × χ].
 Then the row matrices formed is lined one after the other to form a
[1 ×(χρ)] row matrix
Adding for σ and Generation of Sequence Λ:
 The row matrix is generated.
 The values of the cells in the rows are added and are stored in σ.
 This forms a new cell in the compressed image
 The next cell in the compressed image comprises of the sequence
number Λ. This number is generated by some random search
algorithm referring to the table created as database and the original
image.
7

Extra cells
 Some extra cells like τ which refers to the type of image compressed;
the extensions of the uncompressed images are converted and stored
as ASCII values.
 Two cells containing the counter values like ρ and χ, and an extra cell
number of colours or the layers present in the cell i.e. 1 denote black
and white image and 3 denotes RGB.
 The output image for a black and white image will be in the form of
σ =sum of matrix cells
Λ = sequence generated for the sum
τ =Type of image
ρ =Number of rows in the original matrix
χ =Number or columns in the original matrix
α =Number of colors in the image
8

Simplicity of matrix addition is the major advantage of
the Einstein’s image compression algorithm. The
images compressed can be stored in the database with
less space.
9
Conclusion

10
Reference
[1] Yasser Arafat, Mohammed Mustaq, Mohammed Mothi – Trends
in Information Management (TRIM) 7 – 2012.

�ݺ�ߣ

Einsteins Image Compression Algorithm

More Related Content

Einsteins Image Compression Algorithm