\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={Digital Watermarking Digital Data Hiding techniques for BMP Images},
 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{2012-01 2012-05-15 (revised: January 2012 15 May 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01 2012-05-15}
\title{Digital Watermarking Digital Data Hiding techniques for BMP Images}
\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. Tripat Deep Singh  Dua}

             \affil[1]{  GURU NANAK INSTITUTE OF MANAGEMENT AND TECHNOLOGY MODEL TOWN LUDHIANA , PUNJAB INDIA}

\renewcommand\Authands{ and }

\date{\small \em Received: 14 April 2012 Accepted: 2 May 2012 Published: 15 May 2012}

\maketitle


\begin{abstract}
        


Purpose: This research evaluates the digital watermarking technology further for hide/retrieved data into the BMP file by manipulating the contents their pixel value using least significant bits (LSB) approach. Methodology: Various experiments have been applied on the pixel value of the BMP file to hide/store the maximum data. With a condition the size and the quality of the BMP file will not change. The trail and error methods have been used or applied to check the various sizes with various qualities. Findings: The study finds that the any digital data can be hiding into the BMP file by manipulating the contents of the Red Green Blue (RGB) value by applying least significant approach. Originality/Value: Due to the growing usage of multimedia content on the internet, serious issues have emerged. Counterfeiting, forgery fraud and pirating of this content are rising. The research is a mechanism which can help resolve the ownership issues for digital data.

\end{abstract}


\keywords{Digital watermarking, Digital Data, 24 bit BMP Image, Red Green Blue (RGB) pixel Value, Least Significant Bit (LSB), lower order bits, Copy right, Tra}

