\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Robust Image Watermarking in contourlet Domain Using Genetic Algorithm},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-04-30 (revised: 30 April 2011)}
\def\TheID{10.34257/GJCSTVOL11IS9PG9\makeatother }
\def\TheDate{2011-04-30}
\title{Robust Image Watermarking in contourlet Domain Using Genetic Algorithm}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Dr.  A.Arulmurugan}

             \affil[1]{  SRI RANGAPOOPATHI COLLEGE OF ENGINEERING(ANNA UNIVERSITY,CHENNAI)}

\renewcommand\Authands{ and }

\date{\small \em Received: 21 March 2011 Accepted: 18 April 2011 Published: 30 April 2011}

\maketitle


\begin{abstract}
        


In this paper objective is to develop a robust image watermarking method in contourlet domain using GA(Genetic Algorithm) to improve the quality and robustness of the watermarked image, by reducing the (BER)Bit Error Rate to with stand against common image processing attacks. Selecting more Co-efficient in more directions is achieved by means of combining Laplacian Pyramid with Directional filter bank structure which captures directional information efficiently.

\end{abstract}


\keywords{Image W atermarking Genetic Algorithm(GA) Bit E rror Rate(BE R) E xtraction Algorithm; E mbedded Algorithm W atermarking Techniue phrase peak signal-t}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\begin{textblock*}{10cm}(1.05cm,3cm)
{{\textit{CrossRef DOI of original article:}} \underline{10.34257/GJCSTVOL11IS9PG9}}
\end{textblock*}\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
igital Watermarking is the process of possibly irreversibly embedding information into a digital signal. The signal may be audio, video, or pictures for example. If the signal is copied then the information is also carried in the copy.\par
In visible watermarking, the information is visible in the picture or video. Typically, the information is text or a logo which identifies the owner of the media. The image on the right has a visible watermark. When a television broadcaster adds its logo to the corner of transmitted video, this is also a visible watermark.\par
In invisible watermarking, information is added as digital data to audio, picture or video, but it cannot be perceived as such (although it may be possible to detect that some amount of information is hidden). The watermark may be intended for widespread use and is thus made easy to retrieve or it may be a form of Steganography, where a party communicates a secret message embedded in the digital signal. In either case, as in visible watermarking, the objective is to attach ownership or other descriptive information to the signal in a way that is difficult to remove. It is also possible to use hidden embedded information as a means of covert communication between individuals.\par
One application of watermarking is in copyright protection systems, which are intended to prevent or deter unauthorized copying of digital media. In this use a copy device retrieves the watermark from the signal before making a copy; the device makes a decision to About -Sri Rangapoopathi College of Engineering watermark is embedded into a digital signal at each point of distribution. If a copy of the work is found later, then the watermark can be retrieved from the copy and the source of the distribution is known. This technique has been reportedly used to detect the source of illegally copied movies.\par
While some file formats for digital media can contain additional information called metadata, digital watermarking is distinct in that the data is carried in the signal itself.\par
The use of the word of watermarking is derived from the much older notion of placing a visible watermark on paper.  
\section[{b) Advantages Of Contourlet Domain}]{b) Advantages Of Contourlet Domain} 
\section[{?}]{?}\par
Contourlet possesses the important properties of directionality and anisotropy which wavelets do not possess and so it outperforms wavelets in many image processing applications. 
\section[{?}]{?}\par
Contourlet provides a much richer set of directions and shapes than wavelets and thus is more efficient in capturing smooth contours. 
\section[{?}]{?}\par
Contourlet is a multidirectional and multi-scale transform and is obtained by combining both directions can be specified by the user. 
\section[{?}]{?}\par
Contourlet gives more edges, it is more suitable for data hiding applications and more data can be hidden in the high frequency regions without perceptually distorting the original image. 
\section[{c) Image Processing with MatLab}]{c) Image Processing with MatLab}\par
Image processing is a very important and widely used process in which images are processed to retrieve information that is not visible to the naked eye, as well as it i s used in a large number of other applications where the standard picture is not enough.\par
The first step is to download all the 'jpg' and 'tif' files that are to be used in this lab. Locate them as a link on the webpage.\par
The second step is to set the directory of MatLab to the directory which contains your\textbackslash  image files. Be sure that you create this directory on your U-drive. We can do this by first typing cd on the MatLab prompt. Usually the default setting is: c:\textbackslash MatlabR12\textbackslash work\par
If this is so, change the directory by simply typing cd.. which changes the directory to c:\textbackslash Matlab. We can repeat the step to go to C:\textbackslash  drive and then type cd d:\textbackslash . This will change the MatLab directory to our'd' drive. In order to read the image use the following command in MatLab imread('filename'); This command will save the image in the Image detail module.\par
Since bitmap images are fairly large, they take a long time to convert into matrices. Hence we stick to jpeg and tiff image formats in this lab.  
\section[{III.}]{III.} 
\section[{Embedding phase}]{Embedding phase} 
\section[{©. Genetic Operator}]{©. Genetic Operator}\par
This function is used to produce offsprings from parent chromosomes by the set of selected chromosomes. Function f = genetic operator (parent chromosome, M, V, mu, mum, l\textunderscore limit, u\textunderscore limit) Where, M -Number of objective functions. V -Number of decision varaiables. Mu -distribution index for crossover. Mum -distribution index for mutation. l\textunderscore limit -a vector of lower limit for the Corresponding decision variables. u\textunderscore limit -a vector of upper limit for the corresponding decision variables. 
\section[{iii. Selection}]{iii. Selection}\par
The individuals are selected by using their rank that is obtained through their fitness value and it is continued till the cross-over area gets filled. Before that checking of every individuals contains the same number of elements is performed.\par
Function tournament\textunderscore selection (chromosome, pool\textunderscore size, tour\textunderscore size) 
\section[{Tournament selection process}]{Tournament selection process}\par
In a tournament selection process n individuals are selected at random, where n is equal to tour\textunderscore size. From these individuals only one is selected and is added to the mating pool, where size of the mating pool is pool\textunderscore size. Selection is performed based on two criteria. First and foremost is the rank or the front in which the solutions reside. Individuals with lower rank are selected. Secondly if the rank of two individuals is the same then, the crowding distance is compared. Individuals with greater crowding distance are selcted.The size of chromosome is taken. The number of chromosome is not important while the number of elements in chromosome is important. iv. 
\section[{Cross over and Mutation}]{Cross over and Mutation}\par
Cross over operation is performed by using the probability with 90\%. Two individuals are selected and it is checked that the selected two individuals for cross over operation not the same. The information of the two selected parent chromosomes is collected and the cross over operation is performed for each decision variable in the parent chromosome.\par
Function f= replace\textunderscore chromosome (intermediate\textunderscore chromosome,pro,pop)\par
This function replaces the chromosomes based on rank and crowding distance. Initially until the population size is reached each front is added one by one until addition of a complete front which results in exceeding the population size. At this point the chromosomes in that front are added subsequently to the population based on crowding distance. ? C i,k = Child. ? p i,k = Selected parent. ? = Random 
\section[{S.}]{S.}\par
No.G4 G3 G2 G1 Fitness Rank C1 0 1 0 0 4 1 C2 1 0 0 0 8 2 C3 1 1 0 0 12 4 C4 1 0 1 0 10 3 Table 1: Rank Calculation\par
Mutation is performed with a probability of 10\% and it is based on polynomial mutation. Mutation is performed on the selected element of the chromosome and the selected element is inverted or reversed to obtain a new child as a resulting chromosome.C k =p ike +(p k u -p k t) ? k. ? ? c 1, k= 1 2 [(1-)p1,k+(1+ )p2,k] ? ? k k p( ) = 1 2 (n +1) ,if 0 1 ? ? c c ? n ©2011 Global Journals Inc. (US)\par
Where, Ck is the child. Pk is the parent. P k u is the upper bound on the parent component. P k t is the lower bound on the parent component. ? k is small variation which is calculated from a polynomial distribution. if rk < 0.5 if rk >0.5\par
Where, rk is an uniformly sampled random number between (0,1).\par
is mutation distribution index. 
\section[{After Mutation Table 4: After Mutation v. Embedding Algorithm}]{After Mutation Table 4: After Mutation v. Embedding Algorithm}\par
In Embedding phase, an image that is transformed into binary format is inserted in the original image as the watermark.\par
The Embedding Algorithm is as following: 1. The original image is decomposed into its sub bands using contourlet transform. In Contourlet, the number of directional subbands at each level is set to 2n where n is a positive integer number. Forexample, if we choose to decompose an image into four levels using n= (1, 2, 3, 4) then we get 2, 4, 8, and 16 subbands Where, X: input image. Fname: filter name.\par
n: number of decomposition tree levels.  
\section[{S. No}]{S. No}1 n +1 k = 1-[2(1-r )] k m ? n +1 k = (2r ) k m 1 -1 ©2011 Global Journals Inc. (US)\par
3. The Sub band Co-efficients is selected by using a threshold value. 4. Genetic algorithm is applied to the Co efficient to increase the robustness and quality simultaneously. 5. Then the watermarks are embedded in the selected Co-efficients.\par
In order to embed a zero bit in a Contourlet sub band, the standard deviation of its coefficients magnitude is set to zero. A one bit, is inserted with an increase in this standard deviation.\par
The following rules are used for embedding: a. If watermark bit is zero, b.To insert one bit, the sub band coefficients will be changed as equation Where, sign is the sign function.\par
?i is a positive constant.    
\section[{Performance Evaluation a) PSNR}]{Performance Evaluation a) PSNR}\par
The phrase peak signal-to-noise ratio, often abbreviated PSNR, is an engineering term for the ratio between the maximum possible power of a signal and the power of corrupting noise that affects the fidelity of its representation. Because many signals have a very wide dynamic range, PSNR is usually expressed in terms of the logarithmic decibel scale.\par
The PSNR is most commonly used as a measure of quality of reconstruction of lossy compression codecs (e.g., for image compression). The signal in this case is the original data, and the noise is the error introduced by compression. When comparing compression codecs it is used as an approximation to human perception of reconstruction quality, therefore in some cases one reconstruction may appear to be closer to the original than another, even though it has a lower PSNR (a higher PSNR would normally indicate that the reconstruction is of higher quality). One has to be extremely careful with the range of validity of this metric; it is only conclusively valid when it is used to compare results from the same codec (or codec type) and same content.\par
It is most easily defined via the mean squared error (MSE) which for two m×n monochrome images I and K where one of the images is considered a noisy approximation of the other is defined as:\par
The PSNR is defined as:\par
Where, m is the number of watermark bits and BER represent bit error rate. Embedded watermark is extracted completely, if BER is equal to zero. In digital transmission, the bit error rate or bit error ratio (BER) is the number of received bits that have been altered due to noise, interference and distortion. It is find out by the difference in the no. of bits that are embedded in the original image and the watermarks that are extracted from the watermarked image. 
\section[{SI.}]{SI.}\par
No.  
\section[{Attacks}]{Attacks} 
\section[{CONCLUSION aND FUTURE ENHANCEMENT}]{CONCLUSION aND FUTURE ENHANCEMENT}\par
Robustness and fidelity are two major requirements in image watermarking that have opposite effect on watermarked images. There are a few methods that provide high robustness against other common image processing attacks, simultaneously.\par
The aim of this work is to improve the robustness against common image processing attacks. In this regard, the watermarking technique is improved by selecting the larger coefficients of third level Contourlet transform to ensure higher robustness and determine the variation of coefficients constants using Multi-Objective Genetic Algorithm. MOGA provides a good balance between the robustness and the fidelity requirements, but it increases the running time in embedding phase.\par
To show the superiority of this method, experimental results obtained by watermarking is compared with standard image using this method. As shown in experimental results section this method shows improvement in robustness against common image processing attacks (blurring, histogram equalization, sharpening, noise addition and median filter).\par
This algorithm can be implemented in latest transform domains such as Curvelet and D-Tree Complex Wavelet to use their potential capabilities. In curvelet selecting more coefficients in multiple directions is possible and in D-Tree complex wavelet using the coefficients in both phase and magnitude is possible. In addition, introducing new approaches for specifying the significant triplets can result to select more reliable coefficients (in term of robustness) for watermarking. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}?}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3102}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 3 : 10 MayFigure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{67113}\includegraphics[]{image-6.png}
\caption{\label{fig_4}6 .Figure 7 : Extraction Process Steps 1 . 13 May}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{68}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 6 :Figure 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9111314101415}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 9 :Figure 11 :Figure 13 : 14 MayFigure 10 :Figure 14 :Figure 15 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{17}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 17 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.54453125\textwidth}P{0.033203125\textwidth}P{0.046484375\textwidth}P{0.046484375\textwidth}P{0.046484375\textwidth}P{0.1328125\textwidth}}
\multicolumn{3}{l}{Operations of Cross over}\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{Selected Individuals}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
S. No.\tabcellsep G4\tabcellsep G3\tabcellsep G2\tabcellsep G1\tabcellsep Fitness\\
C3\tabcellsep 1\tabcellsep 1\tabcellsep 0\tabcellsep 0\tabcellsep 12\\
C4\tabcellsep 1\tabcellsep 0\tabcellsep 1\tabcellsep 0\tabcellsep 10\\
\multicolumn{2}{l}{After Cross over}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{S. No. G4}\tabcellsep G3\tabcellsep G2\tabcellsep G1\tabcellsep Fitness\\
C34\tabcellsep 1\tabcellsep 1\tabcellsep 1\tabcellsep 0\tabcellsep 14\end{longtable} \par
 
