IMAGE WATERMARKING

Prepared by

Mr.Abhishek Chaube
Mr.Bharat Chauhan
Mr.Deepak Chandrasekharan.

submitted in the partial fulfillment of the requirements of PROJECT I

for the award of

Bachelor of Engineering degree

in
Computer Engineering

to

UNIVERSITY OF MUMBAI

through

Thakur College Of Engineering & Technology ,Mumbai.

in

Dec 2010

1
 CERTIFICATE
This is to certify that the report titled
“IMAGE WATERMARKING”

Mr.Abhishek Chaube
Mr.Bharat Chauhan
Mr.Deepak Chandrasekharan

embodies the bonafide work done at

Thakur College of Engineering & Technology,
Mumbai
by them under my guidance and supervision.

Signature of the Internal Guide Signature of the External

Guide
Name Name
Designation:…..………….. Designation:…..…………..
Date: Date:

This is to certify that

Mr.Abhishek Chaube
Mr.Bharat Chauhan
Mr.Deepak Chandrasekharan

have satisfactorily completed the requirements

of the
Term Work OF PROJECT I
as prescribed by the
University of Mumbai.

Project Coordinator. HOD CMPN Principal

(Prof. Shiwani Gupta) ( Prof. R.S. Khokale) (Dr. B. K.Mishra)

This report has been examined by us as per the

University requirements at
TCET, Mumbai on _______________

2
Signature………………… Signature…………………

Name…………………… Name…………………….
Internal Examiner External Examiner

CONTENTS
Sr
. Sub. Pg
TOPIC
N Sec. No
o
1. Acknowledgement 4

2. Abstract 5

3. System Overview 9

4 Module Description 20

5. Planning 11

6. Gantt Chart 13

7. Formulation 14

7.1 Use Case Diagrams 14

7.2 Class Diagram 16

7.3 Sequence Diagrams 17

7.4 Data Flow Diagrams 19

8 Progress/Screenshots 23

9 Current Progress 29

10 Conclusion 30

10.1 Benefits 30

3
 10.2 Features 30

References 32

ACKNOWLEDGEMENT

We take this opportunity to thank Prof. Shiwani Gupta, our

internal guide for her constant support, co-ordination and
encouragement. We also thank her for her moral support and
patience during the course of the project. We extend our sincere
thanks to our Head of Department, Prof. Rahul Khokale.
We would also like to thank our principal Dr. B.K. Mishra,
and our project co-ordinators Prof.Shiwani Gupta and all the staff
members who helped us in our project.
We are also grateful to our friends for their unconditional
support and sincere feedback about our project.
Our sincere thanks to the management of THAKUR
COLLEGE OF ENGINEERING & TECHNOLOGY for giving us
required facilities to accomplish our project work.

NAMES OF STUDENTS:

ABHISHEK CHAUBE

4
 BHARAT CHAUHAN
DEEPAK CHANDRASEKHARAN

iii

ABSTRACT

One of the biggest technological events of the last two decades was
the invasion of digital media in an entire range of everyday life
aspects. Digital data can be stored efficiently and with a very high
quality, and it can be manipulated very easily using computers.
Furthermore, digital data can be transmitted in a fast and
inexpensive way through data communication networks without
losing quality.

Editing is easy because one can access the exact discrete

locations that need to be changed. Copying is simple with no loss
of fidelity and a copy of a digital media is identical to the original.
With digital multimedia distribution over World Wide Web,
Intellectual Property Right (IPR) are more threatened than ever due
to the possibility of unlimited copying.

One solution would be to restrict access to the data using some

encryption technique. However encryption does not provide
overall protection. Once the encrypted data are decrypted, they
can be freely distributed or manipulated. The above problem can
be solved by hiding some ownership data into the multimedia data,
which can be extracted later to prove the ownership.

A Watermarking is adding an “ownership” information in

multimedia contents to prove the authenticity.This technology
embeds a data, an unperceivable digital code, namely the
watermark, carrying information about the copyright status of the
work to be protected. Continuous efforts are being made to device
an efficient watermarking schema but techniques proposed so far
do not seem to be robust to all possible attacks and multimedia data
processing operations.

5
 1. OVERVIEW

1.1 INTRODUCTION
 The popularity of World Wide Web demonstrated the
commercial potential of offering multimedia resources
through the digital networks.

 Since commercial interests seek to use the digital network to