\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*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
ue to the growing usage of multimedia content on the internet, serious issues have emerged. Counterfeiting, forgery fraud and pirating of this content are rising. Virtually anyone with a sound card, scanner, video frame grabbers or multimedia authoring systems allow them to incorporate copyrighted material into presentations, web designs and internet marketing campaigns. A simple search on any of the search engines returns hundreds and thousands of images which can be easily downloaded on to a personal computer. The desire for the availability of information and quick distribution has been a major factor in the development of new technology in the last decade. There is the increased use of multimedia across the internet. Multimedia distribution has become an important way to deliver services to people around the world. It is commonly applied in internet marketing campaigns and electronic commerce web sites.\par
Digital Watermarking describes methods and technologies that hide information on bmp images, for example a number, text, image, video in any digital media. The embedding takes place by manipulating the content of the digital data, which means the information is not embedded in the frame around the data. For images this means that the modifications of the pixel values have to be invisible. In other words it is a pattern of bits inserted into a digital image, audio or video file that identifies the file's copyright information (author, rights, etc.). The name comes from the faintly visible watermarks imprinted on stationery that identify the manufacturer of the stationery. The purpose of digital watermarks is to provide copyright protection for intellectual property that's in digital format. Digital watermarks on the images are designed to be completely invisible, moreover, the actual bits representing the watermark must be scattered throughout the file in such a way that they cannot be identified and manipulated.\par
The left size picture is true 24 BMP 2.25 MB Image file and right size picture is 2.25 KB image Jpg picture that is to be inserted in left size image (True 24 bit bmp file)\par
The picture shows half of the right picture has been inserted into the left picture that is original BMP file. When we insert the jpg 2.25 KB file into 2.25 MB file the by manipulating the pixels of the BMP file the size will remains same 2.25 MB and the image quality will also remains same.\par
Digital Watermarking describes methods and technologies that hide information on bmp images, for example a number, text, image, video in any digital media. The embedding takes place by manipulating the content of the digital data, which means the information is not embedded in the frame around the data. For images this means that the modifications of the pixel values have to be invisible. The research will be able to water mark the BMP images with bmp, jpeg, video, audio or any other format files. Digital Watermarking, which is used to transfer or pass information in a manner that the very existence of the message is unknown. With this study we can hide any type of file with any format into a 24 Bit True BMP with password protection (password can be encrypted using any of the existing encryption technology). For example we can hide or insert a video file or an audio file into a given BMP file without changing the image or its size. 24 Bit BMP format has been chosen because of its large pixel data. More the number of pixels in the image more data we can embed in it. This manipulation neither changes the image nor its size. i.e. the Image quality and its original size is maintained.\par
The first part of this study depicts the overview of the digital watermarking and defined the problem. Second part discusses the objectives of the study. The third part review the findings of the scholars who studied the watermarking in the past. Fourth chapter discusses the methodology used for the research purpose. The fifth part shows the analysing of the data and experiments. The sixth part shows the findings and colclusion. 
\section[{II.}]{II.} 
\section[{OBJECTIVE OF THE STUDY}]{OBJECTIVE OF THE STUDY}\par
The study aims the following objectives\par
The objective of our study would be to develop a technique which would embed some kind of information into the digital multimedia content such that the information (which we call the watermark) can later be extracted or detected for a variety of purposes including copy prevention and control and will help us to address some of the challenges faced by the rapid proliferation of digital content.\par
? Watermark should remain invisible ? Use of any digital content as watermark ? Copy/Copyright protection III. 
\section[{REVIEW OF LITERATURE}]{REVIEW OF LITERATURE}\par
There is no dearth of literature on watermarking. A number of scholars investigated the diffrents aspects of the topic. \hyperref[b11]{Zhao and Koch (1995)}, \hyperref[b4]{Cox et al (1997)}, \hyperref[b0]{Hartung, Eisert, and Girod (1998)}, Hsien Fu (1998),  {\ref Wu (1998, 1999)} An interface has been defined in the watermark agent to the external watermark retrieval library.\par
This interface employs Java's native interface technology to allow Java objects to call watermark retrieval functions written in C. At present, SysCoP (Zhao and Koch 1995) is the only digital watermarking mechanism that has been supported in the watermark agent. However, the watermark agent can easily support any other watermarking system.\par
Cox et al (1997) describe a method for embedding a binary watermark sequence in the highest magnitude DCT coefficients.\par
Hsien Fu (1998) conducts a literature survey of digital watermarks used for images. It describes the previous work done on digital watermarks, including the analysis of various watermarking schemes and their results. Potential applications are discussed, and an implementation plan of the project is presented. Hsien Fu uncovers the fact that recent work has shown that digital watermarks can be fairly successful in achieving the desired properties mentioned in section 2. These watermarks, however, are not perfect, and more could be done to improve a watermark's robustness or accuracy in detection. Furthermore, the question of copyright infringement remains a legal issue. Courts need to determine which methods may or may not be used. Until these legal standards are set, the Internet continues to be unsafe for images.\par
Hartung, Eisert, and Girod (1998) studied the methods for digital watermarking of MPEG-4 facial animation parameter data sets. They used a modelbased approach for the estimation of the facial parameters that combines a motion model of an explicit 3D textured wireframe with the optical flow constraint from the video data. This leads to a linear algorithm that is robustly solved in a hierarchical framework with low computational complexity. Experimental results confirm the applicability of the presented watermarking technique.\par
Hsu and Wu (1998, 1999) use the middle frequency coefficients of DCT/Wavelet transform to embed a binary watermark. These mentioned methods are robust against image processing. Their main drawback is requiring the original image to extract the watermark.\par
Digital watermark has found a multitude of potential applications other than the originally motivation for copyright protection  {\ref (Zhao et al. 1998}). Similarly, the various types of uses of the watermark agents create many spectrums and great business opportunities. 
\section[{Zhao and Luo (1998) presents a complete}]{Zhao and Luo (1998) presents a complete}\par
January 2012 digital watermark technology into practice. This system enables an agency to dispatch digital watermark agents to agent servers and agent can perform various tasks on the server. Once all the actions have been taken, a report will be sent to an agency's database and an agent can continue to travel to another agent server.\par
Unzign and Stirmark (1999), integrate a variety of geometric attacks. Unzign introduces local pixel jittering and is very efficient in attacking spatial domain watermarking schemes. Stirmark introduces both global and local geometric distortions. We give a few more details about these attacks later in this paper. However, most recent watermarking methods survive these attacks due to the use of special synchronization techniques. Robustness to global geometric distortions often relies on the use of either a transform in variant domain (Fourier-Melline) or an additional template or of specially designed periodic watermarks whose auto covariance function (ACF) allows estimation of the geometric distortions.\par
Fei et al (2001) attempt to find a suitable transform domain to watermark images robust against JPEG compression attack. They show that the choice of the transform domain depends on the type of the embedded information. If the watermark is embedded by repetition coding, then the Hadamard transform gives the best results.\par
Hasslacher (2004) evaluates the watermarking and its uses. He reveals that the scaling factor is a critical system parameter. If ais too small. The image is not distorted but the robustness of the scheme is low. He also unearth that Modification of low-frequency coefficients distorts the image and Gives the hacker a clue about where the watermark is embedded. 
\section[{Wang et al. (2004) describe a kind of blind}]{Wang et al. (2004) describe a kind of blind}\par
watermarking based on relative modulation of the DCT coefficient value by referring to its estimated one. In their method, the DC values of a 3×3 neighborhood of 8×8 blocks are used to estimate the AC coefficients of central block. In each group of nine 8×8 blocks, five bits of watermark are embedded by modulating the first five DCT AC coefficients, in central block, with the following rule:Set ACi ? AC'i ?? to embed bit "1" Set ACi ? AC'i ?? to embed bit "0"\par
Where, ACi and AC'i are the real and estimated value of the AC coefficients, respectively. The watermark recovery is done by comparing ACi and its estimated value. If ACi ? AC'i , then the extracted bit is "1", otherwise, it is "0". 
\section[{Saryazdi \& Hossein (2005) propose a blind}]{Saryazdi \& Hossein (2005) propose a blind}\par
scheme for gray-level data embedding in Hadamard Domain. In the proposed algorithm, the host image is first divided into 4×4 non-overlapping blocks. Their embedding procedure contains two parts. The first part is estimating the first two Hadamard low frequency AC coefficients (i.e. H(0,2) and H(2,0) ) in each block, using its neighbor blocks. We use the following equations, to estimate the low frequency AC Hadamard coefficients of a block using the DC values of its 3×3 neighbor blocks.\par
Saryazdi \& Hossein (2005) concludes that For most watermark application, it is desired to recover the embedded data without using host image. In this paper, such a watermarking scheme for embedding gray-level watermarks is presented. In the proposed method, the two first Hadamard AC coefficients are estimated by their neighbor blocks. Then, a number proportional to the gray-level watermark value is added to each estimated AC coefficient. The recovery procedure consists of comparing the estimated values with actual ones.\par
Agrawal (2007) propose a robust perceptual digital video watermarking procedure to embed a watermark image in digital video frames using the variable-temporal length 3-D DCT technique. He finds that in many existing video watermarking schemes, the raw video is needed for detection of watermark logo. This is refered to as non-blind method and is not convenient in many cases. In this thesis we propose a new blind watermark detection algorithm. The performance of the blind detection technique was evaluated for several types of video sequences. The watermarking is also done for color video samples in the YUV domain. We used only the luminance (Y-Component) to embed the watermark to make the watermarking scheme more robust since the chrominance (U and V) components is perceptually less sensitive to human visual system compared to the luminance (Y-Component).\par
Research scholars evaluated the different aspects of the digital watermarking and revealed a number of facts about the technology but not much research has been done on the watermarking on BMP files and on the method to hiding an BMP image in other without changing its view. This research will concentrate on the said topic.\par
IV. 
\section[{RESEARCH METHODOLOGY}]{RESEARCH METHODOLOGY}\par
Digital watermarking techniques can be used successfully with digital content in various forms like still images of bmp format using their least significant bit (LSB). In LSB substitution the lower order bits of selected pixels in the image are used to store watermarks. Techniques like flipping the lower order bits, replacing the lower order bits of each pixel with higher order bits of a different image (for e.g., a digital watermark agent system to effectively put the company logo), superimposing a watermark image over an area of image to be watermarked and adding some fixed intensity value are used to embed watermarks in spatial domain.\par
In Least Significant Bits substitution the lower order bits of selected pixels in the image are used to store watermarks or the LSB's are replaced with the higher order bits of the data that is to be inserted in the image that will effect the slightest change in the colour value of the pixel but non noticeable in colour point of view. The 24 bit BMP data has been chosen because of large pixel value more the file size the more data can de hide into the file. Any logo, signature, company name, bmp image or nay image or any audio/ video file can be hide into BMP file. More over the size of the original image will remain same after embedding the other data into the image. Because the data that is to be hide into the BMP file that is not any extra data or not any embedded data but the original data that will be replaced with the original lower bits of the BMP file. The idea behind this technique is that modifying the LSB will not make much difference to the color of the pixel. a) Methods used for the study Experimentations refer to the used of the new techniques to innovate/implement new idea for experiment based. The research refers to the experiments to hide any digital data into the BMP file format so that it can be easily inserted into the 24 BMP file. The hidden data will be into the BMP file with its original form and will not loose its originality. On the other side the size of the BMP file will remains same because it will not increase in any case because the BMP has given the full space to the data that is to hide in the BMP file by replacing its contents or called pixels. The experiment is successful because the BMP file can store large data because of its large file size. And experiment is again successful when the quality/colour of the BMP file will remains same to normal human eye after modifying the contents of the pixel value in the BMP file.\par
First convert the file to be hidden into a binary stream and then read the BMP file pixel by pixel and substituting the LSB's of R, G, B component of each pixel with the bits from the binary stream until the entire binary stream had been substituted into the image. The binary stream that is substituted also has a format for easy and fast retrieval. We use a 12 Byte or 96 Bit headers, which is prefixed, to the Binary Stream before being substituted.\par
V.      
\section[{EXPERIMENTS \& ANALYSIS}]{EXPERIMENTS \& ANALYSIS}
\begin{quote}
Figure 4\end{quote}
 
