See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/271198521

Watermarking Digital Images Using Fuzzy Matrix Compositions and (α,β) -

Cut of Fuzzy Set

Article · December 2014

CITATIONS READS

4 296

1 author:

Sharbani Bhattacharya
IEC Group of Institutions
27 PUBLICATIONS   40 CITATIONS   

SEE PROFILE

All content following this page was uploaded by Sharbani Bhattacharya on 22 January 2015.

The user has requested enhancement of the downloaded file.

 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2 1552

Watermarking Digital Images Using Fuzzy Matrix

Compositions and (α, β) - Cut of Fuzzy Set
Sharbani Bhattacharya
IEC College of Engineering Technology,
Greater Noida , India
Email:b_sharbani@yahoo.com
ABSTRACT
digital image. The hash function generates hash code and
Watermarking in digital images is for authentication and hash file of text file using public keys. The hash code is
restricting it for unauthorized usages. Videos and other embedded in image. Hash file and private keys are with
digital contents are used often by unauthorized users. authorized party who can decode the extracted watermark.
Fuzzy Compliment-Min-Min Matrix, Fuzzy Compliment-
Max-Max Matrix, Fuzzy Compliment-Product-Product, 2. FUZZY MATRIX COMPOSITIONS
Fuzzy Compliment-Sum-Max Matrix, Fuzzy Compliment-
The fuzzy rules are consisting of rules defined on fuzzy set.
Sum-Min Matrix are fuzzy matrix compositions proposed
fuzzy set are acquired from crisp set using membership
in this paper. These are used as public- private key for
function. This process is known as fuzzification.
generating hash code and then hash code is embedded as
Converting fuzzy set to Crisp set is called defuzzification.
watermark in digital images. For embedding watermark
The fuzzy set has values from 0 to 1. Let us take a crisp set
fuzzy matrices composition of the two fuzzy matrices and
A have three elements A= {truck, bus, bike, car}. Let us
its fuzzy neighbourhood sets are used. The hash function
define a membership function of vehicle with heavy
generates hash code and hash file of text file using (α,β)
weight vehicle. We define a fuzzy set of Heavy Vehicle
cut of fuzzy set.
Ã= {0.9/Volvo, 0.8/truck, 0.5/car, 0.7/bus}. This means
Keywords-(α,β) cut of fuzzy set, Watermark, Hash Code, say truck has membership 0.8 in Heavy Vehicle, bus has
Hash file, Hash Table. 0.7 and so on.

1. INTRODUCTION This is called fuzzification. Converting fuzzy set to crisp

