<!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>Automatic Choice of Denoising Parameter in Perona­Malik Model</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>A.V. Nasonov</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Faculty of Computational Mathematics and Cybernetics Lomonosov Moscow State University Moscow</institution>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this work, we propose a no-reference method for automatic choice of the parameters of Perona-Malik image difusion algorithm for the problem of image denoising. The idea of the approach it to analyze and quantify the presence of structures in the diference image between the noisy image and the processed image as the mutual information value. We apply the proposed method to photographic images and to retinal images with modeled Gaussian noise with diferent parameters and analyze the efects of no-reference parameter choice compared to the optimal results. The proposed algorithm shows the efectiveness of no-reference parameter choice for the problem of image denoising.</p>
      </abstract>
      <kwd-group>
        <kwd>Image denoising</kwd>
        <kwd>non-linear difusion</kwd>
        <kwd>mutual information</kwd>
        <kwd>automatic parameter choice</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        One of the main challenges in image processing is
denoising, as images are often corrupted by noise
during acquisition, transmission or storage. The goal is to
restore the original image by removing all noise while
preserving the contents. Image denoising is usually
needed as a preparation step in other image
processing methods. There has been a great research efort
in that field, yet the problem remains unsolved. In
this paper, we will use non-linear difusion method
proposed in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] by Perona and Malik, which
represents a filtered image as a solution of nonlinear
difusion equation with the original image as initial state
and homogeneous Neumann boundary conditions. By
choosing the difusion parameter, one can manage to
clean flat areas and preserve edges. Non-linear
difusion is an iterative process so there is a problem of
stop mechanism.
      </p>
      <sec id="sec-1-1">
        <title>Most algorithms depend on noise level and thus</title>
        <p>
          must be controlled by parameters entered by a user
