<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The image series forgery detection algorithm based on the camera pattern noise analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>N I Evdokimova</string-name>
          <email>nadezh.evdokimova@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>V V Myasnikov</string-name>
          <email>vmyas@geosamara.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Image Processing Systems Institute of RAS - Branch of the FSRC "Crystallography and Photonics" RAS</institution>
          ,
          <addr-line>Molodogvardejskaya street 151, Samara, Russia, 443001</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Samara National Research University</institution>
          ,
          <addr-line>Moskovskoe Shosse 34А, Samara, Russia, 443086</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>258</fpage>
      <lpage>263</lpage>
      <abstract>
        <p>In the paper, the image series forgery detection algorithm based on the analysis of camera pattern noise is proposed. Distribution characteristics of the camera pattern noise are obtained by extracting the noise component of images from the non-tampered image series. A noise residual of a forgery image is compared with the camera pattern noise. We compare various noise filtering algorithms to choose the one that achieves the best performance of the proposed method. The proposed algorithm is tested both on examples of copy-move forgeries and forgery fragments which were inserted from an image not included in the image series.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Image time series describes a scene dynamic. Analysis of image series allows predicting an image that
may be next in the image series, as well as to conclude the authenticity of the image. There are several
approaches to detect forged images. These approaches can use temporal and spatial correlations [1],
unique artifacts of compression, and, finally, unique artifacts left by the camera. Methods using
temporal and spatial correlations are divided into two categories. The methods belonging to the first
category are based on pixel analysis of images [2-5] while the methods from the second category use
the object level of images [6].</p>
      <p>In the conditions of availability of many graphic editors and ease of their use, even an ordinary user
does not require specialized knowledge and skills to falsify images. Forgeries can be made to add a
new object to the scene captured by the camera or to hide the existing ones. Image series forgery
detection has its distinctive features as compared to images matching since each image of an image
series captures a scene at different moments. Two neighboring images of an image series can be
captured under different lighting, weather or seasonal conditions. This paper proposes a forgery
detection algorithm that is invariant to the conditions for obtaining images of a series.</p>
      <p>This work consists of three parts. The first part deals with the model of the camera sensor noise and
