Kala

class 7
Gaint All Chapters not opening

Hamare Atit all chapters last line missing
Hamare Paryavarar Chapter 8 and 9 not opening
Hamare Paryavaran all chapters last line missing
Ruchira Bhag chapter 5 missing
Science chapter 2 not opening
class 8
Ganit all chapters last line missingclass 7
class 8
Ganit all chapters last line missing
Ganit all chapters font mismatching
Samajik aur Rajnitik Jeevan III contents in the cover page... font mismatch
International Journal of Computer Application and Technology
(IJCAT)
Volume 1 Issue 1 (April 2014)ggggdgdgdgdgdsgdgdg
ISSN: 2349-1841
16 www.technopublications.com
TEXT WATER MARKING USING TECHNIQUES DCT AND DWT: A REVIEW Harmandeep Kaur1, Er.S
imarjeet Kaur2 1M.Tech (Computer Science), Sri Guru Granth Sahib World Universit
y, India 2Assistant Professor (Computer Science), Sri Guru Granth Sahib World Un
iversity, India
ABSTRACT: - Digital watermarking is protection provider for multimedia content o
ver Internet. Now a day s very sensitive information flows through the network, so
the protection of information is necessary. To protect the multimedia applicati
ons from copyright issues a digital watermarking technique is used. Digital wate
rmarking is the general technique of embedding the information in the original f
ile, the information can be audio, video, images and text. Text can be hidden in
side the image, audio, video as a watermark. So using this way of encryption we
can avoid any other person to access data. The main advantage of text watermarki
ng is that a user can send data over Internet with a faith that no one can forge
or access its personal text. Many techniques are available for text watermarkin
g such as SVD and LSB. In this paper our focus is on text watermarking concept a
nd the results of watermarking techniques are compared. Keywords: - Text documen
t watermarking, DCT, DWT, SVD and LSB.
I. INTRODUCTION
Watermarking is a concept which is used to save the document from the copyright
issue. Watermark comes behind the original document and it is suppose not to har
m the original content. Many software companies are using the concept of waterma
rk for their documents. The best example is Microsoft s word. To protect the digit
al data we need full security at a good level to embed the text such as major we
bsites contents are like paper, legal document, letter, SMS etc. Digital waterma
rking is a process in which information can hide in form of image, audio, video
etc. Hidden information extracted at the receiving end known as decryption proce
ss. So to protect the data from outside world for illegal accessing of informati
on watermarking is used. To protect data from illegal authorities we have many t
echniques like cryptography, watermarking, steganography. Encryption and decrypt
ion process of data comes under steganography. In case of encryption data is enc
rypted and outside world or third parties cannot access it. Then on receiver sid
e after decrypting there is no any provision to protect data from replications.
So encryption exists on sender side and decryption exists on receiver side. Text
watermarking technique have been developed in past to protect the data from ill
egal copies, any forgery with data or prevent copyright. This technique is propo
sed for English language text either in use textual or image watermark. There ar
e many ways to forgery with data as like insertion, deletion or recorded a copy
of data. The existing text watermarking algorithms are not robust against random
tampering attacks (insertion, deletion or reordering of words). Watermarks comp
osed of both image and text make the text secure and has better robustness [1].T
ext document watermarking is shown in fig 1.
Fig1. Text is hidden in image In this figure we add text in image that is not po
ssible to find out data. Attacker confuse at this point, Is this only image or i
mage with text?
(IJCAT)
Volume 1 Issue 1 (April 2014)International Journal of Computer Application and T
echnology
(IJCAT)
Volume 1 Issue 1 (April 2014)
ISSN: 2349-1841
iversity, India
I. INTRODUCTION
mage with text?
(IJCAT)
ISSN: 2349-1841
There are two types of digital watermarking: visible (perceptible) and invisible
(imperceptible). Invisible watermarking, watermarks are embedded in such a way
that they are visible when the content is viewed. Invisible watermarks cannot be
seen but recovering of watermark is possible with an appropriate decoding algor
ithm.
II. RELATED WORK
Kumar et al (2012) proposed a unique technique which combines and uses DCT DWT &
SVD algorithm for the watermarking technique. They have used the base image for
the content storage and the text for the merging part. The approach is quite ap
preciable and its algorithm is explained is quite clearly explained in the paper
. The only drawback in this paper is that it has not been used for the medical i
mage which has been provided as the future scope of this paper [1]. Surya Pratap
Singh (2012) introduces a combinational algorithm for the color and gray scale
image watermarking. This paper focuses on time based watermarking. The time base
d watermarking indicates the significance of how effectively the content has bee
n encrypted and merged into the base content. They describe that if the time of
retrieval is more, the performance is good. The work is appreciable and can be u
seful for the future research works [2]. Sharma et al (2012) presents a new prop
osal for hiding a logo-based watermark in color still image. This dodge is based
on averaging of central frequency coefficients of block Discrete Cosine Transfo
rm (DCT) coefficients of an image. It is unique from earlier dodge based on midd
le frequency coefficient by mean of high redundancy, to nurture malicious attack
s. Here we propose algorithm of aliquot watermarking technique based on DCT (Dis
crete Cosine Transformation) using mid band for robustness. Through adjusting th
e block DCT coefficient of the image the watermarks are numbered [3].
Fezollari et al (2012) concludes that some of these algorithms are robust agains
t some attacks but not against some others.SVD based algorithms are new and dema
nd continuous improvements. In their approach they provided some SVD based algor
ithms and furthermore suggested an idea of a DCT SVD based algorithm. The modifi
ed method is applicable for some attacks compare with Sverdlov Method. Moreover
a digital watermarking scheme was implemented in the Xilinx Virtex II Pro platfo
rm in which the alternation of the watermarking algorithm from encoder to decode
r is sufficient for the scheme to be dynamic [4]. Priyanka Sharma (2012) discuss
es about the quality management while the operation performance of watermarking.
She studied that there are a lot of algorithms which can be useful for the wate
rmarking but it is important to maintain the quality of the base content. She ha
s used the term entropy to find the quality of the base image. Basically it is t
he disorder which occur when so ever we perform the operation [5]. Qing-Cheng Li
(2012) presents a novel text watermarking technique but for the Chinese text on
ly. In his approach he has discussed the bit stream pattern of the text on the b
asis of which the merging can be done .His approach also describes the pictograp
hic approach of the text and the visual ability of the user. The approach is alt
hough has an effective thinking but the problem is as the Chinese language is so
sophisticated, it fits there but not with every language. His algorithm has bee
n designed especially for Chinese characters and hence this algorithm cannot be
used for global language [6]. Aziz Shahid et al (2010) presented a zero text wat
ermarking scheme in the international conference of 2010. According to them, Exi
sting text watermarking algorithms are not robust against random insertion and d
eletion attacks on text. With the increasing volume of attack, the survival of w
atermark in text becomes challenging and hence they developed a novel text water
marking algorithm that can be used for copyright protection of textual contents.
They compared their results with other existing algorithm of the same contrast
and their results are found to be effective enough to get proceeded for modifica
tion [7]. Makarand L. Mali (2012) presented a watermarking scheme on the basis o
f Natural Language Processing. It was a fantastic idea to introduce Neural Netwo
rks into the contrast of encryption. The Neural Network generates weight for eac
h and every input provided to it rather than taking everything as an input strea
m. The pattern changing of neural network is quite similar to SVM as it also con
verts the entire input according its simplification and then proceeds. Hence his
method is quite effective and can be considered for future development process
[8].
Nidhi Divecha (2012) presented a watermarking scheme based on the wavelet quanti
zation method which is again an appreciable effort in this filed. DWT stands for
Discrete Wavelet Transformation and it converts the entire data scenario into w
aves. Proceeding
(IJCAT)
ISSN: 2349-1841
the texts as wave is a unique method in this type of implementation. The effort
done by Nidihi had only one drawback , she did not mention the type of wavelet t
ransformation she is using as there are a lot of wavelet transformation like Dab
uchi, Symlet and others and hence her method can be tried with the above mention
ed wavelet family members [9]. Fahim Irfan Alam (2012) introduced the concept of
signature in his scheme of watermarking. The signature system is bit similar to
the private and public key concept in which the public key is visible to all bu
t it requires a private key to get unlocked. If this method is tried under invis
ible watermarking concept, it is fine but if it is used as a visible watermarkin
g concept, the motive of hiding of data remains untouched as the user would be a
ble to identify easily that some data is hidden behind the encrypted text [10].
III. TEXT WATERMARKING BASED ON DCT
DCTs are used to convert data into the summation of a series of cosine waves osc
illating at different frequencies. They are widely used in image and audio compr
ession. They are very similar to Fourier Transforms, but DCT involves the use of
just Cosine functions and real coefficients, whereas Fourier Transformations ma
ke use of both Sins and Cosines and require the use of complex numbers. DCTs are
simpler to calculate. Both Fourier and DCT convert data from a spatial-domain i
nto a frequency-domain and their respective inverse functions convert things bac
k the other way. The JPEG (Joint Photographic Experts Group) format uses DCT to
compress images. Frequency components of DCT block should be high frequency, bec
ause of the heavy quantization of coefficients during JPEG compression. Hence it
is better to embed the watermark in mid or high frequency DCT components. If th
e embedding factor M is chosen small, embedding the watermark in lowest frequenc
y components will be more desirable, because these components are the ones that
are least likely to be quantized in JPEG compression. The flow chart of the algo
rithm is shown in figure 2.

