WATERMARKING: It is nothing but adding information to an object about it.

It is a well-known old technique.

Eg: In olden days information tattooed on slaves shaved head for hiding
the information.
Watermark can be found in currency note also. It is impossible to remove.

1. Watermark (signature) on 10 dollars note.

DIGITAL WATERMARKING: Applying watermarking technique to digital
signal is known as digital watermarking. It can be applied to digital signals like
images, video, text, and audio.
WATERMARKING: Adding watermark to image is nothing but image
watermarking.

Images can be categorized into 3 types depending on their bit

representation [13, 14].

1)

Binary image. (1 bit per pixel)

2) Gray scale image. (8 bits per pixel)

3) Color image or RGB image. (24 bits per pixel, 8 bits for each color)

. BASIC TERMS:
WORK: A specific copy of some electronic signal, such as a song, a video or a
picture.
COVER WORK: The original unwater marked work. Since it covers (hides)
watermark. Here cover work is a color image.
WATERMARK: The message being embedded, indicating some info about
the work. Here watermark is gray scale (64*64) water mark.
WATERMARKED IMAGE: Final image after adding watermark is
called as watermarked image.
WATERMARK FEATURES :
Watermarks are imperceptible.
Watermarks are inseparable from the works.
Watermarks undergo the same transformations as the work.
APPLICATIONS OF DIGITAL WATERMARKING :
Owner identification.
Proof of ownership.
Broadcast monitoring.
Transaction tracking.
Copy control.
Device control.

CLASSIFICATION OF WATERMARKS:

Watermark algorithms can be classified on several criteria as given below.

Based on type of the document.

(Text or image or audio or video).

Based on visibility. (Visible, invisible).

Based on robustness. (Robust, fragile, semi-fragile).
Based on perceptibility. (Perceptible, imperceptible).
Capacity. (Zero-bit long or N-bit long).
Embedding method. (Spread spectrum, quantization type, amplitude
modulation).
The embedding method here is spread spectrum and watermark is
invisible in final watermarked image.

WMI QUALITY ASSESSMENT FACTORS:

There are four essential factors those are commonly used to determine
quality of watermarking scheme. They are robustness, imperceptibility,
capacity, and blindness.
ROBUSTNESS: Watermark should be difficult to remove or destroy. Robust is
a measure of immunity of watermark against attempts to image modification
and manipulation like compression, filtering, rotation, scaling, collision attacks,
resizing, cropping etc.
IMPERCEPTIBILITY: Cover and digital watermarked image are
close to perceptually indistinguishable.
CAPACITY: It includes techniques that make it possible to embed
majority of information.
BLIND WATERMARKING: Extraction of watermark from watermarked
image without original image is preferred because sometimes its impossible to
avail original image.
But here non-blind watermarking is used. Original cover work is required
to retrieve the watermark.

RECENT TECHNOLOGIES:
In order to enable the digital watermark to have the good
transparency and robustness, many techniques for adding the watermark are
proposed. Among all the techniques wavelet theory is a major breakthrough
over Fourier transform, which is used early in watermarking technologies. Due
to the advantages of the energy accumulation in the field of digital
watermarking, this theory has been widely applied [15,9]. The success of
wavelets is mainly due to the good performance for piecewise smooth functions
in one dimension. Chittaranjan Pradhan et al. have discussed a non-blind digital
image watermarking algorithm based on Discrete wavelet transform, Cross
chaotic map and Arnold transform and shown that the DWT leads to better
results. Unfortunately, such is not the case in two dimensions. In essence,
wavelets are good at catching zero-dimensional or point singularities, but twodimensional piecewise smooth signals resembling images have one-dimensional
singularities. That is, smooth regions are separated by edges, and while edges
are discontinuous across, they are typically smooth curves. Intuitively, wavelets
in two dimensions are obtained by a tensor-product of one- dimensional
wavelets and they are thus good at isolating the discontinuity across an edge,
but will not see the smoothness along the edge.

To overcome the weakness of