\section[{FINDINGS AND CONCLUSION}]{FINDINGS AND CONCLUSION}\par
Digital watermarks for BMP images on the images are designed to be completely invisible, moreover, the actual bits representing the watermark must be scattered throughout the file in such a way that they cannot be identified and manipulated.\par
The development will be able to water mark the BMP images with bmp, jpeg, video, audio or any other format files. The research is based on a Technique known as Digital Watermarking, which is used to transfer or pass information in a manner that the very existence of the message is unknown. With this study we can hide any type of file with any format into a 24 Bit True BMP with password protection (password can be encrypted using any of the existing encryption technology). For example we can hide or insert a video file or an audio file into a given BMP file without changing the image or its size. 24 Bit BMP format has been chosen because of its large pixel data. More the number of pixels in the image more data we can embed in it. This manipulation neither changes the image nor its size. i.e. the Image quality and its original size is maintained. Our study is based on a Digital Watermarking Technique known as Least Significant Bit (LSB's)\par
In this technique the LSB's of the Pixels are modified to store the information. The idea behind this technique is that modifying the LSB will not make much difference to the colour of the pixel. Multimedia distribution has become an important way to deliver services to people around the world. It is commonly applied in internet marketing campaigns and electronic commerce web sites. Due to the growing usage of multimedia content on the internet, serious issues have emerged. Counterfeiting, forgery fraud and pirating of this content are rising. Virtually anyone with a sound card, scanner, video frame grabbers or multimedia authoring systems allow them to incorporate copyrighted material into presentations, web designs and internet marketing campaigns. A simple search on any of the search engines returns hundreds and thousands of images which can be easily downloaded on to a personal computer.\par
An important point that arises in these applications is the protection of ownership rights. Anybody and everybody can download digital content from the internet and can reuse or redistribute that as his own thus depriving the rightful owner of royalty or recognition for his/her work. Hence the need for developing new copy deterrence and protection mechanisms for digital content is felt.\par
We need to have a mechanism which can help resolve the ownership issues for digital content. The owner should be able to mark his work in some way which should later help in resolving the ownership in case of dispute. Moreover the mark should not affect the quality or the meaning of the image or should not change it. This process on hard copy of images is known as watermarking and when applied to digital content is known as digital watermarking. Consequently, copyright abuse is rampant among multimedia users who are rarely caught. This copyright abuse is the motivating factor for this study.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{33}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 3 Figure 3}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 6 To}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XII Issue I Version I} 			\footnote{January 2012© 2012 Global Journals Inc. (US)} 			\footnote{Communications of ACM, pp. 67-72, Vol. 41, No. 7, July 1998.} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Saeid et al. ()]{b3}\label{b3} 	 		‘A Blind Digital Watermark in Hadamard Domain’.  		 			Saryazdi Saeid 		,  		 			Nezamabadi-Pour 		,  		 			Hossein 		.  	 	 		\textit{World Academy of Science, Engineering and Technology}  		2005. 3.  	 
\bibitem[Kutter and Petitcolas (1999)]{b9}\label{b9} 	 		‘A fair benchmark for image watermarking systems’.  		 			M Kutter 		,  		 			F Petitcolas 		.  	 	 		\textit{Electronic Imaging 199: Security and Watermarking of Multimedia Content},  				 (San Jose, California USA)  		January 1999. 3657 p. .  	 	 (SPIE Proceedings) 
\bibitem[Wang and Pearmain (2004)]{b5}\label{b5} 	 		‘Blind Image Data Hiding Based on Self Reference’.  		 			Y Wang 		,  		 			A Pearmain 		.  	 	 		\textit{Pattern Recognition Letters}  		November 2004. 25 p. .  	 
\bibitem[Zhao Jian and Chenghui]{b10}\label{b10} 	 		\textit{Digital Watermark Mobile Agents},  		 			\& Luo Zhao Jian 		,  		 			Chenghui 		.  		Fraunhofer Center for Research in Computer Graphics, Inc.  	 
\bibitem[Hartung et al. ()]{b0}\label{b0} 	 		‘Digital Watermarking of MPEG-4 Facial Animation Parameters’.  		 			Frank Hartung 		,  		 			Peter Eisert 		,  		 			Bernd Girod 		.  	 	 		\textit{Computers \& Graphics}  		1998. 2004. EMT-Institut. 22  (3 2) .  		 			JKU-Linz 		 	 	 (Digital Watermarking) 
\bibitem[Zhao and Koch ()]{b11}\label{b11} 	 		\textit{Embedding Robust Labels Into Images For Copyright Protection},  		 			J Zhao 		,  		 			E Koch 		.  		1995.  	 
\bibitem[Hsu and Wu ()]{b8}\label{b8} 	 		‘Hidden Digital Watermarks in Images’.  		 			C T Hsu 		,  		 			J L Wu 		.  	 	 		\textit{IEEE Trans. On Image Processing}  		1999. 8  (1) .  	 
\bibitem[Fu Hsien ()]{b2}\label{b2} 	 		‘Literature Survey on Digital Image Watermarking’.  		 			Fu Hsien 		.  	 	 		\textit{Multidimensional Signal Processing},  				1998.  	 
\bibitem[Hsu and Wu ()]{b7}\label{b7} 	 		‘Multi-resolution Watermarking for Digital Images’.  		 			C T Hsu 		,  		 			J L Wu 		.  	 	 		\textit{IEEE Trans. On Circuits \& Systems: Analog \& Digital Signal Processing}  		1998. 45  (8) .  	 
\bibitem[Perceptual Watermarking Of Digital Video Using The Variable Temporal Length 3d-Dct Thesis M-tech ()]{b1}\label{b1} 	 		‘Perceptual Watermarking Of Digital Video Using The Variable Temporal Length 3d-Dct’.  	 	 		\textit{Thesis M-tech}  		2007.  		 			IIT Kanpur 		 	 	 (Agrawal) 
\bibitem[Cox et al. ()]{b4}\label{b4} 	 		‘Secure Spread Spectrum Watermarking for Multimedia’.  		 			I J Cox 		,  		 			J Kilian 		,  		 			F T Leighton 		,  		 			T Shamoon 		.  	 	 		\textit{IEEE Trans. On Image Processing}  		1997. 12  (6)  p. .  	 
\bibitem[Fei et al. (2001)]{b6}\label{b6} 	 		‘The Choice of Watermark Domain in the Presence of Compression’.  		 			C Fei 		,  		 			D Kundur 		,  		 			R H Kwong 		.  	 	 		\textit{Proc. Of IEEE Int. Conf. On Information Technology: Coding \& Computing},  				 (Of IEEE Int. Conf. On Information Technology: Coding \& ComputingLas Vegas, Nevada)  		April 2001. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