offer digital media for profit, they have a strong interest in
protecting their ownership rights.

 Digital information can be copied any number of times from

one medium to another; they can be transmitted through
networks, etc., all without compromising the quality of the
data.
 There is no way to distinguish between an original electronic
documents and its copy.

 It is easy to change any part of an unprotected electronic

document. One possibility here is to replace original
signatures with cryptographic methods.

 Digital signature is data items formed by the signatory and

created from the document that is to be signed.

1.1.1 IMAGE WATERMARKING

 Image watermarking is hiding text or data in another image

to authenticate the image or protect it from plagiarism.

6
  With images widely available on the Internet, it may
sometimes be desirable to use watermarks. A watermark is a
secondary image which is overlaid on the primary image,
and provides a means of protecting the image

 Watermarks can be visible or invisible.

 They are inseparable from the cover in which they are
From embedded. Unlike cryptography, watermarks can protect
content even after they are decoded

Visible
A visible watermark is a visible translucent image which is
overlaid on the primary image. Perhaps consisting of the logo or
seal of the organization which holds the rights to the primary
image, it allows the primary image to be viewed, but still marks it
clearly as the property of the owning organization.

Invisible
An invisible watermark is an overlaid image which cannot be seen,
but which be detected algorithmically.

7
o A watermark which is destroyed when the image is
manipulated digitally in any way may be useful in proving
authenticity of an image.

o An invisible watermark which is very resistant to destruction

under any image manipulation might be useful in verifying
ownership of an image suspected of misappropriation.

8
 SYSTEM OVERVIEW

MATLAB: MATLAB (matrix laboratory) is a numerical

computing environment and fourth-generation programming
language. Developed by Math Works, MATLAB allows matrix
manipulations, plotting of functions and data, implementation of
algorithms, creation of user interfaces, and interfacing with
programs written in other languages, including C, C++, and
Fortran.

Although MATLAB is intended primarily for numerical

computing, an optional toolbox uses the MuPAD symbolic engine,
allowing access to symbolic computing capabilities. An additional
package, Simulink, adds graphical multi-domain simulation and
Model-Based Design for dynamic and embedded systems.

MATLAB can call functions and subroutines written in the C

programming language or Fortran. A wrapper function is created
allowing MATLAB data types to be passed and returned. The
dynamically loadable object files created by compiling such
functions are termed "MEX-files" (for MATLAB executable).

Libraries written in Java, ActiveX or .NET can be directly called

from MATLAB and many MATLAB libraries (for example XML
or SQL support) are implemented as wrappers around Java or
ActiveX libraries. Calling MATLAB from Java is more
complicated, but can be done with MATLAB extension, which is
sold separately by MathWorks, or using an undocumented
mechanism called JMI (Java-to-Matlab Interface), which should
not be confused with the unrelated Java Metadata Interface that is
also called JMI.

As alternatives to the MuPAD based Symbolic Math Toolbox

available from MathWorks, MATLAB can be connected to Maple
or Mathematica.

9
1.2 LITERATURE SURVEY

1.2.1History Of Watermarking
 More than 700 years ago, watermarks were used in Italy to
indicate the paper brand and the mill that produced it.
 By the 18th century watermarks began to be used as anti
counterfeiting measures on money and other documents
measures on money and other documents.
 The term watermark was introduced near the end of the 18th
century. It was probably given because the marks resemble
the effects of water on paper
 The first example of a technology similar to digital
watermarking is a patent filed in 1954 by Emil Hembrooke
for identifying music works.
 In 1988, Komatsu and Tominaga appear to be the first to use
the term “digital watermarking”.
 About 1995, interest in digital watermarking began to
mushroom.

About 1995, interest in digital

watermarking began to mushroom

10
1.2.2 Implementation and Evaluation of Several
Watermarking Algorithms.
This section will describe some of the algorithms recently
implemented upon.
Least Significant Bit Substitution

 Using Least Significant Bit manipulation, a huge amount of

information can be hidden with very little impact to image
quality. This technique is performed in the spatial domain.

 The embedding of the watermark is performed choosing a

subset of image pixels and substituting the least significant
bit of each of the chosen pixels with watermark bits.
Extraction of the watermark is performed by extracting the
least significant bit of each of the selected image pixels.

 If the extracted bits match the inserted bits, then the

