<!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>Some aspects of real-time image denoising influenced by shot noise and compound Poisson noise</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oleg Kobylin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksandra Putiatina</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Kharkiv National University of Radioelectronics</institution>
          ,
          <addr-line>14 Nauki Ave., Kharkiv, 61166</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>109</fpage>
      <lpage>117</lpage>
      <abstract>
        <p>This paper introduces an alternative image model for video data that is represented as a series of images afected by shot noise. This type of noise not only disrupts the current frame in the video sequence but also goes over to subsequent frames, gradually diminishing over time until it vanishes. The shot-noise process is characterized by a sequence of jumps that decay as time passes. Under specific conditions, this process converges to a Gaussian distribution. To tackle this issue, the Kalman filter is proposed as a solution for removing noise and restoring the compromised image sequence. Numerical experiments demonstrate the efectiveness of the proposed approach in denoising videos corrupted by shot noise. The results of the proposed method were compared to the results provided by spatial Wiener filter, median filter, bilateral filter and a multilayer perceptron model. PSNR was calculated for the above methods.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;video</kwd>
        <kwd>sequence of images</kwd>
        <kwd>Gaussian process</kwd>
        <kwd>compound Poisson noise</kwd>
        <kwd>denoising</kwd>
        <kwd>Kalman filter</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>In certain applications digital devices can introduce noise to the original image or sequence of images.
While there are various image denoising techniques that are efective at restoring noisy images, shot
noise still remains mostly unexplored. Currently, no satisfactory algorithm exists that can efectively
denoise images sequence of images afected by shot noise.</p>
      <p>
        We propose a novel method for restoring images afected by shot noise. Unlike noise that vanishes
immediately, shot noise diminishes gradually over time. This type of noise arises from defects in the
hardware of a device or issues within the camera sensor [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Shot noise, driven by a Poisson process,
exhibits a specific pattern of gradual decay following each occurrence.
      </p>
      <p>
        When the intensity of the underlying Poisson process is high, shot noise can be efectively
approximated by Gaussian noise. Numerous algorithms have been proposed in the literature to address various
types of noise. These include linear filters, such as median and mean filters, as well as non-linear filters,
which are discussed in sources [
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2, 3, 4</xref>
        ]. Analysis and comparison of diferent image denoising methods
is discussed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Such methods can also be employed for mitigating shot noise. If the jump rate is
significant and the individual jumps are relatively small, the resulting shot noise increasingly resembles
Gaussian noise. There are several established techniques for filtering Gaussian noise, including the
bilinear filter, anisotropic difusion filter, and Kernel Regression filter, as detailed in [
        <xref ref-type="bibr" rid="ref6 ref7 ref8 ref9">6, 7, 8, 9</xref>
        ].
      </p>
      <p>The goal is to create a method for restoring images afected by shot noise by utilizing a Gaussian
approximation of the shot-noise process in combination with Kalman filtering.
•  (,  ) is the true image intensity level at (,  );
•   is the pointwise noise;
•  is the observed image intensity level at (,  ).</p>
      <p>The sequence of 2-D images can be modeled in the following way:</p>
      <p>
        = (, ) +  ,
equation [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]:
where
where
2. Jump regression analysis for modeling noisy image
A standard two-dimensional grayscale image can be represented using the following jump regression
 =  (,  ) +   ,  = 1, ..., ;  = 1, ..., .,
      </p>
      <p>Therefore, the sequences (, ),  = 1, 2, . . . ,  are the 2-D profiles, and monitoring the image
sequence is equivalent to monitoring the 2-D profile sequence.
2.1. Shot noise process and its approximation
Shot noise is a type of random noise marked by abrupt intensity fluctuations that dissipate over time.
This phenomenon frequently appears in real-time image processing, where individual pixels may
experience sudden intensity spikes caused by defects in image recording devices. The impact of shot
noise diminishes with time, resulting in reduced interference on the same pixel in subsequent frames of
the image sequence.</p>
      <p>
        Shot noise   is defined in the following way:
  =  0−  + ∑︁
−  (− ) =  0−  + −  ∑︁

  ,
where
 1;
intensity  ;
beta distribution [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>•  0 is the initial value of  ;
• {}=1,2,... is the sequence of iid random variables with distribution function  () and () =
• {}=1,2,... is the sequence representing the event times of a Poisson process  with constant
•  is the rate of exponential decay.</p>
      <p>
        The distribution of the random variables {} can be arbitrary, for example normal distribution or
The expectation of the shot noise  , assuming that  0 is known, is as follows from [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]:
(1)
(2)
(3)
•  = 1, ..., ;  = 1, ..., .,  = 1, ..., .
• (, ) is the (, )ℎ pixel of the ℎ image;
• (, ) is the true image intensity level at (, ) of the ℎ image;
•   is the pointwise noise of the ℎ image;
•  is the observed image intensity level at (, ) of the ℎ image.
      </p>
      <p>( ) =
+  0 −
− 
→</p>
      <p>→ ∞,
 1 )︁

and, moreover, if the initial value  0 equals  1/ , then we have a stationary case and the mean value
( ) will be equal to  1/</p>
      <p>and will not depend on time .</p>
      <p>
        The variance of the shot noise process   is as in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]:
 ( ) =