presents a method for extracting pattern noise. In the second part of the work, an algorithm for image
forgery detection is proposed. The third part contains an experimental result of the proposed algorithm
effectiveness. Experiments are focused on copy-move detection (fragments duplicated within one
image) and copy-paste detection (fragments inserted from an image not included in the image series).
2. Model of a camera’s sensor noise
When the camera sensor captures a uniformly lit scene, the output image will contain a certain number
of pixels, slightly different in brightness from the rest. This fact is related to random noise
components, such as readout noise (the magnitude of the matrix signal fluctuations relative to the
average signal value) or shot noise (random fluctuations of voltages and currents relative to their
average value), and a deterministic component - pattern noise. Pattern noise is present in each image,
fixed by the sensor, and remains approximately the same for different images captured by the sensor.</p>
      <p>The output image of the camera can be represented as follows [7]:</p>
      <p>
        y(i, j)  fi, j  x(i, j)  (i, j)  c(i, j)  (i, j) (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where   (i, j) is shot noise,    (i, j) is readout noise, с  с(i, j) is fixed pattern noise (FPN),
x  x(i, j) is image of the scene in the absence of any noise and fi, j is a multiplicative coefficient
characterizing photo-response nonuniformity (PRNU).
2.1. Extraction of sensor pattern noise
To reduce the contribution of the random noise    (i, j) and   (i, j) to the determined noise
component, an image time series Ii (n, m),i  1, L, n  1, N, m  1, M , of the same scene captured by the
same camera is used.
      </p>
      <p>A F noise filter is used [8], [9] to extract the high-frequency component of camera noise. For each
image of the sequence Ii (n, m) , it is possible to define the pattern noise matrix Wi (n, m) as follows:</p>
      <p>Wi (n, m)  Ii (n, m)  F  Ii (n, m) .</p>
      <p>
        Estimation of pattern noise matrices W1(n, m),W2 (n, m),...,WL (n, m) set can be performed using a
matrix of per-element expected values and a matrix of per-element dispersion values. These matrices
can be calculated using (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ), respectively. Both the matrix of expected values and the matrix of
dispersion values have the same dimensions and depth as the pattern noise matrix Wi (n, m) and the
original images Ii (n, m) accordingly.
      </p>
      <p>E{W0 ,W1,...,WL}  E(n, m) 
1 L1</p>
      <p> Wi (n, m) .</p>
      <p>L i0
D{W0 ,W1,...,WL}  D(n, m)  1  L1 Wi (n, m)  E(n, m)2 .</p>
      <p>
        L i0
Expected values and dispersion are calculated for every pixel of every dimension.
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <sec id="sec-1-1">
        <title>2.2. Selection of a noise extraction filter</title>
        <p>
          The main requirement for a noise filter is the high quality of filtering areas around the edges of
objects. This requirement is imposed so that the noise matrices contain the least amount of scene
traces. The median filter, the Lee filter [10], the Gauss filter, the non-local mean filter [11] and the
bilateral filter were chosen in the work.
3. Forgery detection algorithm
After obtaining pattern noise distribution characteristics of the camera, the noise component of the
suspicious image distortion is extracted. Let IF (n, m) be a suspicious image that captures the same
scene with the same camera. The image is not included in the image series used in (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) and (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ). The
pattern noise matrix of the suspicious image is determined as follows:
        </p>
        <p>
          WF (n, m)  IF (n, m)  F  IF (n, m) . (
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
The image forgery detection algorithm can be introduced as follows:
 Obtaining pattern noise distribution characteristics of the camera using an image series;
 Obtaining the pattern noise matrix of the suspicious image. It is needed to use the same noise
filter with the same parameters;
 Evaluation of similarity between the pattern noise of the suspicious image and the pattern
noise of the camera;
 Creating of binary mask and post-processing of it.
        </p>
        <p>
          Pattern noise distribution characteristics of the camera are obtained in the way described in the
previous part of this work.
3.1. Calculation of similarity between the noise of suspicious image and camera pattern noise
The pattern noise matrix of the suspicious image WF (n, m), n 1, N, m 1, m is calculated using the
formula (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ). If images of the image series Ii (n, m),i 1, L, have three channels, then every element of
the pattern noise matrix can be presented as a vector wi, j   wiRj , wiGj , wiBj T ,i 1, N, j 1, M . The
similarity between the noise of the suspicious image and camera pattern noise distribution is
characterized by the Mahalanobis distance. The Mahalanobis distance is calculated for every element
wi, j of pattern noise matrix and the corresponding element μi, j  E(i, j)  iRj ,iGj ,iBj T of expected
dM (wi, j ,μi, j )  wi, j  μi, j T Bij1 wi, j  μi, j  ,
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
values matrix using (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ).
where Bij is a covariance matrix.
        </p>
        <p>Set of Mahalanobis distance dM (wi, j ,μi, j ) calculated for every wi, j forms a Mahalanobis distance
matrix DM WF ,E . Next, the matrix DM is averaged in the window whose size does not exceed the
size of the forged region to carry off peak values caused by random noise.
3.2. Creating a binary mask based on the distance matrix
The task of creating a binary mask is solved by choosing a threshold and threshold processing on the
Mahalanobis distance matrix.</p>
        <p>The threshold is selected based on the analysis of the Mahalanobis distance matrices total
histogram. The cumulative histogram is created by aggregating Mahalanobis distance matrices
histograms of authentic images Ii (n, m),i 1, L .</p>
        <p>Neyman-Pearson criterion is used to select a value of the threshold T . The probability of a
falsepositive p0 is fixed, and the value of the threshold T is chosen to minimize the probability of a
falsenegative p1 .
3.3. Binary mask post-processing
In the work, post-processing of a binary mask includes selecting connected regions on the mask [12]
and filtering them by size. A connected area is considered forged if its square exceeds 1 / 1000 of the
original image square. A minimal convex hull is constructed around each of forged region. Then the
space inside the minimal convex hulls is filled.
4. Experiments
The experiments were carried out on a standard PC (Intel Core i5-4460, 16 GB RAM).</p>
        <p>Ten image time series were used as the object of experiments. Every image series includes 15
authentic images and two forged images. All images were represented in the RGB space. One forged
image included a copy-move and a fragment of another image was inserted into the second image. All
images had a size of 4032 3024 .</p>
        <p>Figure 1 illustrates the camera pattern noise extracted by: (a) - the median filter, (b) - the Lee filter,
(c) - the Gauss filter, (d) - the non-local mean filter and (e) - the bilateral filter. The images of camera
pattern noise have been converted to grayscale and transformed by linear enhancement to the range of
[0, 255] .
1
2
3
4
5
6
7
8
9
10
#
d) e)
Figure 1. Camera pattern noise extracted by: a - the median filter; b - the Lee filter; c - the Gauss
filter; d - the non-local mean filter and e - the bilateral filter.</p>
        <p>The first part of the experiments was aimed at determining the effectiveness of the copy-move