watermark is detected. The extracted bits do not have to
exactly match with the inserted bits. A correlation measure
of both bit vectors can be calculated. If the correlation of
extracted bits and inserted bits is above a certain threshold,
then the extraction algorithm can decide that the watermark
is detected.

 The implementation of this algorithm is quite simple..

Imperceptibility and Robustness of the Algorithm

 The visual quality of the image does not change significantly

because the watermark bits only change the least significant
bits of some pixels. Hence, the addition of the watermark to
an image using this algorithm is quite imperceptible.

 On the other hand, this algorithm is not very robust, due to

the same reason. As the least significant bits of pixels do not

11
 contribute to the image much, some attacker can possibly
zero out several least significant bits of all pixels of the
image and hence clear the watermark. This algorithm also
will not be robust against JPEG compression because it is
performed in the spatial domain and involves least
significant bits of the image pixels

Patchwork Algorithm

 This algorithm is an extension of the algorithm proposed by

Bender et. al. [3]. During the insertion process, n pixel pairs
are selected pseudo randomly using a secret key K. The
luminance values (ai, bi) of the n pixel pairs are then
modified slightly such that ai = ai + 1 and bi = bi – 1

 Extraction process retrieves the n pixel pairs which were

used in the encoding step. Then, the sum S = S (ai - bi) over
i=1 to nis computed.

 If the image actually contains a watermark, then the

expected value of the sum is 2n.Otherwise, it should be
approximately 0. This reasoning is based on the statistical
assumption that E[S] = S (E[ai]- E[bi]) = 0

 This assumption only holds if the pixel pairs are randomly

chosen and if they are independently and identically
distributed. However, this assumption is not quite true. Even
though it is not quite true, in my implementation of the
algorithm I saw that this is a good approximation. Hence, S
will be close to 2n if the image actually does contain the
watermark

Imperceptibility and Robustness of the Algorithm

 This algorithm also has imperceptible effects. This is due to

the fact that it does not significantly modify the image
pixels. However, robustness of this algorithm is not high.
Robustness of this algorithm depends on the assumption
based on E[S] being true.

 However, very basic pixel operations can invalidate this

assumption. My experiments with this algorithm showed that

12
 movement and translation of pixels, basic filtering
operations such as erosion and dilation change the values of
ai and bi such that the assumption on E[S] does not hold any
more. Hence, the watermark becomes undetectable.

Correlation-based Watermarking in the Spatial Domain

 This is a generalized algorithm that relies on correlational

techniques for the extraction of the watermark. Algorithms
of this class add some pseudorandom noise to the image as
the watermark.

 This noise (W(i,j)) is generated based on a secret key.

The only requirement for this noise is that it should be
uniformly distributed.

 Watermarked image, WI(x,y) is obtained using the following

equation: WI(i,j) = I(i,j) + k .W(i,j) (I is the original image
and k is a gain factor).To detect a watermark in an image
J(i,j), the correlation between J(i,j) and the watermark (noise
pattern) W(i,j) is calculated.

 If this correlation is greater than some predetermined

threshold, then the watermark detector concludes that the
given watermark W is present in image J. Otherwise, the
image is deemed to be non-watermarked. My
implementation of this algorithm estimates this correlation
using a fast algorithm provided.

 As it is the case with any watermark detector, a correlation-

based watermark detector can make two types of errors: It
can detect the existence of a watermark, although there is
none, or it can reject the existence of a watermark although
there is one.

Imperceptibility and Robustness of the Algorithm

 We can see that this algorithm does not impact the visual
quality if gain factor is kept small and noise pattern does not
contain large values. However, this algorithm suffers the

13
 same robustness problem described for the patchwork
algorithm.

 Translation , rotation, scaling significantly affect the

correlation values obtained and hence cause the watermark
to go undetected or destroyed. Similarly, JPEG compression
will also destroy the correlation between the watermarked
image and the watermark bits. Therefore, we still need better
algorithms that endure these operations.

CDMA Watermarking

 This technique is actually intended to increase the payload of

the watermark. Increasing the payload of the watermark
intelligently increases the probability that the watermark will
be detected using a correlation-based technique. This
technique is based on the use of Direct Sequence Code
Division Multiple Access (CDMA) spread spectrum
communications].

 For each bit bi of the watermark, a different independent

pseudorandom pattern Pi is generated that has the same size
as the image to be watermarked. This pattern is dependent
on the bit value bi. For example if bi is 0, Pi is added to the
image , else Pi is subtracted from the image. Mathematically,
the watermarked image can be expressed as follows:
WI ( i , j) = I ( i , j) + k .S ((-1)bi Pi) where k is the gain
factor.

 Hence, each watermark bit contributes a positive or negative

