Image Compression through Data Representation in

Frequency Domain.
Elda CINA
1
,
1
Information echnology
Faculty,!Ale"sander #oisiu$,
%ni&ersity of Durres,
Durr's,Al(ania
email) elda.cina*uamd.edu.al
Esmerald A+IA,
1-
1
Information echnology
Faculty,!Ale"sander #oisiu$,
%ni&ersity of Durres,
Durr's,Al(ania
esmeraldaliai*yahoo.com
.a(i( .A#A#
-,/
Faculty of Engineering, %ni&ersity
of #oncton, Canada
/
0chool of Engineering, Canadian
Institute of echnology, Al(ania
.a(i(..amam*umoncton.ca
Abstract1 Data compression is a very important field these days.
You can find it in any web page, network devices, application files
etc. Its importance has grown during the years as a necessity of
storage and time of transportation. Images are one of the most
important data types to take in consideration. Because of the
large diversity of images in terms of both size and content, none
of the existing compression methods can be presented as
appropriate for all of them. s such it is always an open field for
discussions. In this paper we introduce a new way of compressing
images. !e propose a lossy techni"ue based on the method of
#Data $epresentation through combinations%, applied in the
fre"uency domain. !e use the Discrete cosine transform &D'()
and the indexing properties as key points for our techni"ue.
ccording to this techni"ue we enable not only compression but
also other security measures like cryptography, steganography
and watermarking.
Key words* Data compression, fre"uency, index, D'(,
information security.
I.
INR2D%CI2N
Image compression is a &ery discussed topic in
computer science and information processing. Ne3
technologies of cameras use (igger and (igger
resolution. As a consequence, compression is an
o(&ious need starting from human personal use to
3e( de&elopment.
4e can compress images o&er one of t3o types of
compression.
+ossless compression 3hich is important for
applications requiring precision such as
medical scanning, astronomy.
+ossy compression 3hich is 3idely used in
e&eryday life, for instance in 3e(
de&elopment.
he first type of compression is performed
according to a lo3 compression rate of around 567
or lo3er 819 and 3e o(tain the original image after
decompression as is 3ithout any alteration.
he second method gi&es high compression rate,
(y reducing redundancies, remo&ing duplication or
irrele&ancies, and omitting information 3hich 3ill
not (e noticed from the human &isual system
:.;0<.
In this paper 3e introduce a lossy compression
technique offering high compression rate 3ith small
losses.
+i"e ,=E> standard, the technique is (ased in the
domain of frequency using Discrete Cosine
ransform :DC< transform. his transform is
com(ined 3ith the data representation method,
3hich allo3s increasing the compression ratio
3ithout additional loss of data :precision<. he
interest of our method is that it does not ena(le only
compression, other security measures li"e
cryptography, steganography and 3atermar"ing are
intrinsic to this method and straightfor3ard..
II.
FRE?%ENC@ D2#AIN
4e usually transform an image from space domain
into frequency domain to decorrelate neigh(orhood
piAels. 2ne of the most used formats in frequency
domain compression is the ,=E> format8B9.
As it is a &ery a "no3n technique, 3e 3ill descri(e
here only the part 3ith 3hich 3e are concerned in
our method. According to ,=E> technique, (efore
performing compression, the image is di&ided in
CAC (loc"s, !le&el shifted$ (y 2
P1
and then
transformed from space domain to frequency using
the DC8-98/9, 3hich is the most popular frequency
transformation. %ntil no3 nothing from the
information is lost. he neAt step is uniform midD
tread quantiEation using a fiA 3ell studied sample.
he quantiEed coefficients are calculated as follo3s
F 6.5
ij
ij
ij
l
Q

+


:1<
4here ?iG is the :i,G<Dth element of the quantiEation
ta(le, and 8A9 is the round do3n integer of A.
he last step is the EigEag path. In our approach 3e
use in the opposite direction, from (ottomDright to
topDleft instead of from topDleft to (ottomDright.
2ther ,=E> algorithm steps are irrele&ant for us.
III.
DAA RE=RE0ENAI2N .R2%>.
C2#HINAI2N0 .E2R@
According to the data representation through
com(inations theory, e&ery signal can (e
represented (y an array of samples or its
corresponding indeA from the com(ination ta(le859.
his ta(le is (uilt from all possi(le com(inations of
images of siEe #AN piAels. Each piAel has a &alue
from 6 to +D1 :color le&el, for eAample gray le&el<.
+et us ta"e the eAample of images 3ith B piAels and
only / gray le&els :+F/<.As pointed out in a(le 1,
3e 3ill o(tain C1 possi(le com(inations :different
images<. o store them in a file 3e can use their
indeAes :the left column in a(le 1< as sho3 instead
of their real &alues.
(able +, All possible combinations for 1D images (signals)
with 4 pixels and gray le!els.
IndeA =iAel B =iAel / =iAel - =iAel 1
6 6 6 6 6
1 6 6 6 1
- 6 6 6 -
/ 6 6 1 6
B 6 6 1 1
5 6 6 1 -
. . . . .
. . . . .
C 6 6 - -
. . . . .
. . . . .
-I 1 6 6 6
. . . . .
. . . . .
5B - 6 6 6
. . . . .
. . . . .
IJ - - - 1
C6 - - - -
Depending on the content of the image, the
compression rate &aries from)
If 3e say that one of the gray &alues is repeated -
times, 3e get lo3er num(er of com(inations than
ta(le 1 :C1<. 4e can then calculate the num(er of
com(inations)
-
B -
B
: 1< :/ 1< -B K K
G
W H G
W H
L possible combinations
C C

= =
For more details you can refer to 859 and8L9.
he main pro(lem of this theory is the (ig num(ers
3e should use to represent the indeAes for large
images. 4ith this paper 3e propose a solution for
this pro(lem.
I;. =R2=20ED A==R2AC.
4e propose a ne3 technique 3hich is applied in
frequency domain. he num(er of indeAes increases
eAponentially 3ith the image siEe. he num(er
could (e &ery (ig e&en for small images, as such it
is almost impossi(le to 3or" 3ith them :unless 3e
use compleA data types 3hich spend a huge
processing time<.
4e propose to di&ide the image into (loc"s of CAC
piAels each to "eep in coherence 3ith the principle
of image compression8L9. 0o 3e do not ha&e only
one indeA (ut 3e ha&e as many indeAes as (loc"s
included in the specific image.
he flo3 diagram of Figure 1 gi&es a description on
the steps 3e are applying to implement
compression. It goes through these steps)
1. Di&ide in CAC (loc"s and for each (loc"
a. #a"e DC transform
(. ?uantiEe
c. In&erse MigEag
d. Remo&e Eeros from the left side of
the o(tained num(er
e. Find the indeA
-. Asem(le the indeAes and send the file
Hy the other hand at the recei&er or the
decompression process)
1. EAtract the com(ination from the indeAes
and for each com(ination
a. Add trailing Eeros
(. MigEag
c. #a"e in&erse DC transform
-. Re(uilt the full image
Figure 1. Encoding N Decoding =rocess
;. RE0%+0
A num(er of eAperiments ha&e (een carried out in
order to e&aluate the performance of the proposed
Algorithm. Different siEes and contents ha&e (een
tested. 4e ma"e a comparison 3ith a &ersion of
,=E> standard 3ith RunD+ength Encoding :R+E< to
gi&e a complete panorama of the ad&antages our
method offers.
-riginal Image $econstruction D'( with $./
0lower
1eppers
.ena
.ittle 2irl
Baboon
"ig#re 2. Image Tests
In a(le - are sho3n the results of the a(o&e image
tests, 3here 'r stands for Compression rate, $34
for Root #ean Error,
145$ for =ea" 0ignal to Noise Ratio, and 44I3
for 0tructural 0imilarity IndeA.
-riginal $econstruction D'( with $./ $econstruction 6 D'(
0
l
o
w
e
r
CrF 1)1
R#0F6
=0NRFInf
00I# indeAF1
CrF J.1
R#0F 5.-I1
=0NRF//.LJB dH
00I# indeAF6.JL6/
CrF -.-)1
R#0F5.-I1
=0NRF//.LJB dH
00I# indeAF6.JL6/
B.1B
1
e
p
e
r
s
CrF 1)1
R#0F6
=0NRFInf
00I# indeAF1
CrF I.J
R#0F 5./5-
=0NRF//.5L1 dH
00I# indeAF 6.JB6/
CrF 1.L
R#0F 5./5-
=0NRF//.5L1 dH
00I# indeAF 6.JB6/
B.JB
.
e
n
a
CrF 1)1
R#0F6
=0NRFInf
00I# indeAF1
CrF C.I)1
R#0F5.1IJ
=0NRF //.CB5 D(
00I# indeAF 6.J/IB
CrF 1.I)1
R#0F5.1IJ
=0NRF //.CB5 dH
00I# indeAF6.J/IB
5.1-
.
i
t
t
l
e

g
i
r
l
CrF 1)1
R#0F6
=0NRFInf
00I# indeAF1
CrF J.5)1
R#0F/.6B6
=0NRF/C.5L- dH
00I# indeAF 6.J5-I
CrF -.-)1
R#0F/.6B6
=0NRF/C.5L- dH
00I# indeAF6.J5-I
B./-
B
a
b
o
o
n
CrF 1)1
R#0F6
=0NRFInf
00I# indeAF1
CrF I.1)1
R#0FJ.L6I
=0NRF-C.BIJ dH
00I# indeAF6.CI/5
CrF1.-)1
R#0F J.L6I
=0NR F -C.BIJ dH
00I# indeA F 6.CI/5
5.J-
a(le -. Compression ratios of our technique compared to those offered (y DC using R+E
As clearly pointed out in a(le -, our technique
gi&es higher compression rates, generally at least B
times higher than the DC 3ith R+E. his is &alid
for the first le&el of compression. According to the
need of users 3e can go further on o(taining higher
compression rates (ut 3ith larger error.
Furthermore, 3e ha&e used another approach to
o(tain higher compression rates. After applying the
DC and MigEag path 3e o(tain Eeros at the
(eginning of the &ector. 4e should remo&e them. In
addition to remo&ing only trailing Eeros 3e can
remo&e more relati&ely lo3 &alues. In this case 3e
o(tain a higher compression rate (ut 3ith some loss
of data. Hy applying the trial and error method, 3e
concluded that the optimal situation consists in
lea&ing only 1L DC coefficients for indeAing,
3hich results in a compression rate of 1-.C)1. his
is &alid for image no matter ho3 large it is. he
highest compression rate could (e 1L)1, if 3e
analyEe only C DC coefficients (ut errors are
noticea(le (y na"ed eye. .o3e&er, it is up to userOs
need in terms of image quality or compression rate
to choose 3hich is the most appropriate for them.
;I. C2NC+%0I2N0)
4ith this paper, 3e introduced a ne3 technique of
image compression in the frequency domain. 4e
ha&e applied some of the ,=E> features and
com(ined them 3ith the method of representation
data through com(inations. 4e proposed t3o ideas.
he first one gi&es the same output as DC 3ith
R+E (ut 3ith higher compression rates :at least B
times higher<. he second idea consists in an image
independent technique, 3hich offers al3ays a fiAed
compression rate depending only on the num(er of
DC coefficients to ta"e. 4e suggest that the most
appropriate num(er of coefficient is 1L 3hich lead
into a compression rate of 1-.C)1.
%sing our technique com(ined 3ith other features
of ,=E> or ,=E>-666 3ill (e the su(Gect for future
3or". Another a&enue consists in eAtending our
technique to3ards security issues li"e cryptography,
steganography and 3atermar"ing.
;II.
REFERENCE0
819 Da&id 0alomon, Data compression D he
Complete Reference, Bth Edition. 0pringer
-66I, I0HN JICD1DCBL-CDL6-D5
8-9 N. Ahmed, . NataraGan and P. R. Rao,
QDiscrete Cosine ransform,Q IEEEE rans.
Computers, J6DJ/, ,an. 1JIB..
8/9 P. R. Rao and =. @ip, Discrete Cosine
ransform) Algorithms, Ad&antages,
Applications :Academic =ress, Hoston,
1JJ6<
8B9 ,.#iano, QCompressed Image File Formats)
,=E>, =N>, >IF, RH#, H#=Q
AdisonD4eley S 1JJJ S I0HN) 6-61L6BB/B
859 .. .amam !A ne3 representation of data
through com(inations$, IEEE, ICCA -61/
8L9 A Ne3 Representation of Image hrough
Num(ering =iAel Com(inations$,. 0aid, R.
0ouissi, .. .amam pg. BL Journalof
Information Security Researc ;olume B
Num(er 1 #arch -61/
8I9 DataKCompressionKheKCompleteKReferen
ceKFourthKEditionKDa&idK0alomonK>K#ot
taKDKHryant
8C9 Digital Image =rocessing %sing #A+AH
(y Rafael C.>onEaleE,RichardE.4oodsT
0te&en +.Eddins