detection by the proposed algorithm.
4.1. Effectiveness of copy-move detection
The results of experiments aimed at detecting copy-move fragments are shown in Table 1. An example
of an image containing copy-move, as well as the result of detecting it using a bilateral filter, is shown
in Figures 2 (a) and 2 (b), respectively.</p>
        <p>b)</p>
        <p>Figure 2. The result of copy-move detection in the image.</p>
      </sec>
      <sec id="sec-1-2">
        <title>4.2. Effectiveness of copy-paste detection</title>
        <p>The results of experiments aimed at detecting copy-paste fragments are shown in Table 2. An example
of an image containing copy-paste, as well as the result of detecting it using a bilateral filter, is shown
in Figure 3 (a) and 3 (b), respectively.
5. Conclusion
The image series forgery detection algorithm based on the camera pattern noise analysis has been
proposed in the paper. The conducted research has allowed determining the most suitable noise filter
in the sense of the selected metric F1 - bilateral filter. Also, experiments have shown the Lee filter is
not suitable for solving the problem of copy-move and copy-paste fragments detection. The proposed
algorithm allows detecting copy-move fragments with the average F1 value of 0.85 if the bilateral
noise filter was used for pattern noise extraction. The average F1 value of 0.87 is reached for
copypaste fragments detection with the bilateral noise filter also.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Acknowledgments</title>
      <p>
        This work was supported by RFBR according to the research project № 18-01-00748-а in part of