2
 2 (1 − − 2 ) →
 √︂  2 .
      </p>
      <p>2
+ 
√︂  2 .</p>
      <p>2
 = (, ) +  ,
model:
where
of the 2-D images:
where
(4)
(5)
(6)
(7)
(8)
distribution to 0. Then () converges in law to , where</p>
      <p>
        The main result of the paper [[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]] is that () (the normalization of shot noise or linear
transformation) converges to some  that is normally distributed. Assume that 
random variable independent of everything else, such that ( 0 − ( 1/ ))( 1/ 2 )− 1/2 converges in
→ ∞ and that  0 is a
where  is standard Brownian motion.
      </p>
      <p>This implies that  is normally distributed with mean () = 0− 
 () = 1
− − 2
→ 1   →</p>
      <p>∞. If  0 =  1/ , then 0 = 0 and, therefore, () = 0.</p>
      <p>Following the linear transformation (5) the shot-noise process   has the following form:
→ 0   →
∞ and variance
Define  ˆ as Gaussian approximation of   as follows:</p>
      <p>When the intensity of jumps is relatively high, shot noise can be efectively approximated as Gaussian
noise. This allows for the application of Kalman filtering techniques in real-time image restoration
processes. A series of 2-D images afected by shot noise can be represented through the following
•  = 1, ..., ;  = 1, ..., .,  = 1, ..., .;
• (, ) is the (, )ℎ pixel of the ℎ image;
• (, ) is the true image intensity level at (, ) of the ℎ image;
•   is the pointwise shot-noise of the ℎ image;
•  is the observed image intensity level at (, ) of the ℎ image.</p>
      <p>Applying the Gaussian approximation of the shot noise we obtain the following model of the sequence
 = (, ) + ˆ = (, ) +
•  is normally distributed with mean 0 and variance 1 as  → ∞;
•  1 and  2 are first and second initial moment of the random variable  ;
•  is the intensity of the underlying Poisson process;
•  is the rate of exponential decay.</p>
      <p>There occurs a correction term  1 in equation (8), which is constant additive part to the image
intensity. Therefore
where
 = (, ) + ˆ = (, ) + 
2.2. Compound Poisson process and its approximation
Compound Poisson noise process is defined in the following way:
This definition is a special case of the shot-noise process with  = 0.</p>
      <p>We recall the result from previous subsection:
 = ∑︁ .</p>
      <p>=1
( ) =
 −  1
√</p>
      <p>→ ,   → ∞,</p>
      <p>This means that compound Poisson process
where  = ∑︀ =1 ,  is Poisson process with intensity  and  is Brownian motion.
 = √︀ 2/  +  1
ˆ  = √ 2 +  1
can be approximated by
 = (, ) + ˆ  = (, ) + √ 2,
(, ) = (, ) +
 1 .</p>
      <p>It can be noticed that both shot-noise and compound Poisson noise process both have Gaussian
approximations, but these noise processes have diferent impact on the images. Shot noise decays and
disappears as time passes. But the Compound Poisson noise process does not disappear, its efect stays
at that part of the image where it occurred.</p>
      <p>
        Both types of noise can be filtered out using Kalman filter if the intensity of the underlying Poisson