Fig. 2: The DCT algorithm flow chart
IV. TEXT WATERMARKING BASED ON DWT
Wavelet domain is a promising domain for watermark embedding. Wavelet refers to
small waves. Discrete Wavelet Transform is based on small waves of limited durat
ion and varying frequency [3]. This is a frequency domain technique in which fir
stly cover image is transformed into frequency domain and then its frequency coe
fficients are modified in accordance with the transformed coefficients of the wa
termark and watermarked image is obtained which is very much robust. DWT decompo
ses image hierarchically, providing both spatial and frequency description of th
e image. Then the image is decomposing in three directions i.e. vertical, horizo
ntal and diagonal in results to separate different components name as LL, HL, LH
, and HH. Here letter L and H refers to applying either low pass frequency opera
tion or high pass frequency operations to the rows and the second letter refers
to the
(IJCAT)
ISSN: 2349-1841
filter applied to the columns of the cover image [4]. As shown in fig 3.
Fig.3 Two-level DWT Algorithm for carrying out DWT: Step1. By using DWT, we deco
mpose the original image in some sub-bands. Step2. In this step our work is to c
hoose a Sub-band for embedding watermark that should be most suitable. Step3. Th
e Wavelet coefficients of the selected sub-band are modified according to the wa
termark image. Step4. After embedding watermark, watermarked image is obtained.
V. OTHER TECHNIQUES
There are many other techniques excluding DCT and DWT for watermarking which are
as follows:
a) Singular Value Decomposition (SVD)
Singular Value Decomposition transform is a linear algebra transform which is us
ed for factorization of a real or complex matrix with numerous applications in v
arious fields of image processing [5]. As a digital image can be represented in
a matrix form with its entries giving the intensity value of each pixel in the i
mage, SVD of an image M with dimensions m x m is given by: M=USVT Where, U and V
are orthogonal matrices and S known as singular matrix is a diagonal matrix car
rying non-negative singular values of matrix M. There are two main properties of
SVD to employ in digital watermarking schemes [6]:
1. Quality of image does not affect by Small variations in singular values
2. Singular values of an image have high stability so; they do not change after
various attacks.
b) LEAST SIGNIFICANT BIT (LSB) This is invisible digital watermarking technique,
in which each 8-bit pixel s least significant bit is overwritten with a bit from
the watermark. In a digital image, information can be inserted directly into eve
ry bit of image information or the more busy areas of an image can be calculated
so as to hide such messages in less perceptible parts of an image. For example,
assume the image uses a 24-bit RGB color model (Figure 4). The first image pixe
l has a teal green color (0x008080), while the first watermark byte is 0xDC. Fir
st, the image pixel is divided into its constituent bytes of red, green, and blu
e as shown in figure 4. 0x008080 => r: 0x00, g: 0x80, b: 0x80 Then the watermark
byte is divided into pairs of bits. Next embed each bit pair into bits 1 and 0
of each color byte. So the red byte (0x00) becomes 0x03, the green byte (0x80) b
ecomes 0x81, and the blue byte (0x80) becomes 0x83. Then use these modified byte
s to recolor the image pixel. The new pixel color, however, seems to be the same
teal color (Figure 4).
Fig. 4 Example of LSB
Fig. 4 Encoding of watermark bits
(IJCAT)
ISSN: 2349-1841
VI. COMPARITIVE RESULT
Comparative result of DCT and DWT need GUI first of all. So we develop DCT GUI a
nd DWT GUI as shown in fig 5.1 and fig 5.2:
Fig.5.1 GUI for DWT Based Watermarking
Fig.5.2 GUI for DCT Based Watermarking There is evolution of results on the basi
s of three images as shown in GUI. Table I show results for imperceptibility.
So with graph presentation comparison between both techniques can be discussed v
ery well.
Fig .6 PSNR value of DCT with Cropping & Resizing
Fig 7 PSNR value of DWT with Cropping & Resizing Fig 6 and fig 7 shows the resul
ts of DCT and DWT to find PSNR value of the basis of cropping and resizing.
VII. CONCLUSION
Many techniques are available for watermarking and finally come to a conclusion
that every technique provides protection to digital data. Each one secures the i
nformation in different way on different level. In this paper, we described a co
mbined DCT-DWT digital image watermarking algorithm. We conclude DWT technique p
rovides better image quality than DCT technique, especially at higher threshold
values. For lower threshold values, 8X8 DCT gives similar results as DWT but for
higher threshold, the quality of images compressed using DWT slowly degrades wh
ile the quality of 8X8 DCT compressed images deteriorates rapidly. At lower thre
shold DCT should be used but at higher threshold, DCT cannot be used because of
poor image quality.
(IJCAT)
ISSN: 2349-1841
VIII. REFERENCES [1] Jaseena K.U., Anita John, Text Watermarking using Combined I
mage and Text for Authentication and Protection , International Journal of Compute
r Applications (0975 8887) Volume 20 No.4, April 2011. [2] Wen Yuan Chen and Shih
Yuan Huang, Digital Watermarking Using DCT Transformation , Digital Watermarking U
sing DCT Transformation. [3] Chunlin Song, SudSudirman, MadjidMerabti, Recent Adv
ances and Classification of Watermarking Techniques in Digital Images , ISBN: 9781-902560-22-9 2009 PGNet [4] M. MohamedSathik, S. S. Sujatha, A Novel DWT Based In
visible Watermarking Technique for Digital Images , International Arab Journal of
e-Technology, Vol 2, no. 3, pp. 167-173, January 2012. [5] Manjunath. M, Prof. S
iddappaji, A New Robust Semi blind Watermarking Using Block DCT and SVD , IEEE Inte
rnational Conference on Advanced Communication Control and Computing Technologie
s (ICACCCT), pp. 193-197, 2012. [6] L. Demanet Curvelets, wave atoms, and wave eq
uations , Ph.D. thesis, Caltech, 2006. [7] Kumar Robust Digital Watermarking using
DWT-DCT-SVD , International Journal of Engineering Research and Applications (IJER
A) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 3, May-Jun 2012, pp.991-997. [8]
Surya Pratap Singh, A Robust Watermarking Approach using DCT-DWT , International Jo
urnal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (I
SSN 2250-2459, Volume 2, Issue 8, August (2012).
[9] Sharma, Analysis of robust watermarking technique using mid band DCT , Internat
ional Journal of Scientific and Research Publications, Volume 2, Issue 3, March
2012 1 ISSN 2250-3153. [10] Albian Fezollari, Implementation of Robust Digital Wa
termarking Algorithms using SVD and DCT Techniques , ICT Innovations 2012 Web Proc
eedings - Poster Session ISSN 1857-7288. [11] Priyanka Sharma, Quality Enhancemen
t of Watermarking System Using Discrete Cosine Transform , International Journal o
f Scientific & Engineering Research Volume 3, Issue 4, April-2012 ISSN 2229-5518
. [12] Mohammad Ibrahim Khan, Implementation of robust watermarking using SVD , Int
ernational Journal of Computer Applications, vol. 62, issue 13, January 2013, pp
. 29-36. [13] Kamaljeet Kaur, Image Watermarking Using LSB , International Journal
of Advanced Research in Computer Science and Software Engineering Volume 3, Issu
e 4, April 2013 ISSN: 2277 128X. [14] Swati Patel, Comparative Analysis between D
CT & DWT Techniques of Image Compression , Journal of Information Engineering and
Applications Volume 1, No.2, 2011 ISSN 2224-5758 (print) ISSN 2224-896X.

ISSN: 2349-1841
ithm.
II. RELATED WORK
[8].
aves. Proceeding
(IJCAT)
ISSN: 2349-1841
to the
(IJCAT)
ISSN: 2349-1841
V. OTHER TECHNIQUES
as follows:
various attacks.
(IJCAT)
ISSN: 2349-1841
ery well.
VII. CONCLUSION
poor image quality.
(IJCAT)
ISSN: 2349-1841
Ganit all chapters font mismatchingclass 7
class 8
(IJCAT)
ISSN: 2349-1841
iversity, India
I. INTRODUCTION
mage with text?
(IJCAT)
echnology
(IJCAT)
ISSN: 2349-1841
iversity, India
I. INTRODUCTION
mage with text?
(IJCAT)
ISSN: 2349-1841
ithm.
II. RELATED WORK
[8].
aves. Proceeding
(IJCAT)
ISSN: 2349-1841
to the
(IJCAT)
ISSN: 2349-1841
V. OTHER TECHNIQUES
as follows:
various attacks.
(IJCAT)
ISSN: 2349-1841
ery well.
VII. CONCLUSION
poor image quality.
(IJCAT)
ISSN: 2349-1841
ances and Classification of Watermarking Techniques in Digital Images , ISBN: 978-
1-902560-22-9 2009 PGNet [4] M. MohamedSathik, S. S. Sujatha, A Novel DWT Based In

ISSN: 2349-1841
ithm.
II. RELATED WORK
[8].
aves. Proceeding
(IJCAT)
ISSN: 2349-1841

to the
(IJCAT)
ISSN: 2349-1841
V. OTHER TECHNIQUES
as follows:
various attacks.

(IJCAT)
ISSN: 2349-1841
ery well.
VII. CONCLUSION
poor image quality.
(IJCAT)
ISSN: 2349-1841
(IJCAT)
Volume 1 Issue 1 (April 2014)ggggdgdgdgdgdsgdgdgclass 7
class 8
(IJCAT)
ISSN: 2349-1841
iversity, India
I. INTRODUCTION
mage with text?
(IJCAT)
echnology
(IJCAT)
ISSN: 2349-1841
iversity, India
I. INTRODUCTION

mage with text?
(IJCAT)
ISSN: 2349-1841
ithm.
II. RELATED WORK
[8].
aves. Proceeding
(IJCAT)
ISSN: 2349-1841
to the
(IJCAT)
ISSN: 2349-1841
V. OTHER TECHNIQUES
as follows:
various attacks.
(IJCAT)
ISSN: 2349-1841
ery well.
VII. CONCLUSION
poor image quality.
(IJCAT)
ISSN: 2349-1841
ISSN: 2349-1841

ithm.
II. RELATED WORK
[8].
aves. Proceeding
(IJCAT)
ISSN: 2349-1841
to the
(IJCAT)
ISSN: 2349-1841
V. OTHER TECHNIQUES
as follows:
various attacks.
(IJCAT)
ISSN: 2349-1841
ery well.
VII. CONCLUSION
poor image quality.
(IJCAT)
ISSN: 2349-1841
ISSN: 2349-1841
iversity, India
I. INTRODUCTION
mage with text?
(IJCAT)
echnology
(IJCAT)
ISSN: 2349-1841
iversity, India
I. INTRODUCTION
mage with text?
(IJCAT)
ISSN: 2349-1841
ithm.
II. RELATED WORK
[8].
aves. Proceeding
(IJCAT)
ISSN: 2349-1841

to the
(IJCAT)
ISSN: 2349-1841
V. OTHER TECHNIQUES
as follows:
various attacks.
(IJCAT)
ISSN: 2349-1841

ery well.
VII. CONCLUSION
poor image quality.
(IJCAT)
ISSN: 2349-1841
ISSN: 2349-1841
ithm.
II. RELATED WORK
[8].
aves. Proceeding
(IJCAT)
ISSN: 2349-1841
to the
(IJCAT)
ISSN: 2349-1841
V. OTHER TECHNIQUES
as follows:
various attacks.
(IJCAT)
ISSN: 2349-1841
ery well.
VII. CONCLUSION
poor image quality.
(IJCAT)
ISSN: 2349-1841

Kala

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Kala

Uploaded by

Copyright:

Available Formats

class 7

Gaint All Chapters not opening

rithm is shown in figure 2.

Applications Volume 1, No.2, 2011 ISSN 2224-5758 (print) ISSN 2224-896X.

1-902560-22-9 2009 PGNet [4] M. MohamedSathik, S. S. Sujatha, A Novel DWT Based In

is better to embed the watermark in mid or high frequency DCT components. If th

Fig. 4 Encoding of watermark bits

e after decrypting there is no any provision to protect data from replications.

seen but recovering of watermark is possible with an appropriate decoding algor

fficients are modified in accordance with the transformed coefficients of the wa

s of three images as shown in GUI. Table I show results for imperceptibility.

You might also like