random pattern to the image to form the watermarked image.
Each bit bi of the watermark can be extracted by calculating
the correlation between normalized image J(i,j) and the
corresponding random pattern Pi. If the correlation is
positive, the watermark extraction algorithm decides that bi
is 0, otherwise bi is assumed to be 1.

Imperceptibility and Robustness of the Algorithm

 I found that this algorithm does not affect the visual quality
of the image if small gain factors are used.

14
 It is also somewhat resilient to JPEG compression, however
the probability that all watermark bits will be recovered after
compression is usually low.

 Although it is also more robust to scaling and filtering

compared to previously discussed algorithms, the
computation time required for this algorithm can be quite
high, especially if the number of watermark bits is high.

Watermarking Based on DFT Amplitude Modulation

 In the spatial domain, if the image is shifted a little bit, the

watermark extraction process will be disturbed greatly
because the pixels will now be translated to different
locations.

 Embedding the watermark in the DFT amplitude of the

image overcomes this problem. Due to the periodicity of the
image implied by DFT, cyclic translations of the image in
the spatial domain do not affect the DFT amplitude. A
watermark embedded in this domain is therefore translation
invariant.

 The embedding process consists of selecting which

amplitudes to modify to embed the watermark and
modifying them in such a way that image quality doesn’t
degrade. After selecting the DFT amplitude coefficients to
embed the watermark, these coefficients can be modulated
using the following equation [7]: WDFT(u,v)| = |DFT(u,v)|.
(1 + k.W(u,v)) (Equation 1) where k is the gain factor,
WDFT is the DFT of the watermarked image and W is the
watermark image. This equation makes the watermark image
content dependent.

Imperceptibility and Robustness of the Algorithm

 If a heavy watermark is embedded in low frequency

components, then the image quality is slightly degraded. On
the other hand, if the watermark is embedded in high
frequency components, it is very vulnerable to noise,
filtering and lossy compression. Therefore, I found it better

15
 to embed the watermark in mid-frequency components of the
DFT amplitude.

 Using this algorithm, I found that watermark is not affected

by shifting the image as expected. However, this algorithm
was still not strong against JPEG compression or geometric
transformations. Therefore, I implemented the following
algorithm to increase the robustness of the watermark
against JPEG compression. One other problem with using
DFT amplitude modulation is the fact that DFT amplitude
does not contribute too much to the image quality
Watermarking Based on DCT Coefficient Modulation

 None of the previously mentioned techniques are resilient

enough to JPEG compression. This technique embeds the
watermark in the DCT domain to increase the robustness of
the watermarking scheme against JPEG compression.

 The idea in this algorithm is very similar to DFT amplitude

modulation. The watermark bits are embedded in each 8x8
DCT block of the image. The embedding algorithm needs to
carefully choose where to embed the watermark bits in the
8x8 block. My argument is similar to DFT amplitude
modulation. It is not wise to embed the watermark bits in the
low frequency components of the DCT block, because these
coefficients are subject to heavy quantization during JPEG
compression.

 It is better to embed the watermark in mid or high frequency

DCT components. If the gain factor k is chosen small,
embedding the watermark in lowest frequency components
will be more desirable, because these components are the
ones that are least likely to be quantized in JPEG
compression. The actual modification of the selected DCT
coefficients

Imperceptibility and Robustness of the Algorithm

 This algorithm also does not affect the visual quality of the
image much if the gain factor is chosen as a small value
shows the watermarked image where the watermark is
embedded in mid-frequency components.

16
  The watermarking scheme preserves its robustness against
JPEG compression if the watermark bits are embedded in the
lowest frequency DCT coefficients. There are only a few
DCT coefficients in which the watermark can be embedded.
If we want to increase the payload of the watermark, then
these coefficients may need to be modified significantly
which probably will impact the quality of the image.
Therefore, it might be better to use a scheme which embeds
watermark bits into both low and mid-frequency DCT
coefficients.

Watermarking Based on HVS (Human Visual System)

 We would normally like to increase the energy of the

watermark (or payload of the watermark) in order to increase
its robustness. However, increasing the payload of the
watermark degrades the visual quality of the image such that
human eye will notice the degradation.

 A dual reasoning leads us to think that it might be better to