process is high and thus the Gaussian approximation holds.
2.3. Kalman filtering for image restoration
Kalman filtering is used to estimate the variables of the control system subject to stochastic disturbances
caused by noisy measurements of the input variables [
        <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15">12, 13, 14, 15</xref>
        ]. There are two kinds of equations
in Kalman filter: time update equations and measurement update equations. The time update equations
obtain a priory estimates of the state and covariance matrix. The measurement update equations
improve the estimate of the state by using new measurement.
      </p>
      <p>We assume that the image sequence is captured by several cameras and the noise interferes during
the image acquisition process. Then the image sequence is processed for further analysis. The aim is to
construct the filter that would eficiently denoise the image sequence and would produce acceptable
results with such kind of noise. The representation of the image for the Kalman filter is pixelwise.</p>
      <p>The noise free pixel value is , which is assumed to be the first order autoregression model. The
process looks as follows:</p>
      <p>+1 =   + ,
where
•  is a constant and depends on signal parameters;
•  is Gaussian noise with zero mean and  2 variance.</p>
      <p>Such a model is often used to represent pixel values in video signals.</p>
      <p>The measured signal is given by the following equation:</p>
      <p>=  + ,
where  the independent of  additive zero mean Gaussian white noise with variance  2.
We need to construct a linear unbiased estimate ˆ  of  having the observations 1, 2, ..., . The
estimation error is denoted by ˜  =  − ˆ . The variance of the error is denoted by ˜ and defined as
follows:</p>
      <p>˜ = [(˜ )2].</p>
      <p>The discrete Kalman filter is assessed through the iterative application of the following equations:
(13)
(14)
(15)
(16)
(17)
(18)
(19)
• filter equations;
• variance of the estimation error and the coeficient ;</p>
      <p>*  = 2ˆ − 1,
ˆ  = *  + { − *  };</p>
      <p>* = 2˜− 1 +  2 ,
 = *{* +  2}− 1,</p>
      <p>˜ = * − *.</p>
      <p>Note that *+1 = [(2˜  +  )2]. This algorithm is applied to each pixel and at each time instant.</p>
      <p>The estimated pixel value ˆ  the output for each iteration . It provides the filtered image for the
further analysis.</p>
      <p>We consider the following parameters for the shot-noise process:
• intensity of the Poisson process equals 1.04,
• jump size y is normally distributed N(0, 0.007).</p>
      <p>The shot-noise and compound Poisson process look as shown in figures 1 and 2.</p>
      <p>
        The example consists of a sequence of 2D RGB images, where certain pixels in the video are afected
by a shot noise process, leading to corruption as noted in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. A Kalman filter is then employed to
process the sequence of images corrupted by shot noise, efectively restoring them. Figures 3 and 4
illustrate the example.
      </p>
      <p>Figure 3 shows one image taken from the original video sequence of images. The original image
sequence is not corrupted by any noise. Figure 4(a) shows the same image as in figure 3 but corrupted
by the additive shot-noise. One can see that not the whole image is corrupted but only a part of it (the
upper part). This means that not every pixel is noisy but only the pixels on the upper side. In real
life this may occur due to the problems with the camera sensor. Next, the shot-noise corrupted image
sequence is denoised using the Kalman filtering techniques. In figure 4(b) the corresponding denoised
image is shown. By comparing figures 3 and 4(b) (calculating the MSE), one can evaluate the quality of
restoration. Although, the noise is not removed completely, the quality of the image becomes much
better. The similar results concerning compound Poisson noise are show in figures 4(c) and 4(d).</p>
      <p>The results of the performance of other denoising techniques, such as spatial Wiener filter, median
iflter, bilateral filter, multilayer perceptron model, comparing to the proposed approach are provided in
table 1.</p>
      <p>The higher PSNR value value means the better image filtration quality, therefore, the use of proposed
ifltering approach (Kalman filtering) gave better results amoung other filters.
Filters</p>
      <p>PSNR(dB) value
The proposed filtering approach</p>
      <p>Spatial Wiener filter</p>
      <p>Median filter</p>
      <p>Bilateral filter
