\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={Methodology for Evidence Reconstruction in Digital Image Forensics},
 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Methodology for Evidence Reconstruction in Digital Image Forensics}
\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]{Kalpana  Manudhane}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2012 Accepted: 3 January 2013 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


This paper reveals basics of Digital (Image) Forensics. The paper describes the ways to manipulate image, namely, copy-move forgery (copy region in image & paste into another region in same image), image splicing (copy region in image & paste into another image) and image retouching. The paper mainly focuses on copy move forgery detection methods that are classified mainly into two broad approaches- block-based and key-point. Methodology (generalized as well as approach specific) of copy move forgery detection is presented in detail. Copied region is not directly pasted but manipulated (scale, rotation, adding Gaussian noise or combining these transformations) before pasting. The method for detection should robust to these transformations. The paper also presents methodology for reconstruction (if possible) of forged image based on detection result.  

\end{abstract}


\keywords{digital forensics, copy-move forgery, keypoint, feature extraction, reconstruction.}

\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
ith the rapid development of computer networks, almost the daily work of all trades is more and more dependent on computer. As a result, high-tech crimes, commercial fraud and other phenomena involve computers. So, people pay more \& more attention to digital forensics. Digital forensics is concerned with the use of digital information (image or document file) as source of evidence in investigations and legal proceedings. This paper focuses on image as evidence.\par
Digital image forensics has emerged as a new research field that aims to reveal tampering in digital images \hyperref[b0]{[1]}. Tampering the image means illegally manipulating image with intent to damage.\par
From the early days an image has generally been accepted as a proof of occurrence of the depicted event. Use of digital image in almost all fields has become a common practice. The availability of low-cost hardware and software, make it easy to create, alter, and manipulate digital images As a result, we are rapidly reaching a situation where one can no longer take the integrity and authenticity of digital images for granted \hyperref[b1]{[2]}. So, detecting forgery in digital images is an emerging research field. In the recent years large amount of digital image manipulation could be seen In magazine, fashion Industry, Scientific Journals, Court rooms, main media outlet and photo hoaxes we receive in our email.\par
Digital image forensics is called passive \hyperref[b2]{[3]} if the forensic investigator cannot interfere with the image generation process. On the other hand, for Active approaches the generation process is purposely modified at an earlier stage to leave behind identifying traces. Typical instances of active approaches attach metadata to the image e. g., a cryptographic signature or a robust hash or embed a digital watermark directly into the image itself.\par
Digital image forensics is called blind \hyperref[b2]{[3]} if the forensic investigator is confined to examine the final output of the generation process. In particular, knowledge neither of the original scene nor any intermediate result of the generation process is available at the time of analysis. Contrary, Non-blind forensic investigators have such a data available. Such data may be available from alternative sources (for instance, earlier versions of a processed image that have been published elsewhere). This paper focuses on passiveblind image forensics.\par
Digital Image Forensics can be subdivided into three branches as-1) image source identification; 2) Computer generated image recognition and 3) Image forgery detection. Further, digital image forgery categorized in three groups \hyperref[b3]{[4]}-Copy-Move, Image splicing and Image retouching. Copy-Move forgery or Region-Duplication forgery is the most important type of forgery, in Copy-Move some part of the image copies and pastes into another part of the same image to create a new thing or to hide an important scene. Image splicing is the procedure of creating a fake image by cutting one part of an image and paste it to another image. Image Retouching doesn't obviously change the image, it just enhance some features of image. It is famous among magazine photo editors and most of magazine covers use this technique to change some features of an image but it is ethically wrong.\par
The rest of paper is organized as follows. Section II reveals literature survey. In section III, the details of the block-based and keypoint-based method are presented with the general flowchart of the methods.\par
Section IV gives details to reconstruct image based on detection results. Section V gives details of comparison metrics and dataset. Section V describes factors to be considered to prove robustness of method.  
\section[{Literature Survey}]{Literature Survey}\par
Detection of Copy-Move forgery is difficult as compared to other forgeries because the source and destination of forgery is same image, also the original image segment and the pasted one have same properties such as dynamic range, noise component and color palette.\par
The simplest way to detect a Copy-Move forgery is to use an exhaustive search. In this approach, the image and its circularly shifted version are overlaid looking for closely matching image block. This approach is simple and effective for small-sized images. However, this method is computationally expensive and even impractical for medium size image. Another technique for detecting forgery is based on autocorrelation. All Copy-Move forgery introduces a correlation between the original segment and the pasted one. Though this method does not have large computational complexity it often fails to detect forgery.\par
Basically, given an original image, there are two approaches for Copy move forgery detection (CMFD)block-based and keypoint-based. Block-based method subdivide image into blocks, whereas keypoint-based method searches keypoints in image without dividing the image. Although a large number of CMFD methods have been proposed, most techniques follow a common pipeline, as shown in Fig. \hyperref[fig_1]{1}. According to approach selected, each phase has different working methodology. Let us see these phases in brief \hyperref[b4]{[5]} Input detection image result Detection result Original Image Most methods operate on grayscale images. So, preprocessing involves color image to be converted to grayscale image. In feature extraction, a feature vector is computed for block or keypoint. Similar feature vectors are subsequently determined in matching step.\par
High similarity between two feature descriptors is interpreted as an indication for a duplicated region.\par
Filtering schemes have been introduced in order to reduce the probability of false matches. For instance, neighboring pixels often have similar intensities, which can lead to false forgery detection.\par
Different distance criteria were also proposed in order to filter out weak matches. The goal of this last phase i.e. post-processing is to preserve matches that exhibit a common behavior. A set of matches that originate from the copy-move action are expected to be spatially close to each other in both the source and the target blocks or keypoints. Furthermore, these matches should exhibit similar amounts of translation, scaling and rotation. In reconstruction, we try to recover original image if possible. B. L. Shivakumar and S. Baboo (2011) \hyperref[b7]{[9]} uses SURF (Speeded Up Robust Features) as keypoint feature. The method detects forgery with minimum false match for images with high resolution. But it failed to detect small copied regions. I.  {\ref Amerini et al.(2011)}  \hyperref[b8]{[10]} presented a new technique based on Scale invariant Feature Transform (SIFT) \hyperref[b9]{[11]} features to detect and localize copy-move forgeries. G2NN method is used for keypoint matching and clustering is used to detect forgery. The method also deals with multiple cloning.\par
The method also determines geometric transformation. Xunyu Pan(2011)  {\ref [1][12]}, in his dissertation, detect region duplication by using Scale invariant feature transform(SIFT) method to extract keypoint and Best-bin-first algorithm for keypoint matching. His method also deals with geometric transformation. These keypoint based methods show good performance with very less computation time and minimum memory requirement.  \hyperref[b5]{[6]} is the first to propose CMFD method. In this method, image is divided into overlapping small blocks. Then he used of discrete cosine transform (DCT) as block feature, this method is not robust to transformation. B. Mahdian and S. Saic (2007)[7] used blur invariant moments as block feature. S. Ryu, M. Lee and H. Lee (2010) \hyperref[b6]{[8]} use of magnitude of zernike moments as a feature of block. The method is invariant to rotation but still weak for scale \& other affine transformation. Somayeh \hyperref[b3]{Sadeghi et al. (2012)}  \hyperref[b3]{[4]} had used Fourier transform as block feature, though computation time is improved, the method is not so much accurate. Other block-based methods are based on-DWT (Discrete Wavelet Transform), PCA (Principle Component Analysis), Hu moment, SVD (Singular Value Decomposition) and KPCA (kernel-PCA) etc. These block-based methods accurately detect forged region, but require more computation time and memory.\par
So, it can be concluded that though blockbased methods improve detection result, keypoint based methods are more efficient if we consider factors of computation time and memory requirement. They are reliable and give good performance in case of affine transformation such as large scaling and rotation as compared to block-based methods. However, keypoint based methods are sensitive to low-contrast and repetitive image contents. 
\section[{III.}]{III.} 
\section[{Approaches to Cmfd}]{Approaches to Cmfd}\par
As it is cleared that there are basically 2 approaches to CMFD, namely, block-based and keypoint based, let us see methodology in depth for each. a) Block-based approach Firstly, image is subdivided into overlapping or non-overlapping blocks. For detecting forged area, the characteristics of each block of the image calculated and compared with each other. Fig. \hyperref[fig_3]{2} shows the general procedures of detecting block-based copy-move forgery. Similar blocks are identified by lexicographic sorting. In lexicographic sorting a matrix of feature vectors is built so that every feature vector becomes a row in the matrix. This matrix is then row-wise sorted. Thus, the most similar features appear in consecutive rows. Similarity criteria may be Euclidian distance, correlation etc.\par
The block size also affects performance of algorithm. If it is very large then can not locate small copied regions. If it is too small, more computation time and memory will be required. 16×16 will be choice of most researchers. 
\section[{b) Keypoint-based approach}]{b) Keypoint-based approach}\par
The first step in keypoint-based method is to find image keypoints and collect image features at the detected keypoints. Keypoints \hyperref[b0]{[1]} are locations that carry distinct information of the image content. Each keypoint is characterized by a feature vector that consists of a set of image statistics collected at the local neighborhood of the corresponding keypoint. Fig. \hyperref[fig_4]{3} shows the general procedures of detecting keypoint-based copy-move forgery \hyperref[b8]{[10]}. SIFT (Scale Invariant Feature Transform) is one of the methods to extract keypoint. SIFT keypoints are found by searching for locations that are stable local extrema in the scale space \hyperref[b9]{[11]}. Scale space is obtained by Gaussian and difference of Gaussian. At each keypoint, a 128 dimensional feature vector is generated from the histograms of local gradients in its neighborhood. To ensure that the obtained feature vector is invariant to rotation and scaling, the size of the neighborhood is determined by the dominant scale of the keypoint, and all gradients within are aligned with the keypoint's dominant orientation. Furthermore, the obtained histograms are normalized to unit length, which renders the feature vector invariant to local illumination changes. Given a test image, a set of keypoints X=\{x1,?.,xn\} with their corresponding SIFT descriptors \{f1,?.,fn\} are extracted. Best-Bin-First search method derived from the kd-tree algorithm (bins in feature space are searched in the order of their closest distance from the query location) used to get approximate nearest neighbors. Matching with a kd-tree yields a relatively efficient nearest neighbor search. The Euclidean distance is used as a similarity measure. It has been shown that the use of kd-tree matching leads, in general, to better results than lexicographic sorting, but the memory requirements are significantly higher.\par
Another is the 2NN algorithm. For the sake of clarity let D=\{d1, d2, ,?.,dn-1\} gives sorted Euclidean distance of a keypoint with respect to other keypoint descriptors. The keypoint is matched only if following condition is satisfied?? 1 ?? 2 ? < ?? ????????? ?? ? (0,1)\textbf{(1)}\par
That's why this procedure is called as 2NN test. Drawback of this method is cannot handle multiple keypoint matching. So, Amerini et. al. \hyperref[b8]{[10]} proposed generalized 2NN test (called as g2NN) starts from the high dimensional feature space such as that of SIFT features. The generalization consists of iterating the 2NN test between d\textunderscore i?d\textunderscore (i+1) until this ratio is greater than T (in their experiments this value is set to 0.5). Finally, by iterating over each keypoints, we can obtain the set of matched points. All the matched keypoints are retained, but isolated ones are discarded. But it can be possible that images that legitimately contain areas with very similar texture yield matched keypoints that might give false indicator. 
\section[{IV.}]{IV.} 
\section[{Clustering}]{Clustering}\par
Cluster is a collection of data objects such as objects that are similar to one another will be placed within the same cluster and dissimilar objects to the clusters. Clustering problem is to find similarities between data according to the characteristics found in the data and group similar data objects into clusters.\par
There are various approaches to clustering discussed in brief as follows-Cluster analysis \hyperref[b11]{[13]} try to subdivide a data set X into C subsets (clusters) which are pair wise disjoint, all non-empty and reproduce X via union. These clusters are termed as hard clusters (non-fuzzy). Whereas fuzzy clusters allow one piece of data to belongs to two or more clusters. C-means clustering is fuzzy based while k-means is hard clustering. Hierarchical clustering \hyperref[b8]{[10]} creates a hierarchy of clusters which may be represented by a tree structure. The algorithm starts by assigning each keypoint to a cluster; then it computes all the reciprocal spatial distances among clusters, finds the closest pair of clusters, and finally merges them into a single cluster.\par
Other major clustering approaches are partitioning, Density-based, grid-based, model-based, frequent-pattern-based and constraint-based. Swarm optimization based approaches such Particle swarm optimization and Ant colony optimization can also be successfully applied to clustering \hyperref[b12]{[14]}. 
\section[{a) Comparison between Block-based and Keypoint based approach}]{a) Comparison between Block-based and Keypoint based approach}\par
Comparison in simple terms is represented in following  
\section[{Image Reconstruction}]{Image Reconstruction}\par
After detection of forgery, next step is to try to reconstruct image to original. If forgery is done for highlight something and background is simple then it can be reconstructed easily by region growing. But if forgery is to hide something underlying then it is not possible to reconstruct it. Further more detection method is not able to distinguish original and copied region. It just claims that two regions are identical to each other. If we assume that copied region is one on which some transformations are performed. But in that case it will confuse in situation in which there is plain copy-move (without any transformation). In that case we As name suggests, region growing is a procedure that group pixels or sub-regions into larger regions based on predefined criteria for growth \hyperref[b13]{[15]}. The basic idea is to start with a set of seed points and from these grow regions by appending to each seed those neighboring pixels that have predefined properties similar to the seed (such as specific intensity range or color). Following are the problems in region growing where decision is needed to be taken.©\par
? Selecting a set of one or more starting points many times can be based on the nature of problem. When the prior information is not available, set of properties at every pixel is needed to be computed, so that can be used to assign pixels to regions during growing process. If these computation results in clusters, then pixels whose properties place them near the centroid of these clusters can be used as seeds.\par
? Selection of similarity criteria depends on problem under consideration and type of image data available. ? Formulation of stopping rule is another problem.\par
The growing process should stop when no more pixels satisfy criteria for inclusion in that region. Additional criteria to increase power of algorithm are-size, likeliness between candidate pixel, shape of region being grown, pixels grown so far etc.. 
\section[{VI. Comparison Metrics \& Dataset}]{VI. Comparison Metrics \& Dataset}\par
There should be a criteria on basis of which various methods can be compared. Measures for checking performance of method are mainly Precision, p, and Recall, r \hyperref[b4]{[5]}. They are defined as:?? = ?? ?? ?? ?? +?? ?? ?? = ?? ?? ?? ?? +?? ?? (2)\par
Where, ?? ?? = number of correctly detected forged images, ?? ?? = number of images that have been erroneously detected as forged, and ?? ?? = number of falsely missed forged images.\par
Here, precision denotes the probability that a detected forgery is truly a forgery; while recall shows the probability that a forged image is detected. Recall is often also called true positive rate. Score F1 is a measure which combines precision and recall in single value given as follows-?? 1 = 2 ? ????? ??+?? (3)\par
Along with this traditional measures such as memory requirement and computation time are also significantly considered.\par
Now, question arises -on which images we can test our method? Amerini et al. have published two ground truth databases for CMFD, namely, MICC F220 and MICC F2000 consists of 220 and 2000 images respectively. Half of images are tampered. The image size is 2048×1536 pixels. Type of processing is limited to rotation and scaling. Also original image is not available. 6. Compare your classifications to the ground truth. You should compute the number of misses (number of images that contained the object that were classified as not containing the object) and the number of false positives (number of images that do not contain the object that were classified as containing the object). Ideally, you want zero in both.\par
VII. 
\section[{Robustness of Method}]{Robustness of Method}\par
Method for CMFD should able to detect forgery invariant to rotation, (up and down) scaling, noise added to copied region before pasting it. Also method is expected to detect combinations of these manipulations. Method should detect multiple copies of the same region. Also, the method be able to detect If copied region is up-scaled or down-scaled then pasted, method should detect it accurately. Bayram et. al. \hyperref[b14]{[16]} suggested a method by applying Fourier Mellin Transform (FMT) on the image block. The authors showed that their technique was robust to compression up to JPEG quality level 20 and rotation with 10 degree and scaling by 10\%.\par
Hwei-Jen Lin et. al. \hyperref[b15]{[17]} proposed a method in which each block B of size 16x16 by a 9-dimensional feature vector. The feature vector extracted stored in floating numbers is converted into integer values for fast processing and then sorted using the radix sort, which makes the detection more efficient without degradation of detection quality. The difference (shift vector) of the positions of every pair of adjacent feature vectors in the sorted list was computed and then evaluated and the large accumulated number was considered as possible presence of a duplicated region. The scheme performed well when the degree of rotation was 90, 180 and 270 degree. The figure 5   vector(u1 -u4) , rotated through 90 degree.\par
We already seen than the method scale invariant features transform (SIFT) is more robust for scaling and Zernike moments based method is robust to rotation. 
\section[{b) Robustness to Gaussian noise}]{b) Robustness to Gaussian noise}\par
Copied region is not just pasted but often some noise is added to it before pasting. Gaussian noise \hyperref[b13]{[15]} represents statistical noise having probability distribution function equal to normal distribution. Gaussian noise model is frequently used in image processing.\par
Irrespective of noise added either in small or large in mount, method should choose to leave the ground truth clean \hyperref[b4]{[5]}. 
\section[{c) Robustness to combined transformation}]{c) Robustness to combined transformation}\par
The method is robust if it can detect combined transformation consisting of rotation, scale and Gaussian noise. 
\section[{d) Detection of multiple copies of same region}]{d) Detection of multiple copies of same region}\par
This factor depends on algorithm used for keypoint/block feature vector matching. 2NN algorithm is not able to detect multiple copies while g2NN is able to detect. 
\section[{e) Robustness to multiple copy-move}]{e) Robustness to multiple copy-move}\par
The method should detect multiple forgeries of copy-move with accuracy. Note that performance of method should not become less for one factor when trying to attempt to improve another factor. 
\section[{f) Complexity of algorithm}]{f) Complexity of algorithm}\par
Though lot of work is done in the field of copy move forgery detection, methods are very complex. If we want to achieve above factors, complexity further increases. Some simplification in current approaches or different way of approaching the problem is needed. 
\section[{VIII.}]{VIII.} 
\section[{Proposed System}]{Proposed System}\par
We will try to implement keypoint-based Scale Invariant Feature Transform (SIFT) algorithm for keypoint and feature extraction; generalized 2NN (g2NN) algorithm for keypoint feature matching; fuzzy c-means clustering for forged region detection. Hope so, almost all types of transformations being detected. We will also try to reconstruct original image whenever possible using region growing algorithm.  
\section[{Conclusion}]{Conclusion}\par
This paper gives basic of Digital (Image) Forensics. The paper also put light on the ways to image manipulation, namely, copy-move forgery, image splicing and image retouching. The literature survey is presented for copy move forgery detection methods that are classified mainly into two broad approaches-blockbased and key-point. Methodology (generalized as well as approach specific) of copy move forgery detection is presented in detail. Many authors have proposed good methods with lot of experiments. Some authors also provided dataset for experimental testing. Though lot of work had been done in the field of copy move forgery detection, methods are very complex. If we want to achieve robust method against all manipulations complexity further increases. Some simplification in current approaches or different way of approaching the problem is needed. Accuracy is also needed to be improved. This paper make familiar to new researchers in this field with current methodology and robustness requirement for the methods to be proposed. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}F}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-6.png}
\caption{\label{fig_5}2 F}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-7.png}
\caption{\label{fig_6}F}\end{figure}
     \begin{figure}[htbp]