"Introduction" and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) "Model of a camera’s sensor noise" and RF Ministry of Science and Higher
Education within the State assignment to the FSRC «Crystallography and Photonics» RAS
(Agreement 007-Г3/43363/26) in part of (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) "Forgery detection algorithm" - (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) "Experiments".
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Christian</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Sheth R 2016 Digital Video</surname>
          </string-name>
          <article-title>Forgery Detection and Authentication Technique -</article-title>
          A
          <source>Review International Journal of Scientific Research in Science and Technology</source>
          <volume>2</volume>
          <fpage>138</fpage>
          -
          <lpage>143</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Evdokimova</surname>
            <given-names>N I</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>A V</given-names>
          </string-name>
          <year>2017</year>
          <article-title>Local patterns in the copy-move detection problem solution</article-title>
          <source>Computer Optics</source>
          <volume>41</volume>
          (
          <issue>1</issue>
          )
          <fpage>79</fpage>
          -
          <lpage>87</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2017-41-1-
          <fpage>79</fpage>
          -87
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>A V</given-names>
          </string-name>
          and
          <string-name>
            <surname>Myasnikov</surname>
            <given-names>V V</given-names>
          </string-name>
          <string-name>
            <surname>2016</surname>
          </string-name>
          <article-title>A copy-move detection algorithm based on binary gradient contours</article-title>
          <source>Computer Optics</source>
          <volume>40</volume>
          <fpage>284</fpage>
          -
          <lpage>293</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2016-40-2-
          <fpage>284</fpage>
          -293
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>A V</given-names>
          </string-name>
          and
          <string-name>
            <surname>Myasnikov</surname>
            <given-names>V V</given-names>
          </string-name>
          <string-name>
            <surname>2014</surname>
          </string-name>
          <article-title>A fast plain copy-move detection algorithm based on structural pattern and 2D rabin-</article-title>
          karp
          <source>rolling hash Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          8814
          <fpage>461</fpage>
          -
          <lpage>468</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Evdokimova</surname>
            <given-names>N I</given-names>
          </string-name>
          and
          <string-name>
            <surname>Myasnikov</surname>
            <given-names>V V</given-names>
          </string-name>
          <year>2018</year>
          <article-title>Detecting forgery in image time series based on anomaly detection</article-title>
          <source>CEUR Workshop Proceedings</source>
          <volume>2210</volume>
          <fpage>184</fpage>
          -
          <lpage>192</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Hussain</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cheng</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wei</surname>
            <given-names>H</given-names>
          </string-name>
          and
          <string-name>
            <surname>Stanley D 2013</surname>
          </string-name>
          <article-title>Change detection from remotely sensed images: From pixel-based to object-based approaches</article-title>
          <source>ISPRS Journal of Photogrammetry and Remote Sensing</source>
          <volume>80</volume>
          <fpage>91</fpage>
          -
          <lpage>106</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Lukáš</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fridrich</surname>
            <given-names>J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Goljan</surname>
            <given-names>M 2006</given-names>
          </string-name>
          <article-title>Detecting digital image forgeries using sensor pattern noise</article-title>
          <source>Proceedings of SPIE - The International Society for Optical Engineering 6072</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Fahmy M F and Fahmy O M 2016</surname>
          </string-name>
          <article-title>A new morphological based forgery detection scheme National Radio Science Conference</article-title>
          ,
          <source>NRSC, Proceedings 212-216</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Chen</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fridrich</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goljan</surname>
            <given-names>M</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lukáš J 2008</surname>
          </string-name>
          <article-title>Determining image origin and integrity using sensor noise</article-title>
          <source>IEEE Transactions on Information Forensics and Security</source>
          <volume>3</volume>
          <fpage>74</fpage>
          -
          <lpage>90</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Soifer</surname>
            <given-names>V A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chernov</surname>
            <given-names>A V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chernov</surname>
            <given-names>V M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chicheva</surname>
            <given-names>M A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fursov</surname>
            <given-names>V A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gashnikov</surname>
            <given-names>M V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glumov</surname>
            <given-names>N I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ilyasova</surname>
            <given-names>N Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khramov A G and Korepanov A O 2009 Computer Image</surname>
          </string-name>
          <article-title>Processing (VDM Verlag Dr</article-title>
          . Müller)
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Buades</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coll</surname>
            <given-names>B</given-names>
          </string-name>
          and
          <string-name>
            <surname>Morel J-M 2005</surname>
          </string-name>
          <article-title>A non-local algorithm for image denoising</article-title>
          <source>Proceedings IEEE Computer Society Conference on Computer Vision</source>
          and Pattern Recognition,
          <source>CVPR II 60- 65</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Solomon</surname>
            <given-names>C</given-names>
          </string-name>
          and
          <string-name>
            <surname>Breckon T 2011 Morphological Processing</surname>
          </string-name>
          <article-title>Fundamentals of Digital Image Processing</article-title>
          (John Wiley &amp; Sons, Ltd)
          <fpage>197</fpage>
          -
          <lpage>234</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>