Watermarking in digital images is for authentication and
restricting it for unauthorized usages. Videos and other
digital contents are used often by unauthorized users.
Videos and images are watermarked visibly or invisibly.
Watermarking and fingerprinting are used to find the point
of leakage or user who allowed unauthorized use of the
digital content. Watermarks are used in images of natural
calamity and disaster management where picture can
create panic in people. An image can show that tsunami is
coming and people should vacate the place soon. There
can be notorious person who can create a chaos when no
such natural calamity is happening. The watermarking can
be visible or invisible. Visible watermarking is used for
authentication whereas invisible watermarking is used for
unauthorized usages. The robustness of watermark is its
tolerance for distortion or removal. It should be identified
and extracted to receive information by authorized party.
The amount of embedding of information in a digital
content without getting identified is its capacity.
Watermarking is sometimes invisible and can be extracted
only by authenticated party. Here, we proposed five fuzzy
matrix compositions i.e. Fuzzy Compliment-Min-Min
Matrix, Fuzzy Compliment-Max-Max Matrix, Fuzzy
Compliment-Product-Product, Fuzzy Compliment-Sum-
Max Matrix and Fuzzy Compliment-Sum-Min Matrix.
These are used as public- private key for generating hash
code and then embedding it as watermark in digital images.
For embedding fuzzy matrices composition of the two
fuzzy matrices and its fuzzy neighbourhood sets are used.
There is further work done on embedding a hash code in
set is called defuzzificaion. Next step is fuzzy matrices.
Fuzzy matrices have various compositions. Like two fuzzy
matrices gives fuzzy matrix using composition like Max-
Min, Max-Product, Min-Max, Product-Max and many
more. These are Fuzzy matrix obtained from using Max-
Product composition is called Max-Product matrix. There
are many more compositions for fuzzy matrix. This paper
proposes five fuzzy matrix compositions and presents two
more which are published in other papers.
2.1 Fuzzy Compliment-Min-Min Matrix
Composition
This is proposed rule in this paper
µA,B(x1,y1)=0.2 µB,C (y1,z1)=0.2
µA,B (x1,y2)=0.2 µB,C (y1,z2)=0.5
µA,B (x2,y1)=0.3 µB,C (y2,z1)=0.1
µA,B (x2,y2)=0.1 µB,C (y2,z2)=0.6
The matrix of µA,C is
µA,C (x1,z1)=| 1-Min{ Min(µA,B(x1,y1) ,µB,C (y1,z1)),Min
( µA,B (x1,y2) ,µB,C (y2,z1))}|=0.9
µA,C (x1,z2)= |1-MIn{ Min(µA,B(x1,y1) , µB,C (y1,z2)),
Min(µA,B (x1,y2) , µB,C (y2,z2))}|=0.8
µA,C (x2,z1)=|1-Min{Min(µA,B (x2,y1),µB,C
(y1,z1)),Min(µA,B (x2,y2) , µB,C (y2,z1))}|=0.9
µA,C (x2,z2)= |1-Min{Min(µA,B (x2,y1), µB,C (y1,z2),
Min( µA,B (x2,y2), µB,C (y2,z2))|=0.9

© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|

*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2 1553

2.2 Fuzzy Compliment-Max-Max Matrix µA,C (x2,z2)= |1-{Max(µA,B (x2,y1), µB,C

Composition (y1,z2) )+Max( µA,B (x2,y2), µB,C (y2,z2))|=0.1

This is proposed rule in this paper 2.5. Fuzzy Compliment-Sum-Max Matrix

Composition
µA,B(x1,y1)=0.2 µB,C (y1,z1)=0.2
µA,B (x1,y2)=0.2 µB,C (y1,z2)=0.5 This is proposed rule in this paper
µA,B (x2,y1)=0.3 µB,C (y2,z1)=0.1
µA,B(x1,y1)=0.2 µB,C (y1,z1)=0.2
µA,B (x2,y2)=0.1 µB,C (y2,z2)=0.6
µA,B (x1,y2)=0.2 µB,C (y1,z2)=0.5
The matrix of µA,C is µA,B (x2,y1)=0.3 µB,C (y2,z1)=0.1
µA,B (x2,y2)=0.1 µB,C (y2,z2)=0.6
µA,C (x1,z1)=| 1-Max{ Max(µA,B(x1,y1) ,µB,C (y1,z1)),Max
( µA,B (x1,y2) ,µB,C (y2,z1))}|=0.8 The matrix of µA,C is
µA,C (x1,z2)= |1-Max{ Max(µA,B(x1,y1) , µB,C (y1,z2)), µA,C (x1,z1)=| 1-{ Min(µA,B(x1,y1) ,µB,C (y1,z1)) +
Max(µA,B (x1,y2) , µB,C (y2,z2))}|=0.4 Min( µA,B (x1,y2) , µB,C (y2,z1))}|=0.7
µA,C (x2,z1)=|1-Max{Max(µA,B (x2,y1),µB,C µA,C (x1,z2)= |1-{Min(µA,B(x1,y1) , µB,C (y1,z2)) +Min
(y1,z1)),Max(µA,B (x2,y2) , µB,C (y2,z1))}|=0.7 (µA,B (x1,y2) , µB,C (y2,z2))}|=0.6
µA,C (x2,z2)= |1-Max{Max(µA,B (x2,y1), µB,C (y1,z2)), µA,C (x2,z1)=|1-{Min(µA,B (x2,y1), µB,C (y1,z1)) +Min
Max( µA,B (x2,y2), µB,C (y2,z2))|=0.4 (µA,B (x2,y2) , µB,C (y2,z1))}|=0.7
2.3. Fuzzy Compliment-Product-Min Matrix µA,C (x2,z2)= |1-{Min(µA,B (x2,y1), µB,C (y1,z2)
Composition +Min( µA,B (x2,y2), µB,C (y2,z2))}|=0.6

This is proposed rule in this paper 2.6. Fuzzy Compliment-Sum-Min Matrix

Composition
µA,B(x1,y1)=0.2 µB,C (y1,z1)=0.2
µA,B (x1,y2)=0.2 µB,C (y1,z2)=0.5 Another published rule is Fuzzy Compliment-Min-Product
µA,B (x2,y1)=0.3 µB,C (y2,z1)=0.1 Matrix rule[63]
µA,B (x2,y2)=0.1 µB,C (y2,z2)=0.6
µA,B(x1,y1)=0.2 µB,C (y1,z1)=0.2
The matrix of µA,C is µA,B (x1,y2)=0.2 µB,C (y1,z2)=0.5
µA,B (x2,y1)=0.3 µB,C (y2,z1)=0.1
µA,C (x1,z1)=| 1-{ (µA,B(x1,y1) *µB,C (y1,z1)) * ( µA,B
µA,B (x2,y2)=0.1 µB,C (y2,z2)=0.6
(x1,y2) * µB,C (y2,z1))}|=0.9992
The matrix of µA,C is
µA,C (x1,z2)= |1-{(µA,B(x1,y1) * µB,C (y1,z2)) * (µA,B
µA,C (x1,z1)= 1-[Min{ (µA,B(x1,y1) *µB,C (y1,z1)), ( µA,B
(x1,y2) * µB,C (y2,z2))}|=0.9988
(x1,y2) *µB,C (y2,z1))}]=0.96
µA,C (x2,z1)=|1-{(µA,B (x2,y1)* µB,C (y1,z1)) * (µA,B (x2,y2) µA,C (x1,z2)= 1-[Min{ (µA,B(x1,y1) * µB,C (y1,z2)), (µA,B
* µB,C (y2,z1))}|=0.9994 (x1,y2) * µB,C (y2,z2))}]=0.88
µA,C (x2,z2)= |1-{(µA,B (x2,y1)* µB,C (y1,z2)) *( µA,B µA,C (x2,z1)=1-[Min{(µA,B (x2,y1)*µB,C (y1,z1)),(µA,B
(x2,y2)* µB,C (y2,z2))|=0.991 (x2,y2) * µB,C (y2,z1))}]=0.91
2.4. Fuzzy Compliment-Product-Product µA,C (x2,z2)= 1-[Min{(µA,B (x2,y1)* µB,C (y1,z2)),( µA,B
Matrix Composition (x2,y2)* µB,C (y2,z2))}]=0.94

This is proposed rule in this paper 2.7. Fuzzy Compliment-Max-Min Matrix

Composition
µA,B(x1,y1)=0.2 µB,C (y1,z1)=0.2
µA,B (x1,y2)=0.2 µB,C (y1,z2)=0.5 Another published rule is Fuzzy Compliment-Max-Min
µA,B (x2,y1)=0.3 µB,C (y2,z1)=0.1 Matrix rule[62]
µA,B (x2,y2)=0.1 µB,C (y2,z2)=0.6
Let us say,
The matrix of µA,C is
µA,B(x1,y1)=0.2 µB,C (y1,z1)=0.2
µA,C (x1,z1)=| 1-{ Max(µA,B(x1,y1) ,µB,C (y1,z1)) + µA,B (x1,y2)=0.2 µB,C (y1,z2)=0.5
Max( µA,B (x1,y2) , µB,C (y2,z1))}|=0.6 µA,B (x2,y1)=0.3 µB,C (y2,z1)=0.1
µA,B (x2,y2)=0.1 µB,C (y2,z2)=0.6
µA,C (x1,z2)= |1-{Max(µA,B(x1,y1) , µB,C (y1,z2)) +Max
(µA,B (x1,y2) , µB,C (y2,z2))}|=0.1 The matrix of µA,C is
µA,C (x2,z1)=|1-{Max(µA,B (x2,y1), µB,C (y1,z1)) +Max µA,C (x1,z1)=1- max[min{ µA,B(x1,y1) ,µB,C (y1,z1)},
(µA,B (x2,y2) , µB,C (y2,z1))}|=0.6 min{ µA,B (x1,y2) , µB,C (y2,z1) }]=0.8

© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|

*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2 1554

µA,C (x1,z2)=1- max[min{ µA,B(x1,y1) ,µB,C (y1,z2) }, P21={0.8,0.91,0.9}

min{ µA,B (x1,y2) , µB,C (y2,z2)}]=0.8 P22={0.8,0.9,0.94}
µA,C (x2,z1)=1- max[min{ µA,B (x2,y1) , µB,C (y1,z1)}, 5. HASH FILE AND HASH CODE
min{ µA,B (x2,y2) , µB,C (y2,z1)}]=0.8
The hash functions is created which takes argument as text
µA,C (x2,z2)=1- max[min{ µA,B (x2,y1) ,µB,C (y1,z2)}, file and fuzzy set and return hash code and hash file. Hash
min{µA,B (x2,y2) , µB,C (y2,z2)}]=0.8 file consists of definition of the text file and hash code is
code value. This code value is to be embedded in digital
3. PUBLIC KEY- PRIVATE KEY USED FOR content. The authorized party has hash file and private key
WATERMARKING i.e. fuzzy set values. For authentication of copyright, the
The public key –private key is used for encryption. Public hash code can be extracted from digital image. Using hash
key is the key with which the text or file is encrypted is code, hash file and private key the original text file can be
available freely and only authorized party has the private obtained. Here, P21={0.8,0.91,0.9} fuzzy set is used for
key by which the file can be decrypted. The paper presents argument of hash function and text file in fig1. and Table1
public key-private key method embedding and extracting is hash table.
watermark. User will give a fuzzy matrix and randomly Steps to make Hash file, Hash table and Hash code. See
one fuzzy matrix will be from system. Using the Table 1.
composition and two matrices a new fuzzy matrix is
obtained. User fuzzy matrix is public key. Then, extraction Step1: Arrange the each character of text and its position
of watermark is done with private key. To increase the in the file in hash table in K1 and K2.
complexity we have few more method like using Step2: Get its ASCII code and enter into the hash table in
neighbourhood sets for embedding watermark. There are K3.
further step to make situation more complex i.e. one public
key is chosen two or more fuzzy matrix composition are Step3: Divide the characters into groups of elements α
chosen and two or more new fuzzy matrix is obtained. =0.8 and β =0.91 which in (α, β) cut of fuzzy set.
From these fuzzy matrices (α, β) cut of fuzzy set are Step4: Multiply α and β set value to groups and enter into
generated. Using (α, β) cut of fuzzy set embedding of hash table in K4.
watermark is done. The private key here is α and β.
Step5: Get mean of each group and subtract the mean from
4.ALPHA BETACUT OF FUZZYSET each ASCII value of character and enter into hash table K5.
We define here (α,β) cut of fuzzy set for any intuitionistic Step6: Create Hash code using the mean and hash file with
fuzzy set A = { < x , µA(x) , νA (x) > : x ε X} of a set X , position and subtracted value from ASCII value of each
the crisp subset Cα,β(A) = {x εX : µA (x) ≥ α, νA(x) ≤β} of character (K5,K2).
X called the (α, β) – cut of fuzzy set.[61]
Here , we define α and β such that 0< α<β<1 in fuzzy set.
Let A be a fuzzy set A={0.1/x ,0.4/y ,0.56/z ,0.7/t ,0.3/s}.
Let us define α=0.4 and β=0.6. Then, our (α,β) cut of
fuzzy set of A is Aα-β ={0.4/y ,0.56/z}. Let us define Q11
is fuzzy set of matrix elements of µA,C(x1,z1) from above
five Fuzzy matrix obtained from five compositions Fuzzy
Compliment-Min-Min Matrix, Fuzzy Compliment-Max-
Max Matrix, Fuzzy Compliment-Product-Product, Fuzzy
Compliment-Sum-Max Matrix , Fuzzy Compliment-Sum-
Min Matrix and Fuzzy Compliment-Min-Product Matrix.
Similarly, we get Q12, Q21, Q22 are fuzzy set of matrix
elements of µA,C (x1,z2) , µA,C (x2,z1) and µA,C (x2,z2).
Matrices are as follows
Q11={0.9,0.8,0.9992,0.6,0.7,0.96,0.8}
Q12={0.8,0.4,0.9,988,0.1,0.6, 0.88,0.8}
Q21={0.9,0.7,0.9994,0.6,0.7,0.91,0.8}
Q22={0.9,0.4,0.1,0.991,0.1,0.6,0.94,0.8}
( α,β) cut of fuzzy set of Q11 is P11, Q12 is P12, Q21 is
P21 and Q22 is P22 where α is 0.8 and β is 0.96 fuzzy set
P11={,0.8,0.9,0.96}
P12={0.8,0.88} Figure1 Original Text file to be inserted in digital image

© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|

*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2
Figure 2 Hash code generated from hash function
R={0.8, total=574.9, meanR=82.12}
S={0.91,total=686.14, meanS=85.77}
Hash File= [K5,position]
Hash Code= meanR@meanS i.e. “RFF@UM”
5(a)
Figure 3 Hash file generated from hash function.
6. EMBEDDING WATERMARK
Embedding the watermark using (α,β) cut of fuzzy set and
public key-private key method. The algorithm to embed
watermark is as follows
Step1: Choose the (α,β) cut of fuzzy set for embedding.
Step2: Get the appropriate value for insertion in image file
with (α,β) cut of fuzzy set.
Step3: Embedding the hash code in either of elements of
(α,β) cut of fuzzy set or in all points of set.
Figure 4(a) 4(b) 4(c) 4(d)
4(a) Original baboon.jpg 4(b)watermark at P21 =0.8 4(c)
watermark atP21=0.91 4(d) watermark atP21=(0.8,0.91)
© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|
*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
1555
Peak Signal to Noise Ratio(PSNR) between original image
and watermarked image is given by
PSNR =10 log10(X2max /MSE) (1)
Where Xmax : is maximum luminance. B bit per sample has
Xmax equal to 2B-1.
MSE is mean-square-error between original image and
watermarked image
∑ ∑ – (2)
Where N X M is pixels of original image I and
watermarked Image J.
The PSNR is important criteria for measuring the quality
of original and watermark image. In fact, we see in some
cases we are getting PSNR value almost zero i.e. there is
no difference in quality at peak values. In most cases
PSNR ratio is between 30-50 dB which shows moderate
value for image quality difference in original and
watermarking image.
Figure 5(a) 5(b) 5(c) 5(d)
Original lena.jpg 5(b)watermark at P21 =0.8 5(c) watermark
atP21=0.91 5(d) watermark atP21=(0.8,0.91)
Figure 6(a) 6(b) 6(c) 6(d)
6(a) Original Peppers.jpg 6(b)watermark at P21 =0.8 6(c)
watermark atP21=0.91 6(d) watermark atP21=(0.8,0.91)
Figure 7(a) 7(b) 7(c) 7(d)
7(a) Original sing.jpg 7(b)watermark at P21 =0.8 7(c)
watermark atP21=0.91 7(d) watermark atP21=(0.8,0.91)
7. CONCLUSION
If the watermarking text is big it can be detected in image.
It comes in image definition area. Watermarking text file
can be 30 Kb to any length. In order to make file
watermark in 5-6 bytes we have defined hash function
which produces hash code of 5-6 bytes and hash file
containing definition. Using hash file, hash code and
private key we get original text. Peak Signal to Noise
Ratio(PSNR) between original image and watermarked
image is given by eq(1).The PSNR is important criteria for
measuring the quality of original and watermark image. In
fact, we see in some cases we are getting PSNR value
almost zero i.e. there is no difference in quality at peak
values. In most cases PSNR ratio is between 30-50 dB
which shows moderate value for image quality difference
 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2 1556

in original and watermarking image. Using hash code and this method is resistant to geometric attacks, noise attacks
hash file for watermarking can be used in videos where and compression attacks it desirable to be added in videos
each image is watermarked and then compressed. Since, and films as watermark.
Table 1Hash Table
Character K1 Positions K2 ASCII Code K3 K4 Hash value K5
R=0.8 K3=(meanA+K5)/0.8 K4=K3 * 0.8 K5=K4-meanR
D 1 068 54.4 -27.72
o 2,5 111 88.5 6.38
n 4,22 110 88 5.88
t 6,9,14,19,25 116 92.8 10.68
e 8,24 101 80.8 -1.32
c 10 099 79.2 -2.92
r 11,23 114 91.2 9.08
S= 0.91 K3=(meanB+K5)/0.91 K4 =K3 * 0.91 K5=K4-meanS
y 12 121 110.11 24.34
p 13 112 101.92 15.43
j 16 106 96.46 10.69
u 17 117 106.47 20.7
s 18,23 115 104.65 18.88
i 21 105 95.55 9.78
blank 3,7,15,20 32 29.12 -56.65
. 26 46 41.86 -43.91

Table 2 PSNR Between Original and Watermarked Image

S.No. Original Image Watermarked Image PSNR Value of
original and
watermarked image
1 Sign.jpg Sign.jpg watermarked at P21={0.8} 30.64
2 Sign.jpg Sign.jpg watermarked at P21={0.91} 35.12
3 Sign.jpg Sign.jpg watermarked at P21={0.8,091} 32.56
4 Peppers.jpg Peppers.jpg watermarked at P21={0.8} 0
5 Peppers.jpg Peppers.jpg watermarked at P21={0.91} 40.34
6 Peppers.jpg Peppers.jpg watermarked at P21={0.8,091} 40.34
7 Lena.jpg Lena.jpg watermarked at P21={0.8} 33.98
8 Lena.jpg Lena.jpg watermarked at P21={0.91} 0
9 Lena.jpg Lena.jpg watermarked at P21={0.8,091} 45.12
10 Baboon.jpg Baboon.jpg watermarked at P21={0.8} 0
11 Baboon.jpg Baboon.jpg watermarked at P21={0.91} 0
12 Baboon.jpg Baboon.jpg watermarked at P21={0.8,091} 0

FUTURE SCOPE OF WORK [3] Alimohammad Latif,(2013), “ An Adaptive Digital

The present paper is using text file for watermark. So, the
hash function is for generating hash code for text file.
Future scope of work is generating hash code and hash file
for image file.
[4]
REFERENCES
[1] Qian Ying , Ren Xue-mei, Huang Ying, Meng
Li,(2014) “ Image Sharpness Metric Based on
Algebraic Multi- Grid Method”, (IJACSA)
International Journal of Advanced Computer
Science and Applications, Vol. 5, No. 4, April.
[5]
[2] Elzbieta Zielinska, Wojciech Mazurczyk,Krzysztof
Szczypiorski, (2014),“Trends in Steganography”,
Communication of ACM, March , Vol 57 ,No. 3.
Image Watermarking Scheme using Fuzzy Logic
and Tabu Search”, Journal of Information Hiding
and Multimedia Signal Processing, Volume 4,
Number 4, October.
Mriganka Gogoi ,H.M.Khalid Raihan Bhuyan
,Koushik Mahanta ,Dibya Jyoti Das ,Ankita Dutta,
(2013) “ Image and Video based double watermark
extraction spread spectrum watermarking in low
variance region”, (IJACSA) International Journal of
Advanced Computer Science and Applications,
Vol. 4, No. 6.
T.Sridevi ,S Sameena Fatima, (2013)“Digital Image
Watermarking using Fuzzy Logic approach based
on DWT and SVD”, International Journal of

© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|

*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2
Computer Applications (0975 – 8887) Volume 74–
No.13, July .
[6] Chuntao WangJiangqun Ni,and Jiwu, (2012), “An
Informed Watermarking Scheme Using Hidden
Markov Model in the Wavelet Domain”
Huang,Page853, IEEE Transactions On
Information Forensics And Security, Vol. 7, No. 3,
June.
[7] Anderson Rocha, Walter Scheirer and Terrance
Boult, Siome Goldenstein, (2011),“Vision of the
Unseen: Current Trends and Challenges in Digital
Image and Video Forensics” ACM Computing
Surveys, Vol. 43, No. 4, Article 26, Publication
date: October .
[8] Manjit Thapa ,Dr. Sandeep Kumar Sood ,A.P
Meenakshi Sharma, (2011),“Digital Image
Watermarking Technique Based on Different
Attacks”, (IJACSA) International Journal of
Advanced Computer Science and Applications,
Vol. 2, No. 4.
[9] Jen-Sheng Tsai, Win-Bin Huang, and Yau-Hwang
Kuo,(2011), “On the Selection of Optimal Feature
Region Set for Robust Digital Image
Watermarking” , page 735, IEEE Transactions On
Image Processing, Vol. 20, No. 3, March.
[10] Mohammad Ali Akhaee,Sayed Mohammad
Ebrahim Sahraeian, and Craig Jin,(2011), “Blind
Image Watermarking Using a Sample Projection
Approach” Page 883, IEEE Transactions On
Information Forensics And Security, Vol. 6, No. 3,
September.
[11] G. Fahmy,M. F. Fahmy and U. S.Mohammed,
(2010),Research Article “Nonblind and Quasiblind
Natural PreserveTransformWatermarking”Hindawi
Publishing Corporation EURASIP Journal on
Advances in Signal Processing,Vol, Article ID
452548, 13 pages doi:10.1155/2010/452548.
[12] Roberto Caldelli, Francesco Filippini, and Rudy
Becarelli,(2010) Review Article “Reversible
Watermarking Techniques:An Overview and a
Classification” , Hindawi Publishing Corporation
EURASIP Journal on Information Security ,Vol ,
Article ID 134546, 19 pages
,doi:10.1155/2010/134546.
[13] Sameh Oueslati and Adnane Cherif and Bassel
Solaiman, (2010),“Maximizing Strength of Digital
Watermarks Using Fuzzy Logic”, Signal & Image
Processing : An International Journal(SIPIJ) Vol.1,
No.2, December .
[14] Pankaj U.Lande ,Sanjay N. Talbar ,G.N. Shinde,
(2010),“Robust Image Adaptive Watermarking
Using Fuzzy Logic An FPGA Approach”,
International Journal of Signal Processing, Image
Processing and Pattern Recognition ,Vol. 3, No. 4,
December.
© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|
*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
1557
[15] Sameh Oueslati, Adnane Cherif & Basel Solaiman,
(2010), “A Fuzzy Watermarking Approach Based
on the Human Visual System”, page 218,
International Journal Of Image Processing (IJIP),
Vol (4): Issue (3).
[16] Anandabrata Pal and Nasir Memon, (2009),
“Evolution of File Carving”, ,Page 59, IEEE Signal
Processing Magazine,March .
[17] Chun-Hsiang Huang,Shang-Chih Chuang, Yen-Lin
Huang, and Ja-Ling Wu,(2009),“Unseen Visible
Watermarking: A Novel Methodology for Auxiliary
Information Delivery via Visual Contents”,
Page193, IEEE Transactions On Information
Forensics And Security, Vol. 4, No. 2, June.
[18] Alain Tr ´emeau,Shoji Tominaga and Konstantinos
N. Plataniotis, (2008),Review Article “Color in
Image and Video Processing: Most Recent
Trendsand Future Research Directions”, Hindawi
Publishing Corporation EURASIP Journal on
Image and Video Processing Volume Article ID
581371, 26 pages ,doi:10.1155/2008/581371.
[19] S. P. Mohanty, O. B. Adamo, and E. Kougianos,
(2007),"VLSI Architecture of an Invisible
Watermarking Unit for a Biometric-Based Security
System in a Digital Camera", in Proceedings of the
25th IEEE International Conference on Consumer
Electronics (ICCE), pp. 485-486.
[20] Dong Zheng, Yan Liu, Jiying Zhao, And
Abdulmotaleb El Saddik, (2007),“A Survey of RST
Invariant Image Watermarking
Algorithms”,University of Ottawa, ACM
Computing Surveys, Vol. 39, No. 2, Article 5,
Publication date: June.
[21] Franco Frattolillo, (2007), “Watermarking Protocol
for Web Context” ,Page 350, IEEE Transactions On
Information Forensics And Security, Vol. 2, No. 3,
September .
[22] David J. Coumou, Athimoottil Mathew,“A Fuzzy
Logic Approach To Digital Image Watermarking”
,Rochester Institute of Technology.
[23] Farid, “Digital Image Forensic”
farid@cs.dartmouth.edu
,www.cs.dartmouth.edu/farid.
[24] Yuan and Xiao-Ping Zhang, (2006), “Multiscale
Fragile Watermarking Based on the Gaussian
Mixture Model” Page 3189, IEEE Transactions On
Image Processing, Vol. 15, No. 10, October .
[25] Chin-Laung Lei, Pei-Ling Yu, Pan-Lung Tsai, and
Ming-Hwa Chan, (2004),“An Efficient and
Anonymous Buyer-Seller Watermarking
Protocol”,Page 1618, IEEE Transactions On Image
Processing, Vol. 13, No. 12, December .
[26] Nebu John Mathai, Deepa Kundurand Ali
Sheikholeslami,(2003), “Hardware Implementation
 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2
Perspectives of Digital Video Watermarking
Algorithms”, Page 925, IEEE Transactions On
Signal Processing, Vol. 51, No. 4, April.
[27] Rakesh Agrawal, Peter J. Haas, Jerry
Kiernan,(2003),“Watermarking relational data:
framework, algorithms and analysis” , The VLDB
Journal 12: 157–169 / Digital Object Identifier
(DOI) 10.1007/s00778-003-0097-x.
[28] Fawad Ahmed, Farook Sattar, Mohammed Yakoob
Siyal, and Dan Yu, (2006),“A Secure
Watermarking Scheme for Buyer-Seller
Identification and Copyright Protection” , Hindawi
Publishing Corporation EURASIP Journal on
Applied Signal Processing Volume, Article ID
56904, Pages 1–15 ,DOI 10.1155/ASP/2006/56904.
[29] Ravi,K, Sharma, Steve Decker, (2002),“Practical
Challenges for Digital Watermarking
Applications”, EURASIP Journal on Applied Signal
Processing 2002:2, 133–139 © 2002 Hindawi
Publishing Corporation.
[30] A. Menezes, P. van Oorschot, and S. Vanstone,
“Handbook of Applied Cryptography”, CRC Press,
1996.
[31] An Introduction to Cryptography, 1999 Network
Associates, Inc. and its Affiliated Companies.
[32] Glenn Durfee, PhD thesis “Cryptanalysis Of RSA
Using Algebraic And Lattice Methods”, June 2002,
Stanford University.
[33] Alina Mihaela Oprea ,“Efficient Cryptographic
Techniques for Securing Storage Systems” CMU-
CS-07-119April 2007, PhD thesis, School of
Computer Science Carnegie Mellon University
,Pittsburgh, PA 15213.
[34] Shafi Goldwasser, Mihir Bellare,“Lecture Notes on
Cryptography”, MIT,July 2008.
[35] Whitefiled Diffie and Martin E. Hellman ,
“Multiuser Cryptographic Techniques*” , Stanford
University Stanford, California.
[36] Kenneth W. Dam and Herbert S. Lin,
“Cryptography's Role in Securing the Information
Society”, Editors, Committee to Study National
Cryptography Policy, National Research Council.
[37] Harvey Cohn, “Advanced Number Theory”,
Distinguished Professor, City University New
York.
[38] Rethinking Public Key Infrastructures and Digital
Certificates, Rethinking Public Key Infrastructures
and Digital Certificates, MIT PressR.
[39] Xinyuan Wang and Douglas S. Reeves “Robust
Correlation of Encrypted Attack Traffic Through
Stepping Stones By Watermarking The Interpacket
Timing”, Dept. of Computer Science ,North
Carolina State University, Raleigh, NC 27695.
© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|
*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
1558
[40] E. C. C. Tsang, Changzhong Wang, Degang Chen,
Congxin Wu and Qinghua Hu, “Communication
Between Information Systems Using Fuzzy Rough
Sets”, IEEE Transactions On Fuzzy Systems, Vol.
21, No. 3, June 2013, Page 527.
[41] Teresa Garcia-Valverde, Alberto Garcia-Sola, Hani
Hagras, James A. Dooley,Victor Callaghan and
Juan A. Botia, “A Fuzzy Logic-Based System for
Indoor Localization Using WiFi in Ambient
Intelligent Environments”, IEEE Transactions On
Fuzzy System, Vol. 21, No. 4, August 2013, Page
702.
[42] Hooman Tahayori, Alireza Sadeghian and Witold
Pedrycz, “Induction of Shadowed Sets Based on
the Gradual Grade of Fuzziness”, ”, IEEE
Transactions On Fuzzy System, Vol. 21, No. 5,
October 2013,Page 937.
[43] S.P.Tiwari and Arun K.Srivastava,“Fuzzy rough
sets,fuzzy preorders and fuzzy topologies”,
Elsevier, Fuzzy Sets and Systems, Vol. 210
,2013,Page 63.
[44] Dong Zheng, Yan Liu, Jiyang Zhao, and
Abdulmotelab El Sadikk , “A Survey of RST
Invariant Image Watermarking Algorithms” ,
,University of Ottawa ACM Computing Surveys”,
Vol. 39, No. 2, Article 5, Publication date: June
2007.
[45] Sameh Oueslati, Adnane Cherif and Basel
Solaiman, “A Fuzzy Watermarking Approach
Based on the Human Visual System”, page 218,
International Journal Of Image Processing, Volume
(4): Issue (3). 2010.
[46] Anderson Rocha, Walter Scheirer and Terrance
Boult, Siome Goldenstein,“Vision of the Unseen:
Current Trends and Challenges in Digital Image
and Video Forensics” ACM Computing Surveys,
Vol. 43, No. 4, Article 26, Publication date:
October 2011.
[47] Chuntao WangJiangqun Ni,and Jiwu, “An Informed
Watermarking Scheme Using Hidden Markov
Model in the Wavelet Domain” Huang,IEEE
Transactions On Information Forensics And
Security, Vol. 7, No. 3, June 2012 , Page853.
[48] J. C. Kelkboom, Jeroen Breebaart, Ileana Buhan,
and Raymond N. J.Veldhuis, “Maximum Key Size
and Classification Performance of Fuzzy
Commitment for Gaussian Modeled Biometric
Sources” IEEE Transaction On Information
Forensic and Security, Vol. 7, No. 4, August 2012
Page No. 122.
[49] Peyman Rahmati, Andy Adler and Thomas Tran ,
“ Watermarking in E-commerce”, International
Journal of Advanced Computer Science and
Applications, Vol. 4, No. 6, 2013.
 International Journal of Advanced Computing, ISSN: 2051-0845, Vol.47, Issue.2 1559

[50] T.Sridevi and S Sameena Fatima,“Digital Image Sciences and Applications, Vol. 1, No. 3,
Watermarking using Fuzzy Logic approach based September 2011.
on DWT and SVD”, International Journal of
[62] Sharbani Bhattacharya , “Watermarking Digital
Computer Applications ,Vol 74– No.13, July 2013.
Images Using Fuzzy Matrix Compositions and
[51] Mriganka Gogoi , H.M.Khalid Raihan Bhuyan Fuzzy Max-n-Min Set”, accepted in International
,Koushik Mahanta , Dibya Jyoti Das and Ankita Journal of Advanced Computing, Recent Science
Dutta, “ Image and Video based double watermark Publications, United Kingdom. ISSN Number :
extraction spread spectrum watermarking in low 2051-0845 assigned by The British Library, UK.
variance region”, International Journal of Advanced
[63] Sharbani Bhattacharya , “Watermarking Digital
Computer Science and Applications, Vol. 4, No. 6,
Images Using Fuzzy Matrix Rules and
July 2013.
Neighborhood Set”, accepted in International
[52] Alimohammad Latif, “ An Adaptive Digital Image Journal of Advanced Computing, Recent Science
Watermarking Scheme using Fuzzy Logic and Tabu Publications, United Kingdom. ISSN Number :
Search”, Journal of Information Hiding and 2051-0845 assigned by The British Library, UK.
Multimedia Signal Processing, Volume 4, Number
4, October 2013.
[53] Elzbieta Zielinska, Wojciech Mazurczyk and
Krzysztof Szczypiorski, “Trends in
Steganography”, Communication of ACM, Vol 57
,No. 3, March 2014.
[54] Nikolaos V. Boulgouris,Ioannis
Kompatsiaris,(2002),“Segmentation and Content-
Based Watermarking for Color Image and Image
Region Indexing and Retrieval” EURASIP Journal
on Applied Signal Processing 2002:4, 418–431.
[55] Prayoth Kumsawat, Kitti Attakitmongcol, and
Arthit Srikaew, (2005), “A New Approach for
Optimization in Image Watermarking by Using
Genetic Algorithms” page 4707, IEEE
Transactions On Signal Processing, Vol. 53, No. 12,
December.
[56] Pik Wah Chan,Michael R.lyu and Roland T. Chin,
(2005), “A Novel scheme For Hybrid Digital
VideoWatermarking : Approach, Evaluation And
Experimentation”, IEEE Transactions on circuits
and system for video technology,Vol 15,No.
12,Dec.
[57] Juan R.Hernandez,Martin Amado,Fernando Perez-
Gonzalez, (2000),”DCT Domain watermarking
technique for still Image :Detectors Performance
analysis and New Structure”, IEEE Transaction on
Image processing,Vol.9,No.1,January.
[58] L.T. Brown ,(2006) “Computer Evidence and
Collection Preservtation and Preservation” ,
Thomson/Delmar Learning. Published by Charles
River Media, Inc.
[59] Stefan Katzenbeisser and Fabien A.P. Petitcolas
,“Information hiding techniques for steganography
and digital watermarking’, Archtech House Inc.
[60] Peter Wayner,“Disaapearing Cryptograpy-
Information hidind, steganography and
watermarking” , Published by Elsevier Inc.
[61] P.K. Sharma, “(α, β) – cut of Intuitionistic Fuzzy
Module”, International Journal of Mathematical

© RECENT SCIENCE PUBLICATIONS ARCHIVES |November2014|$25.00 | 27703990|

*This article is authorized for use only by Recent Science Journal Authors, Subscribers and Partnering Institutions*
View publication stats