Multilayer perceptron model</p>
    </sec>
    <sec id="sec-2">
      <title>3. Conclusion</title>
      <p>In this paper we have solved the problem of filtering the pixels of the video corrupted by shot-noise
and compound Poisson noise. Shot noise brings the efect of instant jump of the pixel value that
slowly decays as time passes. Compound Poisson noise gives the efect of the instant jump of the pixel
intensity that does not decay as time passes. Therefore it is very important to filter this kind of noise.
Standard filtering techniques would not work well for such type of noise. Therefore, we considered
approximating shot-noise and compound Poisson noise with Gaussian process and applying Kalman
ifltering to remove shot noise from the sequence of images. Kalman filtering uses the filtered image
from the previous step to denoise (filter) the image on the current step. The graphical illustration was
shown on several figures. In average, the shot noise corrupted image sequence is 90% restored using
Kalman filter comparing to the original image sequence. For compound Poisson process the filtering
quality is 80% on average.</p>
      <p>The central result of this paper allows to model the efects of the random shot-noise and compound
Poisson jumps that corrupts the video data, to approximate the both kinds of noise by Gaussian noise
and to apply the Kalman filtering techniques for the video restoration.</p>
      <p>Declaration on Generative AI: The authors have not employed any generative AI tools.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Awad</surname>
          </string-name>
          ,
          <article-title>Denoising images corrupted with impulse, Gaussian, or a mixture of impulse and Gaussian noise</article-title>
          ,
          <source>Engineering Science and Technology, an International Journal</source>
          <volume>22</volume>
          (
          <year>2019</year>
          )
          <fpage>746</fpage>
          -
          <lpage>753</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.jestch.
          <year>2019</year>
          .
          <volume>01</volume>
          .012.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Swamy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. K.</given-names>
            <surname>Kulkarni</surname>
          </string-name>
          ,
          <article-title>A basic overview on image denoising techniques</article-title>
          ,
          <source>International Research Journal of Engineering and Technology (IRJET) 7</source>
          (
          <year>2020</year>
          )
          <fpage>851</fpage>
          -
          <lpage>857</lpage>
          . URL: https://www.irjet.net/ archives/V7/i5/IRJET-V7I5166.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Szeliski</surname>
          </string-name>
          , Computer Vision: Algorithms and Applications, Texts in Computer Science, 2 ed.,
          <year>2010</year>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -34372-9.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R. O.</given-names>
            <surname>Duda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. E.</given-names>
            <surname>Hart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. G.</given-names>
            <surname>Stork</surname>
          </string-name>
          , Pattern Classification, Wiley,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Swathi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Magudeeswaran</surname>
          </string-name>
          ,
          <article-title>Analysis and Comparison of Diferent Image Denoising Techniques- Review</article-title>
          ,
          <source>International Journal of Computer Science and Mobile Applications</source>
          <volume>2</volume>
          (
          <year>2014</year>
          )
          <fpage>115</fpage>
          -
          <lpage>124</lpage>
          . URL: https://www.ijcsma.com/articles/ analysis-and
          <article-title>-comparison-of-diferent-image-denoising-techniques-review</article-title>
          .
          <source>pdf.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ertürk</surname>
          </string-name>
          ,
          <article-title>Real-Time Digital Image Stabilization Using Kalman Filters, Real-Time Imaging 8 (</article-title>
          <year>2002</year>
          )
          <fpage>317</fpage>
          -
          <lpage>328</lpage>
          . doi:
          <volume>10</volume>
          .1006/rtim.
          <year>2001</year>
          .
          <volume>0278</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Piovoso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Laplante</surname>
          </string-name>
          ,
          <article-title>Kalman filter recipes for real-time image processing, Real-Time Imaging 9 (</article-title>
          <year>2003</year>
          )
          <fpage>433</fpage>
          -
          <lpage>439</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.rti.
          <year>2003</year>
          .
          <volume>09</volume>
          .005,
          <string-name>
            <surname>Special</surname>
            <given-names>Issue</given-names>
          </string-name>
          <article-title>on Software Engineering of Real-time Imaging Systems</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Citrin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Azimi-Sadjadi</surname>
          </string-name>
          ,
          <article-title>A full-plane block Kalman filter for image restoration</article-title>
          ,
          <source>IEEE Transactions on Image Processing</source>
          <volume>1</volume>
          (
          <year>1992</year>
          )
          <fpage>488</fpage>
          -
          <lpage>495</lpage>
          . doi:
          <volume>10</volume>
          .1109/83.199918.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Flach</surname>
          </string-name>
          ,
          <source>Machine Learning: The Art and Science of Algorithms that Make Sense of Data</source>
          , Cambridge University Press,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <article-title>Jump regression, image processing, and quality control</article-title>
          ,
          <source>Quality Engineering</source>
          <volume>30</volume>
          (
          <year>2018</year>
          )
          <fpage>137</fpage>
          -
          <lpage>153</lpage>
          . doi:
          <volume>10</volume>
          .1080/08982112.
          <year>2017</year>
          .
          <volume>1357077</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>O.</given-names>
            <surname>Putyatina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sass</surname>
          </string-name>
          ,
          <article-title>Approximation for portfolio optimization in a financial market with shot-noise jumps</article-title>
          ,
          <source>Computational Management Science</source>
          <volume>15</volume>
          (
          <year>2018</year>
          )
          <fpage>161</fpage>
          -
          <lpage>186</lpage>
          . doi:
          <volume>10</volume>
          .1007/ s10287-017-0294-5.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ababsa</surname>
          </string-name>
          ,
          <article-title>Robust Extended Kalman Filtering for camera pose tracking using 2D to 3D lines correspondences</article-title>
          ,
          <source>in: 2009 IEEE/ASME International Conference on Advanced Intelligent Mechatronics</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>1834</fpage>
          -
          <lpage>1838</lpage>
          . doi:
          <volume>10</volume>
          .1109/AIM.
          <year>2009</year>
          .
          <volume>5229789</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>R. M. Tymchyshyn</surname>
            ,
            <given-names>O. Y.</given-names>
          </string-name>
          <string-name>
            <surname>Volkov</surname>
            ,
            <given-names>O. Y.</given-names>
          </string-name>
          <string-name>
            <surname>Gospodarchuk</surname>
            ,
            <given-names>Y. P.</given-names>
          </string-name>
          <string-name>
            <surname>Bogachuk</surname>
          </string-name>
          , Modern approaches to computer vision,
          <source>Upravlâûsˆie sistemy i mašiny</source>
          (
          <year>2018</year>
          )
          <fpage>46</fpage>
          -
          <lpage>73</lpage>
          . doi:
          <volume>10</volume>
          .15407/usim.
          <year>2018</year>
          .
          <volume>06</volume>
          .046.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>V. A.</given-names>
            <surname>Gorokhovatsky</surname>
          </string-name>
          ,
          <article-title>Compression of descriptions in the structural image recognition</article-title>
          ,
          <source>Telecommunications and Radio Engineering</source>
          <volume>70</volume>
          (
          <year>2011</year>
          )
          <fpage>1363</fpage>
          -
          <lpage>1371</lpage>
          . doi:
          <volume>10</volume>
          .1615/telecomradeng.v70.
          <year>i15</year>
          .
          <fpage>60</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Alcantarilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bartoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Davison</surname>
          </string-name>
          , KAZE Features, in: A.
          <string-name>
            <surname>Fitzgibbon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Lazebnik</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Perona</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Sato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          Schmid (Eds.),
          <source>Computer Vision - ECCV</source>
          <year>2012</year>
          , volume
          <volume>7577</volume>
          of Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2012</year>
          , pp.
          <fpage>214</fpage>
          -
          <lpage>227</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -33783-3_
          <fpage>16</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>C. M. Bishop</surname>
          </string-name>
          ,
          <source>Pattern Recognition and Machine Learning, Information Science and Statistics</source>
          , Springer,
          <year>2006</year>
          . URL: https://www.microsoft.com/en-us/research/wp-content/uploads/2006/01/ Bishop-Pattern-
          <article-title>Recognition-and-</article-title>
          <string-name>
            <surname>Machine-</surname>
          </string-name>
          Learning-
          <year>2006</year>
          .pdf.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>