\noindent\textbf{-} \par 
\begin{longtable}{P{0.011018518518518518\textwidth}P{0.40611111111111114\textwidth}P{0.4328703703703704\textwidth}}
\tabcellsep Block-based approach\tabcellsep Keypoint based approach\\
1\tabcellsep Subdivide image into blocks for feature\tabcellsep Without dividing image determine keypoints for feature\\
\tabcellsep extraction\tabcellsep extraction\\
2\tabcellsep Feature vector matching is done mostly by\tabcellsep Feature vector matching is done by 2NN, g2NN, best-\\
\tabcellsep lexicographic sorting\tabcellsep bin-first algorithm\\
3\tabcellsep Cannot detect large transformations\tabcellsep Can detect large transformations\\
4\tabcellsep More memory required and consequently more\tabcellsep Less memory and computation time as keypoints are\\
\tabcellsep computation time\tabcellsep less in number\\
5\tabcellsep More accurately detect duplication\tabcellsep Some what less accurate\\
V.\tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}table -}\end{figure}
 			\footnote{F Figure 4 : Forged images of dataset MICC-F8multi Methodology for Evidence Reconstruction in Digital Image Forensics} 			\footnote{© 2013 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Amerini et al. ()]{b8}\label{b8} 	 		‘A SIFT-based Forensic Method for Copy-Move Attack Detection and Transformation Recovery’.  		 			I Amerini 		,  		 			L Ballan 		,  		 			R Caldelli 		,  		 			A D Bimbo 		,  		 			G Serra 		.  	 	 		\textit{IEEE Transactions on Information Forensics and Security}  		2011. 6  (3)  p. .  	 