increase the payload of the watermark by embedding the
watermark bits into places where human eye will not detect
the changes to the image .This is because of the fact that
Human Visual System (HVS) is less sensitive to changes in
regions of high luminance.

 We can create a mask image that consists of those areas that

are less sensitive to distortions and modulate the watermark
bits using this mask image. This can be mathematically
expressed as :WI(i ,j) = I(i ,j) + Mask(i,j). k .W(i,j);W is the
watermark pattern (image), k is the gain factor, and Mask is
the mask image as mentioned above. In my implementation,
I generate the Mask image using an edge detection
algorithm. I convert the edge image into a binary image. It
amplify the effect of watermark bits by k on pixels where
edge image is ‘1’ and keep the effect of the watermark bits
minimal on pixels where edge image is ‘0’.This increases the
energy of the watermark along the edges in the image. use
the canny edge detector to extract the edge information out
of the image.

Imperceptibility and Robustness of the Algorithm

17
  Due to the exploitation of HVS, this algorithm does not
affect the visual quality of the image much. In fact it might
even sharpen some parts of the edges in the image.By
increasing theenergy of the watermark, the algorithm
becomes more robust compared to other spatial-domain
watermarking techniques.

 It can endure higher levels of compression.Unfortunately,

due to its implementation in the spatial domain, this scheme
is not robust against translation and shifting of the image
pixels.
Key Learnings

 It is not a good idea to hide the watermark in the

perceptually insignificant portions of the image. For
example, in the DFT domain, it is not really desirable to
embed the watermark in high frequency coefficients. This is
due to the fact that an unauthorized third party can easily
clear those coefficients and hence wipe out the watermark
without significantly affecting the quality of the image.
Therefore, a watermark that is hidden in low frequency DFT
components will be more robust.

 Frequency domain techniques are usually more robust than

spatial domain techniques due to their shift and translation
invariant properties. Especially, use of DCT domain
techniques increases the resilience of the watermarking
algorithm against JPEG compression..

 Exploitation of the properties of Human Visual System can

increase the robustness and imperceptibility of the
watermark. Especially techniques that would exploit HVS in
DFT and DCT domains would lead to robust watermarking
systems.

APPLICATIONS OF DIGITAL WATERMARKING

A number of application areas, with different

requirements and limitations, have been envisioned for data hiding.

 Copyright protection and finger printing;

18
 Authentication for data integrity check

 Covert communication
 Labelling and annotations.

In a practical application, the watermarking techniques can also

trace the illegal users (forensic watermarks) so that the owner can
approach the regulating authority. In fingerprint watermarking the
buyer and seller information with date stamp can regulate
copyright infringement.

ATTACKS ON WATERMARKS

19
2. MODULAR DESCRIPTION:
Data Design:
Embedding:
Message File: The data to be concealed.

20
Cover File: The file which will be used to hide the message (also called a
carrier or a container.)

Algorithm: This algorithm to be used to embed the message one wants to hide
within the carrier using a watermarking technique which give Stego-file as
output.

Marked-file: The watermarked image is output of the System at sender end

and input at the receiver end.

Communication Channel: The Communication Channel is any transmission

medium.

Extracting:

Input: Input as secret key, marked image.

Validation: Validation of the secret key as authentication.

Extraction of watermark: This module is to retrieve the watermark from the

marked image using a extraction algorithm .

Output:
Produces watermark as output.

FORMULATION
Class diagram:

21
 watermarktool

show_cover()
show_message()
show_cover_size()
show_message_size()
hide

select_cover() extract
select_message()
hide_process() extracting_process()
select_watermarkimage()

embed the message file into

extract message file from cover
the cover
file

Use case diagram (Hiding):

22
Use case diagram (Extracting):

23
Sequence diagram :

Hiding Extracting

: watermarktool
: user

Select coverfile( )

show_message file( )

Hide( )

password entered( )

password validation( )

yes continue( )

embed message into cover( )

4.2.3 Collaboration
diagram:

24
 8: Key validation
11: Embed message into cover
1:Select mark image
3:Select message file
5:Hide
7:key entered
10:
Yes continue
user
Wm tool

2: Show cover
4: Show message
6: Enter key
9: Valid continue?
12:
Mark image

Fig 4.8: Collaboration diagram (Hiding)

4: Key validation
7: Extraction process

Select markimage
1:
3: Key entered
6: Yes continue