\caption{\label{tab_0}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.85\textwidth}}
2011\\
May\\
11\\
Volume XI Issue IX Version I\\
Global Journal of Computer Science and Technology\end{longtable} \par
  {\small\itshape [Note: k ?]} 
\caption{\label{tab_1}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5} \par 
\begin{longtable}{P{0.05354330708661417\textwidth}P{0.36141732283464567\textwidth}P{0.22755905511811025\textwidth}P{0.20748031496062994\textwidth}}
\tabcellsep \tabcellsep BER\tabcellsep BER\\
\tabcellsep \tabcellsep (Contourlet)\tabcellsep (Wavelet)\\
1.\tabcellsep Blurring\tabcellsep 10/72\tabcellsep 14/72\\
2.\tabcellsep Median\tabcellsep 13/72\tabcellsep 17/72\\
\tabcellsep filtering\tabcellsep \tabcellsep \\
3.\tabcellsep Histogram\tabcellsep 2/72\tabcellsep 4/72\\
\tabcellsep Equalization\tabcellsep \tabcellsep \\
4.\tabcellsep Sharpening\tabcellsep 11/72\tabcellsep 16/72\end{longtable} \par
 
\caption{\label{tab_3}Table 5 :}\end{figure}
 			\footnote{MayRobust Image Watermarking in contourlet Domain Using Genetic Algorithm ©2011 Global Journals Inc. (US)} 			\footnote{MayRobust Image Watermarking in contourlet Domain Using Genetic Algorithm This page is intentionally left blank ©2011 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ ©2011 Global Journals Inc. (US)]{b3}\label{b3} 	 		\textit{},  	 	 		\textit{©2011 Global Journals Inc. (US)}  		 	 