\bibitem[Bayram et al. ()]{b14}\label{b14} 	 		‘An efficient and robust method for detecting copymove forgery’.  		 			Sevinc Bayram 		,  		 			Taha Sencar 		,  		 			Nasir Memon 		.  	 	 		\textit{Proceedings of ICASSP 2009},  				 (ICASSP 2009)  		2009.  	 
\bibitem[Christlein et al. ()]{b4}\label{b4} 	 		‘An Evaluation of Popular Copy-Move Forgery Detection Approaches’.  		 			Vincent Christlein 		,  		 			Christian Riess 		,  		 			Johannes Jordan 		,  		 			Corinna Riess 		,  		 			Elli Angelopoulou 		.  	 	 		\textit{ieee Transactions On Information Forensics And Security},  				2012. p. .  	 
\bibitem[Barni et al. ()]{b16}\label{b16} 	 		‘Application of Fuzzy C-Means Clustering Algorithm Based on Particle Swarm Optimization in Computer Forensics’.  		 			M Barni 		,  		 			A Costanzo ; Deguang Wang 		,  		 			Baochang Han 		,  		 			Ming Huang 		.  	 	 		\textit{Signal Processing: Image Communication},  				2012. 2012. 27 p. .  	 	 (A fuzzy approach to deal with uncertainty in image forensics) 
\bibitem[Lt et al.]{b1}\label{b1} 	 		‘Detecting Copy-Move Forgery in Digital Images: A Survey and Analysis of Current Methods’.  		 			B L Lt 		,  		 			S Dr 		,  		 			Santhosh 		,  		 			Baboo 		.  	 	 		\textit{Global Journal of Computer Science and Technology}  		 	 
\bibitem[Pan and Lyu ()]{b10}\label{b10} 	 		\textit{Detecting Image Region Duplication using SIFT features},  		 			Xunyu Pan 		,  		 			Siwei Lyu 		.  		2011. p. .  	 
\bibitem[Ryu et al. (2010)]{b6}\label{b6} 	 		‘Detection of Copy-Rotate-Move Forgery using Zernike Moments’.  		 			S Ryu 		,  		 			M Lee 		,  		 			H Lee 		.  	 	 		\textit{Information Hiding Conference},  				Jun. 2010. p. .  	 
\bibitem[Shivakumar and Baboo ()]{b7}\label{b7} 	 		‘Detection of Region Duplication Forgery in Digital Images Using SURF’.  		 			B L Shivakumar 		,  		 			S Baboo 		.  	 	 		\textit{International Journal of Computer Science Issues}  		2011. 8  (4)  p. .  	 
\bibitem[Digital Forensics Using Local Signal Statistics A Dissertation ()]{b0}\label{b0} 	 		‘Digital Forensics Using Local Signal Statistics’.  	 	 		\textit{A Dissertation},  				2011.  	 	 (Xunyu Pan) 
\bibitem[Lowe ()]{b9}\label{b9} 	 		‘Distinctive Image Features from Scale-Invariant Keypoints’.  		 			David G Lowe 		.  	 	 		\textit{International Journal of Computer Vision}  		2004. 60  (2)  p. .  	 
\bibitem[Sadeghi et al. ()]{b3}\label{b3} 	 		‘Efficient Copy-Move Forgery Detection for Digital Images’.  		 			Somayeh Sadeghi 		,  		 			Hamid A Jalab 		,  		 			Sajjad Dadkhah 		.  	 	 		\textit{World Academy of Science, Engineering and Technology}  		2012. p. .  	 
\bibitem[Lin et al. (2009)]{b15}\label{b15} 	 		‘Fast Copy-Move Forgery Detection’.  		 			Hwei-Jen Lin 		,  		 			Chun-Wei Wang 		,  		 			Yang-Ta Kao 		.  	 	 		\textit{WSEAS Transaction on Signal Processing}  		May 2009. 5  (5)  p. .  	 
\bibitem[Bezdek et al. ()]{b11}\label{b11} 	 		‘FCM: The Fuzzy c-means clustering algorithm’.  		 			James C Bezdek 		,  		 			Robert Ehrlich 		,  		 			William Full 		.  	 	 		\textit{Computers and Geosciences}  		1984. 10 p. .  	 
\bibitem[Farid ()]{b18}\label{b18} 	 		\textit{Image forgery detection A survey},  		 			Hany Farid 		.  		2009. p. .  	 	 (ieee signal processing magazine) 
\bibitem[Kirchner ()]{b2}\label{b2} 	 		 			Matthias Kirchner 		.  		\textit{Notes on Digital Image Forensics \& counter forensics},  				2012. p. .  	 
\bibitem[Fridrich et al. (2003)]{b5}\label{b5} 	 		‘Methodology for Evidence Reconstruction in Digital Image Forensics 7. B. Mahdian and S. Saic’.  		 			D Fridrich 		,  		 			J Soukal 		,  		 			Lukas 		.  	 	 		\textit{Proceedings of Digital Forensic Research Workshop},  				 (Digital Forensic Research Workshop)  		Aug. 2003. 2007. 171 p. .  	 	 (Detection of Copy-Move Forgery using a Method Based on Blur Moment nvariants) 
\bibitem[Rafael et al. ()]{b13}\label{b13} 	 		 			C Rafael 		,  		 			Richard E Gonzalez 		,  		 			Woods 		.  		\textit{Digital Image Processing},  				 (Book)  		2009.  	 
\bibitem[Vaca-Castano ()]{b17}\label{b17} 	 		\textit{Satlab tutorial session-2},  		 			Gonzalo Vaca-Castano 		.  		 \url{http://www.aishack.in/2010/05/sift-scale-invariant-feature-transform}  		2010.  	 
\bibitem[Abraham et al.]{b12}\label{b12} 	 		\textit{Swarm Intelligence Algorithms for Data Clustering},  		 			Ajith Abraham 		,  		 			Swagatam Das 		,  		 			Sandip Roy 		.  		p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