user Wm
tool l
2: Enter key
Valid continue
5:
Data Extracted
8:

Fig 4.9: Collaboration diagram (Extracting)

4.2.5 Activity Diagram:

Provide mark image 25

 Provide key

Select destination for retrieve data Verify key

2. Retrieving process:

Yes
Valid user?

No

Notify user

Re enter

key
Unhide

Display retrieve data

Fig 4.12: Activity diagram (Hiding)

Select carrier image

26
Provide secret data
 Provide key

Select destination mark image

User reenters data Validate key and data

Valid user? Yes

No

Notify user

Hide

Display mark image

Fig 4.13: Activity diagram (Extracting)

4.3 DATA FLOW DIAGRAM

27
 4.3.1 Hiding:
Level 0
Embedding
algorithm
cover image water marked image
watermark

Level 1

Carrier Image User Notification

Input Validate
Data Data Valid Data
key

Data
Compression
Data File

Compressed data

DCT
Operation

Dct Coefficients

Quantize
Embedding
Operation

Quantized Dct
DCT Coefficients
Coefficient
Quantization Table
+ Data

De-Quantize IDCT
Operation

Quantized Dct
Coefficients
4.3.2 Extracting: Stego Image

Display
Level 0

28
 Extraction algorithm
watermarked image original image
watermark

Level 1

User Notification
key

Accepting Data Validate

Data Data
Valid Data

DCT
Operation

mark Image

Dct Coefficients

Retrieval Quantize
Operation

Quantized Dct
Coefficients
Compressed
Data file Quantization Table

De - Compression
Display

Data File

Fig 4.14: Data flow diagram (Hiding)

29
PERT CHART

30
GANTT CHART

31
 4. PROGRESS

So far, we have completed coding, testing and implementation of the

following tasks of the project :
 Hiding frame.

 Extracting frame.

 Validation frame (Hiding).

 Validation frame (Extracting).

As of now, the user can only validate into the system using the password
provided by the administrator. In future, the application will also provide the
following functionalities:
 Hiding of image.
 Extracting of image.
 Compression of image.
 Secure sending of image from source to destination.
 Retrieval of image at destination.
 De-Compression of image.
 Displaying the image.

32
33
34
 5. CONCLUSION

Protecting intellectual property is currently a “hot” topic for

scholars, for university administrators and for the media and
publishing industries. This has drawn lawyer, legislators and
computing service professionals. For fine
arts and manuscript sources, quality of representation in the
Internet and other digital images distributions is as important to the
curators as aspects more commonly considered intellectual
property rights. It exists for entertainment companies, museums
and libraries because it offers the promise of better protecting their
multimedia content from piracy. The possibilities for digital
watermarks in the fields of geo-imaging and e-commerce are only
just being realized. Watermarking can support a broad range of
imaging data types whilst supporting industry standards security
implementations.

35
 APPENDIX A

LIST OF FIGURES: FIGURE

PAGE NOS.

WATERMARK DEFINITION 3

PROPOSED STEGNOGRAPHY SYSTEM 5

GANTT CHART 11

CLASS DIAGRAM 12

COMPONENTDIAGRAM 13

DEPLOYMENT DIAGRAM 14

USE CASE DIAGRAM ( HIDING ) 15

USE CASE DIAGRAM (EXTRACTING) 16

SEQUENCE DIAGRAM (HIDING) 17

SEQUENCE DIAGRAM (EXTRACTING) 18

COLLABORATION DIAGRAM (HIDING) 19

COLLABORATION DIAGRAM (EXTRACTING) 19

STATE DIAGRAM (HIDING) 20

STATE DIAGRAM (EXTRACTING) 21

ACTIVITY DIAGRAM (HIDING) 22

ACTIVITY DIAGRAM (EXTRACTING) 23

DATA FLOW DIAGRAM (HIDING) 24

DATA FLOW DIAGRAM (EXTRACTING) 25

36
 REFERENCES

1. WEBSITES:
 www.google.com

 www.w3schools.com

 www.programmingtutorials.com

 www.IEEE.org

 http://www.eurecom.fr/util/publidownload.en.htm?id=975

2. MATLAB 7 HELP TUTORIAL.

3. BOOKS:
 INTRODUCTION TO DIGITAL IMAGE PROCESSING WITH MATLAB BY
ALASDAIR MCANDREW

 DIGITAL IMAGE PROCESSING BY GONZALEZ & WOODS

37