wavelets in higher dimensions, Cands
and Donoho[8,10,11], recently proposed
a new system of representations named
ridgelets which deal effectively with line
singularities in 2-D. The basic idea is to
map a line singularity into a point
singularity using the Radon transform.
Then, the wavelet transform will be
applied to effectively handle the point
singularity in the Radon domain .

After this people start using ridgelet transformation for adding the
watermark. Yuancheng Li has discussed a method to embed the watermark by
first transforming watermark image by Arnold Scrambling method, and then
embedding into the lowest frequency sub band in Ridgelet Transform domain.
Patrizio Campisi et al. has discussed a watermarking method based on Ridgelet
Transform technique .

But the default radon function used to get ridgelet transform is not
accurate and gives more error if the discontinuities in the image are high. So In
this modified ridgelet transformation is used for adding and retrieving the
watermark to the colour image. In this chapter basic things about ridgelet,

radon, and wavelet transforms and about watermark are discussed. In chapter3
two methods are proposed were given. In chapter 4 the results and observations
are given.

PERFORMANCE EVALUATION OF DIGITAL IMAGE

WATERMARKING ALGORITHMS [16]:
The quality of the watermarked image is measured by PSNR (Peak
Signal to Noise Ratio). Bigger is PSNR, better is quality of watermarked
image. PSNR for image with size m x n is given by:

MSE mean squared error.

PSNR peak signal to noise ratio.
MAX is the maximum index value that can be given to a pixel (in this case it
is 255).
RIDGELET TRANSFORM [10]:
1-D wavelet transform on radon transform is nothing but ridgelet
transform. To get ridgelet transform first apply radon transform on the
image and then apply wavelet transform on the radon transform.
For inverse ridgelet transform first apply inverse wavelet and then apply
inverse radon transform.

RADON TRANSFORM: It is nothing but integral transform of the

integral of a function over straight lines[18,17,16].

GEOMETRY OF 2D RADON TRANSFORM:

1) x,y are input coordinates.
2) f(x,y) is input function.
3) ,s are output coordinates.
4) F(,s) is the output function.
5) Where measures the counter-clockwise
Angle of the normal to the line from the
2). Geometry of 2D radon
Horizontal axes, ands is the distance of the line from the origin of the x,y
plane.

RADON FUNCTION:
Function for radon in matlab is [R x] = radon(I,theta);
Function for iradon is I = iradon(R,theta).
R = radon (I, theta) returns the Radon transform R of the intensity image I for the
angle theta degrees. If theta is a scalar, R is a column vector containing the Radon
transform for theta degrees. If theta is a vector, R is a matrix in which each
column is the Radon transform for one of the angles in theta. If you omit theta, it
defaults to 0:179.
[R,x] = radon (...) returns a vector x containing the radial coordinates
corresponding to each row of R.
The radial coordinates returned in x are the values along the x'-axis, which is
oriented at theta degrees counterclockwise from the x-axis. The origin of both axes
is the center pixel of the image.
Generally theta = [0: dtheta: 179.99]
If dtheta is very less then reconstructed image clarity will be more. So dtheta
value taken as 0.1(small) in next applications. This can be observed in the figures
5,6,7,8 in chapter 3.
The same radon function is used in method2 in chapter3. But we will apply radon
transform to scaled image.

WAVELET TRANSFORM: There are so many types of wavelet transforms

are available. Among them haar-wavelet transform was taken to get ridgelet
transform.
HAAR-WAVELET:
f -> (aL|dL) ; a - average coefficients, ddetail coefficients.
aL = (a1,a2,a3,..aN/2),
dL = (d1,d2,d3,...dN/2);
a(m)= (f(2m)+f(2m-1))/2, d(m)= (f(2m)-f(2m-1))/2,
To apply HWT on an image first apply one level HWT on each row, then to
each column of resulting image. The resulted image decomposed into four sub
band LL, HL, LH, HH. Where LL contains approximation of original image and
others contain missing details.
INVERSE HAAR_WAVELET TRANSFORM:
f = (a1-d1,a1+d1,.aN/2-dN/2,aN/2+dN/2).
To apply IHWT on image first apply one level inverse haar-wavelet to each
column and secondly to each row.