or estimated automatically. A common approach for
automatic choice of the parameters is to estimate the
noise level and then choose the parameters according
to this noise level [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
        </p>
        <p>
          A less common approach is to analyze the
preservation of image contents after image restoration and
to pose the stopping criterion of anisotropic
difusion. For example, the work [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] analyzes the edge
characteristics, the work [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] calculates image
statistics for speckle noise reduction. In [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], a analysis of
the contents in the diference image between the
original noisy image and the processed image is performed.
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>Its idea comes from an assumption, that in the ideal</title>
        <p>case the diference image must contain just random
values without any structures from the original image.</p>
      </sec>
      <sec id="sec-1-3">
        <title>If there are structures from the original noisy image, then we have wiped out the important information as well as the noise.</title>
      </sec>
      <sec id="sec-1-4">
        <title>In this work, we investigate the automatic choice</title>
        <p>of the parameters for Perona-Malik image difusion for</p>
      </sec>
      <sec id="sec-1-5">
        <title>Gaussian noise for photographic and retinal images.</title>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Perona­Malik image diffusion</title>
      <sec id="sec-2-1">
        <title>One of the methods for image denoising is based</title>
        <p>
          on non-linear difusion that considers the cleaned
image as the solution of the heat conduction. The
diffusion coefficient is chosen to reduce the difusivity
in locations, which have more likelihood to be edges.
Such methods allow to preserve edges while denoising
due to the right choice of coefficient. Koenderink [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]
and Hummel [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] pointed out that an imaged convolved
with Gaussian kernel can be viewed as the solution of
the heat conduction equation with original image as
initial condition.
        </p>
        <p>∂u</p>
        <p>= div(c∇u), (x, t) ∈ Ω × [0, T ],
∂t
u(x, 0) = l0,</p>
        <p>x ∈ Ω,
∂u</p>
        <p>= 0, (x, t) ∈ ∂Ω × [0, T ],
∂⃗n
where l0 is the input image defined in spatial domain
Ω, c is the difusion coefficient, u(x, T ) is the result of
heat distribution at moment T .</p>
        <p>
          In linear difusion, the coefficient c is considered
to be constant and independent of the image. In
nonlinear difusion, the coefficient c is a function of image
gradient magnitude c = c(|∇u|), which controls the
blurring efect. Setting c to 1 in interior of each
region and 0 at the boundaries will encourage smoothing
within a region and stop it on the edge, so that the
boundaries remain sharp. In [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] Perona and Malik
proposed two functions as edge-estimator:
        </p>
        <p>( ( s )2)
c1(s) = exp − K (1)
and c2(s) = (1 s )2 , (2)
1 +</p>
        <p>K
where K is the parameter of the method.</p>
      </sec>
      <sec id="sec-2-2">
        <title>The difusion equation can be solved numerically by simple step algorithm:</title>
        <p>un+1 = un + tn · c(|∇u|)∆u,
u0 = u(x, 0) = I0,
∑ tn = T.
n</p>
      </sec>
      <sec id="sec-2-3">
        <title>In our work, we use the model (2).</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Target images</title>
      <sec id="sec-3-1">
        <title>We have analyzed the automatic choice of the pa</title>
        <p>
          rameters for the Perona-Malik image difusion
algorithm for images of the following two classes:
• Photographic images from TID database [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ];
• Retinal images from DRIVE database [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>An example of those images is shown in Fig. 1.</title>
      </sec>
      <sec id="sec-3-3">
        <title>In order to model noisy images, we have added</title>
        <p>
          white Gaussian noise with diferent levels σ in [
          <xref ref-type="bibr" rid="ref1">1, 32</xref>
          ]
range to the reference images.
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>TID database [8]</title>
      </sec>
      <sec id="sec-3-5">
        <title>DRIVE database [9].</title>
        <p>4. Full­reference parameter analysis</p>
      </sec>
      <sec id="sec-3-6">
        <title>For each noisy image, we have obtained a pair</title>
        <p>of (K, T ) parameters that maximizes PSNR and</p>
      </sec>
      <sec id="sec-3-7">
        <title>SSIM [10] metric values. We have found that for each</title>
        <p>image there is a set of (K, T ) values producing the
results that are almost indistinguishable from the
optimal result. The set is banana-shaped and lies
perpendicular to the line passing though the zero point.
Fig. 2 shows an example of optimal (K, T ) values for
one of the images for diferent noise levels.</p>
        <p>Noise = 3
Noise = 8
Fig. 2. A visualization of optimal (K, T ) parameters
for an image with different noise levels in terms of</p>
      </sec>
      <sec id="sec-3-8">
        <title>PSNR. The horizontal axis represents K value in</title>
        <p>logarithmic scale. The vertical axis represents T
value. Top-left corner is (0, 0) point. White regions
corresponds to (K, T ) values that produce images
with PSNR values close to the optimal value. Black
regions correspond to PSNR values equal or less than</p>
      </sec>
      <sec id="sec-3-9">
        <title>PSNR for the unprocessed image.</title>
      </sec>
      <sec id="sec-3-10">
        <title>We have also noticed that for each noise level the</title>
        <p>ratio K/T can be fixed, and the parameter
optimization becomes one-dimensional, but for diferent noise
level the optimal ratio K/T set is diferent.</p>
        <p>In order to go from two-dimensional to
onedimensional parameter optimization for any noise
level, we have analyzed the behavior of optimal (K, T )
values and have found out that a set of optimal points
(log K, √T ) lies along a line. Therefore, we introduce
single-argument parameterization for (K, T ) values:
p
K = q1q2 ,</p>
        <p>T = p2, (3)
where the coefficients q1 and q2 are chosen
experimentally by optimizing the full-reference metrics values.</p>
      </sec>
      <sec id="sec-3-11">
        <title>For both TID and DRIVE images, we have fixed</title>
        <p>q1 = 0.1 and optimized q2 value. The ranges of
optimal values for TID images and for DRIVE images
are diferent, but they intersects. We have chosen
q2 = 4600 from the intersection.
5. No­reference parameter choice</p>
        <p>
          We use the algorithm [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] for non-reference
parameter choice. The algorithm is based on the assumption
that the diference between input noisy and denoised
images should not have features belonging to original
image. In order to detect the presence of these
features, the algorithm analyses the eigenvalues of
Hessian matrix for scale and direction evaluation of ridges
and edges. The outcome of the algorithm is value µ
— the mutual information that can be expressed as
the structure-to-noise ratio for the diference image.
        </p>
      </sec>
      <sec id="sec-3-12">
        <title>The lower the value µ is, the less details are corrupted</title>
        <p>compared to noise removal.</p>
        <p>We use the following scenario: an image denoising
algorithm is executed with diferent parameters, then
the mutual information µ value is calculated between
the input image and each denoising result, and the
image that minimizes the mutual information is
chosen as the optimal result. In practice, there can be
several local minima, and a special analysis should be
performed in order to choose the optimal result.</p>
      </sec>
      <sec id="sec-3-13">
        <title>After replacing the two-parameter model with the</title>
        <p>single-parameter model (3), we find the optimal p
value using both full-reference and no-reference
approach based on calculating the mutual information
coefficient.</p>
        <p>It has been found that mutual information
correlates well with PSNR and SSIM values for noise level
σ &gt; 2. An example is shown in Fig. 3. A argument
where PSNR and/or SSIM reaches its maximum is
close to a local minimum of µ(p) function. In the case
of several local minima points, we find the one that
maximizes the drop:
popt = argp mp′&lt;axp µ(p′) − µ(p).
(4)</p>
        <p>In the case of very low noise level (σ ≤ 2), the
method has limited application. Non-linear difusion
improves the image very little in the case of low noise.</p>
      </sec>
      <sec id="sec-3-14">
        <title>The diference image has low magnitude, so the mutual information coefficient is low, and local minimum point becomes unstable or even disappears.</title>
        <p>TID, I04, noise 10
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61
PSNR SSIM MU</p>
        <p>DRIVE, I03, noise 6
1,2
1
0,8
0,6
0,4
0,2
0
1,2
1
0,8
0,6
0,4
0,2
0
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61</p>
        <p>PSNR SSIM MU
Fig. 3. Examples of the dependence of PSNR, SSIM
and mutual information on the parameter p
corresponding to denoising strength. The PSNR and</p>
      </sec>
      <sec id="sec-3-15">
        <title>SSIM values are normalized into [0, 1] range.</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>6. Results</title>
      <sec id="sec-4-1">
        <title>The numerical results for different scenarios of de</title>
        <p>noising parameter choice are presented in table 1. The
results are averaged for all the images with noise level
σ &gt; 2.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Despite the fact that the proposed no-reference al</title>
        <p>gorithm has worse PSNR and SSIM values than the
optimal ones, the diference between the results of the
proposed algorithm and the optimal results is
practically indistinguishable, and the efectiveness o f image
denoising is clearly visible.</p>
      </sec>
      <sec id="sec-4-3">
        <title>The individual results are shown in Fig. 4, 5, 6.</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>7. Conclusion</title>
      <sec id="sec-5-1">
        <title>The paper has shown that the parameters of the</title>
      </sec>
      <sec id="sec-5-2">
        <title>Perona-Malik image denoising algorithm can be automatically and efectively chosen by the algorithm that analyzes the presence of structures from the input image in the diference image.</title>
        <p>The work was supported by Russian Science
Foundation grant 17-11-01279.
0,1
0,09
0,08
0,07
0,06
0,05
0,04
0,03
0,02
0,01
0
0,06
0,05
0,04
0,03
0,02
0,01
0</p>
      </sec>
      <sec id="sec-5-3">
        <title>Optimization method</title>
      </sec>
      <sec id="sec-5-4">
        <title>Input noisy images</title>
      </sec>
      <sec id="sec-5-5">
        <title>Full-reference, double-parameter, by PSNR</title>
      </sec>
      <sec id="sec-5-6">
        <title>Full-reference, double-parameter, by SSIM</title>
      </sec>
      <sec id="sec-5-7">
        <title>Full-reference, single-parameter, by PSNR</title>
      </sec>
      <sec id="sec-5-8">
        <title>Full-reference, single-parameter, by SSIM</title>
      </sec>
      <sec id="sec-5-9">
        <title>No-reference, single-parameter, by MU (proposed)</title>
        <p>TID</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>8. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Pietro</given-names>
            <surname>Perona</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jitendra</given-names>
            <surname>Malik</surname>
          </string-name>
          .
          <article-title>Scale-space and edge detection using anisotropic difusion</article-title>
          .
          <source>IEEE Transactions on pattern analysis and machine intelligence</source>
          ,
          <volume>12</volume>
          (
          <issue>7</issue>
          ):
          <fpage>629</fpage>
          -
          <lpage>639</lpage>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Karl</given-names>
            <surname>Krissian</surname>
          </string-name>
          and
          <string-name>
            <given-names>Santiago</given-names>
            <surname>Aja-Fernández</surname>
          </string-name>
          .
          <article-title>Noise-driven anisotropic difusion filtering of mri</article-title>
          .
          <source>IEEE transactions on image processing</source>
          ,
          <volume>18</volume>
          (
          <issue>10</issue>
          ):
          <fpage>2265</fpage>
          -
          <lpage>2274</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Chourmouzios</given-names>
            <surname>Tsiotsios</surname>
          </string-name>
          and
          <string-name>
            <given-names>Maria</given-names>
            <surname>Petrou</surname>
          </string-name>
          .
          <article-title>On the choice of the parameters for anisotropic diffusion in image processing</article-title>
          .
          <source>Pattern recognition</source>
          ,
          <volume>46</volume>
          (
          <issue>5</issue>
          ):
          <fpage>1369</fpage>
          -
          <lpage>1381</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Santiago</given-names>
            <surname>Aja-Fernández</surname>
          </string-name>
          and
          <article-title>Carlos AlberolaLópez. On the estimation of the coefficient of variation for anisotropic difusion speckle filtering</article-title>
          .
          <source>IEEE Transactions on Image Processing</source>
          ,
          <volume>15</volume>
          (
          <issue>9</issue>
          ):
          <fpage>2694</fpage>
          -
          <lpage>2701</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Nikolay</given-names>
            <surname>Mamaev</surname>
          </string-name>
          , Dmitry Yurin, and
          <string-name>
            <given-names>Andrey</given-names>
            <surname>Krylov</surname>
          </string-name>
          .
          <article-title>Choice of the parameter for bm3d denoising algorithm using no-reference metric</article-title>
          .
          <source>In 2018 7th European Workshop on Visual Information Processing (EUVIP)</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . IEEE,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Jan</surname>
            <given-names>J Koenderink.</given-names>
          </string-name>
          <article-title>The structure of images</article-title>
          .
          <source>Biological cybernetics</source>
          ,
          <volume>50</volume>
          (
          <issue>5</issue>
          ):
          <fpage>363</fpage>
          -
          <lpage>370</lpage>
          ,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Robert</surname>
            <given-names>A</given-names>
          </string-name>
          <string-name>
            <surname>Hummel</surname>
          </string-name>
          .
          <article-title>Representations based on zero-crossings in scale-space</article-title>
          .
          <source>In Readings in Computer Vision</source>
          , pages
          <fpage>753</fpage>
          -
          <lpage>758</lpage>
          . Elsevier,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Ponomarenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ieremeiev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lukin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Egiazarian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Astola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Vozel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chehdi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Carli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Battisti</surname>
          </string-name>
          , and
          <string-name>
            <surname>C.-C. Jay Kuo</surname>
          </string-name>
          .
          <article-title>Image database tid2013: Peculiarities, results and perspectives</article-title>
          .
          <source>Signal Processing: Image Communication</source>
          ,
          <volume>30</volume>
          :
          <fpage>57</fpage>
          -
          <lpage>77</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>M.D. Abramof J.J. Staa</surname>
            and, M. Niemeijer,
            <given-names>M.A.</given-names>
          </string-name>
          <string-name>
            <surname>Viergever</surname>
            , and
            <given-names>B. van Ginneken</given-names>
          </string-name>
          .
          <article-title>Ridge based vessel segmentation in color images of the retina</article-title>
          .
          <source>IEEE Transactions on Medical Imaging</source>
          ,
          <volume>23</volume>
          :
          <fpage>501</fpage>
          -
          <lpage>509</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bovik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Sheikh</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Simoncelli</surname>
          </string-name>
          .
          <article-title>Image quality assessment: from error visibility to structural similarity</article-title>
          .
          <source>IEEE Transactions on Image Processing</source>
          ,
          <volume>13</volume>
          (
          <issue>4</issue>
          ):
          <fpage>600</fpage>
          -
          <lpage>612</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>