\bibitem[ Asia Pacic Symposium on Intelligent and Evolutionary Systems ()]{b9}\label{b9} 	 		\textit{},  	 	 		\textit{Asia Pacic Symposium on Intelligent and Evolutionary Systems}  		2004. p. .  	 
\bibitem[Deb et al. (2002)]{b7}\label{b7} 	 		‘A Fast Elitist Multi-objective Genetic Algorithm: NSGA-II’.  		 			Kalyanmoy Deb 		,  		 			Amrit Pratap 		,  		 			Sameer Agarwal 		,  		 			T Meyarivan 		.  	 	 		\textit{IEEE Transactions on Evolutionary Computation}  		April 2002. 6  (2)  p. .  	 
\bibitem[Guiduo Duan et al. (2008)]{b1}\label{b1} 	 		‘A novel non-redundant contourlet transform for robust image watermarking against non geometrical and geometrical attacks’.  		 			A T S Guiduo Duan 		,  		 			Xi Ho 		,  		 			Zhao 		.  	 	 		\textit{5th International Conference on Visual Information Engineering},  				 (Xi'an, China)  		2008. 29 July-1 Aug. 2008. p. .  	 
\bibitem[Miller et al. ()]{b10}\label{b10} 	 		‘A review of watermarking principles and practices’.  		 			M L Miller 		,  		 			I J Cox 		,  		 			J M G Linnartz 		,  		 			T Kalker 		.  	 	 		\textit{IEEE International Conference on Image Processing},  				1997.  	 
\bibitem[Kundur and Hatzinakos ()]{b12}\label{b12} 	 		‘A Robust Digital Image Watermarking Scheme Using the Wavelet-Based Fusion’.  		 			D Kundur 		,  		 			D Hatzinakos 		.  	 	 		\textit{1997 International Conference on Image Processing},  				1997. 1.  	 	 (icip) 
\bibitem[Hong and Smith ()]{b5}\label{b5} 	 		‘An octave-band family of non-redundant directional filter banks’.  		 			P Hong 		,  		 			M J T Smith 		.  	 	 		\textit{IEEE proc. ICASSP},  				2002. 2 p. .  	 
\bibitem[Liu and Tan (2002)]{b11}\label{b11} 	 		‘An SVD-based watermarking scheme for protecting rightful ownership’.  		 			R Liu 		,  		 			T Tan 		.  	 	 		\textit{IEEE Trans. on Multimedia}  		March 2002. 4  (1) .  	 
\bibitem[Po and Do ()]{b4}\label{b4} 	 		‘Directional multiscale modeling of images using the contourlet transform’.  		 			DD 		,  		 			.-Y Po 		,  		 			M N Do 		.  	 	 		\textit{IEEE Trans. On Image Processing}  		2003. p. .  	 
\bibitem[Maity and Kundu (2004)]{b16}\label{b16} 	 		 			S P Maity 		,  		 			M K Kundu 		.  		\textit{A blind cdma watermarking scheme in wavelet domain. IEEEInt. Conf Image Processing},  				Oct. 2004. p. .  	 
\bibitem[Swanson et al. ()]{b13}\label{b13} 	 		‘Multimedia data embedding and watermarking technologies’.  		 			M D Swanson 		,  		 			M Kobayashi 		,  		 			A H Tewfik 		.  	 	 		\textit{Proceed. of the IEEE}  		1998. 86  (6)  p. .  	 
\bibitem[Hans et al. (2001)]{b6}\label{b6} 	 		‘On Self-Adaptive Features in Real-Parameter Evolutionary Algorithm’.  		 			Georg Hans 		,  		 			Kalyanmoy Beyer 		,  		 			Deb 		.  	 	 		\textit{IEEE Transactions on Evolutionary Computation}  		June 2001. 5  (3)  p. .  	 
\bibitem[Mohan and Kumar ()]{b0}\label{b0} 	 		‘Robust Digital watermarking scheme using Contourlet transform’.  		 			B 		,  		 			Chandra Mohan 		,  		 			S.Srinivas Kumar 		.  	 	 		\textit{International Journal of Computer Science and Network Security}  		2008. p. .  	 	 (Korea) 
\bibitem[Cox et al. (1997)]{b14}\label{b14} 	 		‘Secure spread spectrum watermarking for multimedia’.  		 			J Cox 		,  		 			F T Kilian 		,  		 			T Leigton 		,  		 			Shamoon 		.  	 	 		\textit{IEEE Trans. on Image Processing}  		Dec. 1997. 6 p. .  	 
\bibitem[Raghuwanshi and Kakde]{b8}\label{b8} 	 		‘Survey on multiobjective evolutionary and real coded genetic algorithms’.  		 			M M Raghuwanshi 		,  		 			O G Kakde 		.  	 	 		\textit{Proceedings of the 8th},  				 (the 8th)  		 	 
\bibitem[Do and Vetterli ()]{b2}\label{b2} 	 		‘The contourlet Transform: An efficient directional multi resolutional image representation’.  		 			Minh N Do 		,  		 			M Vetterli 		.  	 	 		\textit{IEEE transactions on Image Processing},  				 (New York, NY)  		2005. Institute of Electrical and Electronics Engineers. p. .  	 
\bibitem[Do and Vetterli (2005)]{b15}\label{b15} 	 		‘The contourlet transform: An efficient directional multiresolution image representation’.  		 			M N Do 		,  		 			M Vetterli 		.  	 	 		\textit{IEEE Trans. on Image Processing}  		Dec. 2005. 14  (12)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
