<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ojapps</journal-id>
      <journal-title-group>
        <journal-title>Open Journal of Applied Sciences</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2165-3925</issn>
      <issn pub-type="ppub">2165-3917</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ojapps.2026.164077</article-id>
      <article-id pub-id-type="publisher-id">ojapps-151112</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Biomedical</subject>
          <subject>Life Sciences</subject>
          <subject>Chemistry</subject>
          <subject>Materials Science</subject>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
          <subject>Engineering</subject>
          <subject>Physics</subject>
          <subject>Mathematics</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Restoration of Multichannel Images by Nonlinear Parabolic Partial Differential Equations (PDEs) and Optimization by Convolutional Neural Networks (CNNs)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Kouassi</surname>
            <given-names>Konan Hyacinthe</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Etienne</surname>
            <given-names>Goli Konan Charles</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Moussa</surname>
            <given-names>Diomande</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">0000-0002-8681-400X</contrib-id>
          <name name-style="western">
            <surname>Olivier</surname>
            <given-names>Asseu</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Laboratoire des Sciences, des Technologies de l’Information et de la Communication en abrégé (LASTIC), Ecole Supérieure Africaine des Technologies de l’Information et de la Communication (ESATIC), Abidjan, Côte d’Ivoire </aff>
      <aff id="aff2"><label>2</label> Institut National Polytechnique Félix Houphouët-Boigny (INPHB), École Doctorale Polytechnique (EDP)-Sciences et Techniques de l’Ingénieur (STI), Yamoussoukro, Côte d’Ivoire </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>02</day>
        <month>04</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>04</month>
        <year>2026</year>
      </pub-date>
      <volume>16</volume>
      <issue>04</issue>
      <fpage>1336</fpage>
      <lpage>1343</lpage>
      <history>
        <date date-type="received">
          <day>29</day>
          <month>03</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>27</day>
          <month>04</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>30</day>
          <month>04</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ojapps.2026.164077">https://doi.org/10.4236/ojapps.2026.164077</self-uri>
      <abstract>
        <p>Multichannel image restoration is a fundamental problem in image processing due to the unavoidable degradation introduced during acquisition, particularly Gaussian noise. In this article, we propose a hybrid approach combining a variational model based on nonlinear parabolic partial differential equations (PDEs) of the Φ-Laplacian type and a convolutional neural network (CNN) for color image denoising. The variational model ensures adaptive smoothing while preserving contours and fine structures through controlled nonlinear diffusion. In parallel, the CNN learns to reconstruct the clean image from the noisy image by exploiting the statistical regularities of the data. An experimental comparison is performed on images noisy with Gaussian noise, using the PSNR metric to evaluate the restoration quality. The results show that the Φ-Laplacian model significantly improves image quality (≈30.5 dB), while the CNN achieves superior performance (≈32 dB), with better visual reproduction. Analysis of the convergence curves highlights the stability of the proposed methods. Finally, the study underscores the value of a hybrid approach combining mathematical rigor and machine learning power.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Multichannel İmage Restoration</kwd>
        <kwd>Partial Differential Equations (PDEs)</kwd>
        <kwd>Φ-Laplacian</kwd>
        <kwd>Nonlinear Diffusion</kwd>
        <kwd>Convolutional Neural Networks (CNNs)</kwd>
        <kwd>Image Denoising</kwd>
        <kwd>PSNR</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Variational Models</kwd>
        <kwd>Computer Vision</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Image denoising is an essential step in digital image processing [<xref ref-type="bibr" rid="B1">1</xref>]. Images acquired by optical sensors are often degraded by various types of noise, including Gaussian, impulse, and Poisson noise [<xref ref-type="bibr" rid="B2">2</xref>]. </p>
      <p>Classical regularization methods, such as the anisotropic scattering model of Pietro Perona and Jitendra Malik, are used to address this issue. The anisotropic scattering model introduced by Perona and Malik represents a key step in the development of edge-preserving denoising methods by introducing a gradient-dependent scattering coefficient. The Leonid Rudin-Stanley Osher-Emad Fatemi (ROF) model, and the Φ-Laplacian equations [<xref ref-type="bibr" rid="B2">2</xref>], rely on minimizing an energy that combines data fidelity and spatial regularity. However, these approaches require fine-tuning of the parameters and do not always generalize well to diverse image contexts [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B4">4</xref>]. Conversely, convolutional neural networks offer the ability to learn complex representations from data and have proven extremely effective in image restoration. “The work of Zhang <italic>et al.</italic> [<xref ref-type="bibr" rid="B3">3</xref>] demonstrated that residual learning-based CNNs achieve cutting-edge performance in image denoising, surpassing classical variational methods.” The U-Net architecture proposed by Ronneberger <italic>et al.</italic> [<xref ref-type="bibr" rid="B5">5</xref>] enables accurate image reconstruction thanks to its jump connections, ensuring the preservation of fine details and spatial structures. Thus, the combination of the two paradigms (continuous mathematical modeling and deep learning) offers a promising hybrid approach, leveraging both the theoretical robustness and the learning power of neural networks [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B7">7</xref>]. The main objective of this work is to design a color image denoising system combining the advantages of classical variational methods and those of convolutional neural networks (CNNs). More specifically, it is about improving the quality of images altered by Gaussian noise while preserving contours and fine details; comparing the performance of a mathematical model of nonlinear diffusion (Φ-Laplacian) and a neural network trained for the same task; and showing the convergence of the optimization process through the evolution of the PSNR (Peak Signal-to-Noise Ratio) [<xref ref-type="bibr" rid="B6">6</xref>].</p>
    </sec>
    <sec id="sec2">
      <title>2. Theoretical Framework</title>
      <sec id="sec2dot1">
        <title>2.1. Variational Φ-Laplacian Model</title>
        <p>The image restoration model considered is based on a variational approach consisting of minimizing an energy functional defined on the spatial domain <inline-formula><mml:math><mml:mrow><mml:mi> Ω </mml:mi><mml:mo> ⊂ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mn> 2 </mml:mn></mml:msup><mml:mo></mml:mo></mml:mrow></mml:math></inline-formula> [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B2">2</xref>]:</p>
        <disp-formula id="FD1">
          <mml:math>
            <mml:mrow>
              <mml:mi>E</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>u</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:mrow>
                  <mml:msub>
                    <mml:mo>∫</mml:mo>
                    <mml:mi>Ω</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:mo>[</mml:mo>
                      <mml:mrow>
                        <mml:mfrac>
                          <mml:mn>1</mml:mn>
                          <mml:mn>2</mml:mn>
                        </mml:mfrac>
                        <mml:msup>
                          <mml:mrow>
                            <mml:mrow>
                              <mml:mo>(</mml:mo>
                              <mml:mrow>
                                <mml:mi>u</mml:mi>
                                <mml:mo>−</mml:mo>
                                <mml:mi>f</mml:mi>
                              </mml:mrow>
                              <mml:mo>)</mml:mo>
                            </mml:mrow>
                          </mml:mrow>
                          <mml:mn>2</mml:mn>
                        </mml:msup>
                        <mml:mo>+</mml:mo>
                        <mml:mi>α</mml:mi>
                        <mml:mtext>
                           
                        </mml:mtext>
                        <mml:mi>Φ</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:mrow>
                              <mml:mo>|</mml:mo>
                              <mml:mrow>
                                <mml:mo>∇</mml:mo>
                                <mml:mi>u</mml:mi>
                              </mml:mrow>
                              <mml:mo>|</mml:mo>
                            </mml:mrow>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                      <mml:mo>]</mml:mo>
                    </mml:mrow>
                    <mml:mtext>d</mml:mtext>
                    <mml:mi>x</mml:mi>
                  </mml:mrow>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Interpretation of terms</bold></p>
        <p><inline-formula><mml:math display="inline"><mml:mi> f </mml:mi></mml:math></inline-formula> : observed (noisy) image [<xref ref-type="bibr" rid="B1">1</xref>].<inline-formula><mml:math><mml:mi> u </mml:mi></mml:math></inline-formula> : desired restored image.<inline-formula><mml:math><mml:mrow><mml:mo> ∇ </mml:mo><mml:mi> u </mml:mi></mml:mrow></mml:math></inline-formula> : spatial gradient of the image (detects local variations) [<xref ref-type="bibr" rid="B4">4</xref>].<inline-formula><mml:math><mml:mrow><mml:mi> Φ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mrow><mml:mo> | </mml:mo><mml:mrow><mml:mo> ∇ </mml:mo><mml:mi> u </mml:mi></mml:mrow><mml:mo> | </mml:mo></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> : regularization term.<inline-formula><mml:math><mml:mrow><mml:mi> α </mml:mi><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> : regularization parameter controlling the trade-off between fidelity and smoothing.</p>
        <p><bold>Choice of the regularization function</bold></p>
        <p>We consider the function:</p>
        <disp-formula id="FD2">
          <mml:math>
            <mml:mrow>
              <mml:mi>Φ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>t</mml:mi>
                    <mml:mi>p</mml:mi>
                  </mml:msup>
                </mml:mrow>
                <mml:mi>p</mml:mi>
              </mml:mfrac>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>with</mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mn>1</mml:mn>
              <mml:mo>≤</mml:mo>
              <mml:mi>p</mml:mi>
              <mml:mo>≤</mml:mo>
              <mml:mn>2</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>If <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:math></inline-formula> → linear diffusion (classical Gaussian filtering) [<xref ref-type="bibr" rid="B1">1</xref>].If <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> → Total variation (TV) type regularization [<xref ref-type="bibr" rid="B2">2</xref>].If <inline-formula><mml:math><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> &lt; </mml:mo><mml:mi> p </mml:mi><mml:mo> &lt; </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:math></inline-formula> → non-linear diffusion, allowing a compromise between smoothing and preserving edges [<xref ref-type="bibr" rid="B4">4</xref>].</p>
        <p><bold>Euler-Lagrange equation</bold></p>
        <p>Minimizing the energy leads to the following Euler-Lagrange equation [<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B3">3</xref>]:</p>
        <disp-formula id="FD3">
          <mml:math>
            <mml:mrow>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:mi>u</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:mi>t</mml:mi>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>u</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:mi>f</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:mi>α</mml:mi>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>div</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>Φ</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>|</mml:mo>
                        <mml:mrow>
                          <mml:mo>∇</mml:mo>
                          <mml:mi>u</mml:mi>
                        </mml:mrow>
                        <mml:mo>|</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:mo>∇</mml:mo>
                      <mml:mi>u</mml:mi>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>|</mml:mo>
                        <mml:mrow>
                          <mml:mo>∇</mml:mo>
                          <mml:mi>u</mml:mi>
                        </mml:mrow>
                        <mml:mo>|</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where:</p>
        <p><inline-formula><mml:math><mml:mrow><mml:mtext> div </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the divergence operator.<inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> Φ </mml:mi><mml:mo> ′ </mml:mo></mml:msup><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msup><mml:mi> t </mml:mi><mml:mrow><mml:mi> p </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> .</p>
        <p>2.1.1. Physical Interpretation</p>
        <p>This equation can be interpreted as a nonlinear anisotropic diffusion process (For a detailed study of the discretization and stability of nonlinear diffusion equations, see Weickert [<xref ref-type="bibr" rid="B8">8</xref>]).</p>
        <p>The term <inline-formula><mml:math><mml:mrow><mml:mo> − </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> u </mml:mi><mml:mo> − </mml:mo><mml:mi> f </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> ensures data fidelity.The diffusion term:</p>
        <disp-formula id="FD4">
          <mml:math>
            <mml:mrow>
              <mml:mtext>div</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>|</mml:mo>
                        <mml:mrow>
                          <mml:mo>∇</mml:mo>
                          <mml:mi>u</mml:mi>
                        </mml:mrow>
                        <mml:mo>|</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mi>p</mml:mi>
                      <mml:mo>−</mml:mo>
                      <mml:mn>2</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>∇</mml:mo>
                  <mml:mi>u</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>performs adaptive smoothing:</p>
        <p>strong in homogeneous areas (noise).weak near contours (edge preservation) [<xref ref-type="bibr" rid="B8">8</xref>].</p>
        <p>2.1.2. Numerical Discretization</p>
        <p>The equation is solved numerically using an explicit scheme [<xref ref-type="bibr" rid="B2">2</xref>]:</p>
        <disp-formula id="FD5">
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mi>u</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mi>k</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mi>u</mml:mi>
                <mml:mi>k</mml:mi>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:mi>τ</mml:mi>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mi>u</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msup>
                      <mml:mo>−</mml:mo>
                      <mml:mi>f</mml:mi>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mi>α</mml:mi>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>div</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>|</mml:mo>
                            <mml:mrow>
                              <mml:mo>∇</mml:mo>
                              <mml:msup>
                                <mml:mi>u</mml:mi>
                                <mml:mi>k</mml:mi>
                              </mml:msup>
                            </mml:mrow>
                            <mml:mo>|</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mrow>
                          <mml:mi>p</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>2</mml:mn>
                        </mml:mrow>
                      </mml:msup>
                      <mml:mo>∇</mml:mo>
                      <mml:msup>
                        <mml:mi>u</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msup>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where:</p>
        <p><inline-formula><mml:math><mml:mi> τ </mml:mi></mml:math></inline-formula> is the time step. <inline-formula><mml:math><mml:mi> k </mml:mi></mml:math></inline-formula> is the iteration index. </p>
        <p>This scheme allows for progressive iteration toward a stable solution, ensuring convergence to an energy minimum [<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B7">7</xref>].</p>
        <p>2.1.3. Extension to Multichannel Images</p>
        <p>In this work, multichannel images are mode-led as vector-valued functions. In the PDE approach, channel coupling is explicitly enforced through the joint gradient norm, ensuring a shared diffusion process across channels. In contrast, the CNN implicitly captures inter-channel dependencies through multi-channel convolutional filters, enabling learned correlations between RGB components. This distinction highlights the difference between model-driven and data-driven coupling mechanisms.</p>
        <p>In the case of color images <inline-formula><mml:math><mml:mrow><mml:mi> u </mml:mi><mml:mo> : </mml:mo><mml:mi> Ω </mml:mi><mml:mo> → </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mn> 3 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> , the gradient becomes vector-valued:</p>
        <disp-formula id="FD6">
          <mml:math>
            <mml:mrow>
              <mml:mrow>
                <mml:mo>|</mml:mo>
                <mml:mrow>
                  <mml:mo>∇</mml:mo>
                  <mml:mi>u</mml:mi>
                </mml:mrow>
                <mml:mo>|</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msqrt>
                <mml:mrow>
                  <mml:munderover>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mi>c</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mn>3</mml:mn>
                  </mml:munderover>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>|</mml:mo>
                        <mml:mrow>
                          <mml:mo>∇</mml:mo>
                          <mml:msub>
                            <mml:mi>u</mml:mi>
                            <mml:mi>c</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>|</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                </mml:mrow>
              </mml:msqrt>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>This formulation allows for correlated diffusion across channels, preserving color consistency. The numerical solution of the regularization functional can be efficiently implemented using a primal-dual scheme [<xref ref-type="bibr" rid="B9">9</xref>].</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Convolutional Neural Network (CNN)</title>
        <p>In addition to the variational model, a convolutional neural network is used to learn the denoising process in a data-driven manner. CNN acts as a universal approximator, capable of learning complex transformations between noisy and clean images [<xref ref-type="bibr" rid="B10">10</xref>].</p>
        <p>2.2.1. CNN Architecture</p>
        <p>Type: Fully convolutional network (3 layers).Kernel size: 3 × 33 (padding = 1, size conservation).Number of filters: (Layer 1: 64 filters; Layer 2: 64 filters; Layer 3: 3 filters (RGB reconstruction).Activation functions: ReLU after each layer except the last.Input/output: 256 × 256 RGB images.</p>
        <p>Training parameters:</p>
        <p>Optimizer: Adam.Learning rate = 0.001.Loss function: MSE (Mean Squared Error).Number of epochs: 200.Batch size: 1 (only one image used).</p>
        <p>The adopted network is a lightweight convolutional autoencoder [<xref ref-type="bibr" rid="B3">3</xref>], composed of three main layers:</p>
        <p><bold>Encoding layer:</bold></p>
        <disp-formula id="FD7">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                  <mml:mo>∗</mml:mo>
                  <mml:mi>x</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Intermediate layer:</bold></p>
        <disp-formula id="FD8">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                  <mml:mo>∗</mml:mo>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Decoding layer:</bold></p>
        <disp-formula id="FD9">
          <mml:math>
            <mml:mrow>
              <mml:mover accent="true">
                <mml:mi>u</mml:mi>
                <mml:mo>^</mml:mo>
              </mml:mover>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>W</mml:mi>
                <mml:mn>3</mml:mn>
              </mml:msub>
              <mml:mo>∗</mml:mo>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>b</mml:mi>
                <mml:mn>3</mml:mn>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where (<inline-formula><mml:math><mml:mo> ∗ </mml:mo></mml:math></inline-formula> ) denotes the convolution operation, and <inline-formula><mml:math><mml:mi> σ </mml:mi></mml:math></inline-formula> is the ReLU activation function [<xref ref-type="bibr" rid="B10">10</xref>].</p>
        <p>2.2.2. Operating Principle</p>
        <p>The CNN learns a mapping function:</p>
        <disp-formula id="FD10">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>F</mml:mi>
                <mml:mi>θ</mml:mi>
              </mml:msub>
              <mml:mo>:</mml:mo>
              <mml:mi>f</mml:mi>
              <mml:mo>↦</mml:mo>
              <mml:mi>u</mml:mi>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>which directly approximates the transformation from the noisy input image <inline-formula><mml:math><mml:mi> f </mml:mi></mml:math></inline-formula> to the clean output image <inline-formula><mml:math><mml:mi> u </mml:mi></mml:math></inline-formula> .</p>
        <p>2.2.3. Loss Function</p>
        <p>The training is based on minimizing the mean squared error (MSE) [<xref ref-type="bibr" rid="B6">6</xref>]:</p>
        <disp-formula id="FD11">
          <mml:math>
            <mml:mrow>
              <mml:mi>ℒ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>θ</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>N</mml:mi>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle mathsize="140%" displaystyle="true">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>N</mml:mi>
              </mml:munderover>
              <mml:msup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>‖</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>F</mml:mi>
                        <mml:mi>θ</mml:mi>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>f</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:msub>
                        <mml:mi>u</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>‖</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>2.2.4. Interpretation</p>
        <p>The CNN acts as a universal approximator of denoising operators [<xref ref-type="bibr" rid="B7">7</xref>]:</p>
        <p>It implicitly learns filters adapted to the image structures.Unlike PDEs, it does not require explicit tuning of physical parameters.Learning is performed by backpropagation by optimizing the parameters <italic>θ</italic> via algorithms such as Adam [<xref ref-type="bibr" rid="B6">6</xref>].</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Link between PDEs and CNNs (Unified View)</title>
        <p>CNNs (see <xref ref-type="fig" rid="fig1">Figure 1</xref>) can be interpreted as a learned discretization of a diffusion process [<xref ref-type="bibr" rid="B7">7</xref>]:</p>
        <p>Each convolutional layer corresponds to a diffusion iteration.The learned filters correspond to the adaptive diffusion coefficients.The entire network is equivalent to an optimized iterative scheme.</p>
        <p>This analogy paves the way for modern Deep Unfolding methods, where PDE iterations are transformed into trainable neural network layers [<xref ref-type="bibr" rid="B7">7</xref>].</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/2313763-rId79.jpeg?20260430040412" />
        </fig>
        <p><bold>Figure 1.</bold> The convolutional neural network.</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Methodology</title>
      <p>The experimental procedure follows these steps:</p>
      <p>Data loading and preparation: A color image is loaded and resized to 256 × 256. Gaussian noise with variance <italic>σ</italic> = 0.06 is added.Variational denoising (Φ-Laplacian): The nonlinear diffusion method is applied for a fixed number of iterations (300), with the parameters: <italic>α</italic> = 0.15, <italic>p</italic> = 1.2,<italic>τ</italic> = 0.2. The parameters of the PDE (<italic>α</italic> = 0.15, <italic>p</italic> = 1.2, <italic>τ</italic> = 0.2, 300 iterations) were chosen empirically to ensure a compromise between edge preservation, numerical stability, and convergence. The CNN is trained with Adam (learning rate 1e−3) for 200 epochs, allowing for rapid convergence, although it promotes overfitting in this single-image setting.CNN training: The noisy image is provided as input, and the clean image serves as ground truth. Training takes place over 200 epochs, with a learning rate of 10<sup>−</sup><sup>3</sup>. The CNN is trained and evaluated on the same noisy-clean image pair, resulting in a severe overfitting regime. Therefore, the reported PSNR values should be interpreted as an upper-bound reconstruction performance rather than a measure of generalization ability. Performance comparison: The results of the two approaches are evaluated using the PSNR metric and visualized by PSNR and loss curves.</p>
    </sec>
    <sec id="sec4">
      <title>4. Results</title>
      <p>Experiments show that the Φ-Laplacian model achieves a final PSNR of approximately 30.5 dB, representing a significant improvement over the noisy image (≈24.5 dB). The evolution of the PSNR during iterations shows rapid convergence from the first iterations, followed by stabilization towards an optimum.</p>
      <p>The convolutional neural network, on the other hand, efficiently learns the image structure and achieves a higher PSNR (≈32 dB) after 200 training epochs. Visually, the CNN produces smoother and better reconstructed images, while preserving the main contours, whereas the Φ-Laplacian sometimes tends to slightly smooth textures.</p>
      <p>The following pictures (<xref ref-type="fig" rid="fig2">Figure 2</xref>) illustrate:</p>
      <fig id="fig2">
        <label>Figure 2</label>
        <graphic xlink:href="https://html.scirp.org/file/2313763-rId80.jpeg?20260430040412" />
      </fig>
      <p><bold>Figure 2.</bold> Results of the experiment.</p>
      <p>The visual comparison between the original, noisy, and denoised image.The convergence of the PSNR during optimization.And the decrease in CNN loss during training.</p>
    </sec>
    <sec id="sec5">
      <title>5. Conclusions and Future Work</title>
      <p>This work presents a comparative study between a variational PDE-based method (Φ-Laplacian) and a convolutional neural network (CNN) for multichannel image denoising. The two approaches are implemented and evaluated independently on the same noisy in-put.</p>
      <p>The results obtained highlight the complementarity between these two paradigms. On the one hand, the Φ-Laplacian-based model offers a rigorous mathematical framework, guaranteeing essential properties such as the stability, convergence, and interpretability of the diffusion process. It enables efficient adaptive smoothing while preserving the contours and fine structures of the images. On the other hand, the CNN demonstrates a remarkable ability to learn complex representations from the data, allowing for superior performance in terms of reconstruction quality, notably as measured by PSNR. However, each of these approaches has limitations: variational methods require precise parameter tuning and can smooth out certain textures, while deep learning models sometimes lack interpretability and theoretical guarantees.</p>
      <p>In this context, a natural and promising perspective is to integrate these two approaches within a single, unified framework. This can be achieved by using the Φ-Laplacian as a preprocessing step, or, even more advanced, as a regularization term integrated into the CNN’s loss function, in order to guide learning towards physically consistent and more stable solutions. Furthermore, future extensions could include:</p>
      <p>the development of Deep Unfolding models, where the PDE iterations are reformulated as trainable neural network layers.adapting the model to multispectral and hyperspectral data, where inter-channel correlations are more complex.The integration of advanced perceptual metrics (such as SSIM) for a more accurate assessment of visual quality.And the optimization of architectures for real-time applications and embedded systems.</p>
      <p>In conclusion, this work confirms that the hybridization of variational analysis and deep learning constitutes a particularly promising research avenue for image restoration. It makes it possible to reconcile theoretical rigor, numerical performance, and interpretability, thus paving the way for more robust systems better suited to real-world applications.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Gonzalez, R.C. and Woods, R.E. (2018) Digital Image Processing. 4th Edition, Pearson, 210-280.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Gonzalez, R.C.</string-name>
              <string-name>Woods, R.E.</string-name>
              <string-name>Edition, P</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Digital Image Processing</article-title>
            <source>4th Edition</source>
            <volume>210</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Rudin, L.I., Osher, S. and Fatemi, E. (1992) Nonlinear Total Variation Based Noise Removal Algorithms. <italic>Physica</italic><italic>D</italic>: <italic>Nonlinear</italic><italic>Phenomena</italic>, 60, 259-268. https://doi.org/10.1016/0167-2789(92)90242-f <pub-id pub-id-type="doi">10.1016/0167-2789(92)90242-f</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0167-2789(92)90242-f">https://doi.org/10.1016/0167-2789(92)90242-f</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Rudin, L.I.</string-name>
              <string-name>Osher, S.</string-name>
              <string-name>Fatemi, E.</string-name>
            </person-group>
            <year>1992</year>
            <article-title>Nonlinear Total Variation Based Noise Removal Algorithms</article-title>
            <source>Physica D: Nonlinear Phenomena</source>
            <volume>2789</volume>
            <issue>92</issue>
            <pub-id pub-id-type="doi">10.1016/0167-2789(92)90242-f</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, K., Zuo, W., Chen, Y., Meng, D. and Zhang, L. (2017) Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoising. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Image</italic><italic>Processing</italic>, 26, 3142-3155. https://doi.org/10.1109/tip.2017.2662206 <pub-id pub-id-type="doi">10.1109/tip.2017.2662206</pub-id><pub-id pub-id-type="pmid">28166495</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tip.2017.2662206">https://doi.org/10.1109/tip.2017.2662206</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, K.</string-name>
              <string-name>Zuo, W.</string-name>
              <string-name>Chen, Y.</string-name>
              <string-name>Meng, D.</string-name>
              <string-name>Zhang, L.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoising</article-title>
            <source>IEEE Transactions on Image Processing</source>
            <volume>26</volume>
            <pub-id pub-id-type="doi">10.1109/tip.2017.2662206</pub-id>
            <pub-id pub-id-type="pmid">28166495</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Perona, P. and Malik, J. (1990) Scale-Space and Edge Detection Using Anisotropic Diffusion. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Pattern</italic><italic>Analysis</italic><italic>and</italic><italic>Machine</italic><italic>Intelligence</italic>, 12, 629-639. https://doi.org/10.1109/34.56205 <pub-id pub-id-type="doi">10.1109/34.56205</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/34.56205">https://doi.org/10.1109/34.56205</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Perona, P.</string-name>
              <string-name>Malik, J.</string-name>
            </person-group>
            <year>1990</year>
            <article-title>Scale-Space and Edge Detection Using Anisotropic Diffusion</article-title>
            <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
            <volume>12</volume>
            <pub-id pub-id-type="doi">10.1109/34.56205</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Ronneberger, O., Fischer, P. and Brox, T. (2015) U-Net: Convolutional Networks for Biomedical Image Segmentation. In: Navab, N., Hornegger, J., Wells, W. and Frangi, A., Eds., <italic>Medical Image Computing and Computer-Assisted Intervention</italic>— <italic>MICCAI</italic> 2015, Springer, 234-241. https://doi.org/10.1007/978-3-319-24574-4_28 <pub-id pub-id-type="doi">10.1007/978-3-319-24574-4_28</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-24574-4_28">https://doi.org/10.1007/978-3-319-24574-4_28</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Ronneberger, O.</string-name>
              <string-name>Fischer, P.</string-name>
              <string-name>Brox, T.</string-name>
              <string-name>Navab, N.</string-name>
              <string-name>Hornegger, J.</string-name>
              <string-name>Wells, W.</string-name>
              <string-name>Frangi, A.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>U-Net: Convolutional Networks for Biomedical Image Segmentation</article-title>
            <source>In: Navab</source>
            <volume>234</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-319-24574-4_28</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Bovik, A. (2005) Handbook of Image and Video Processing. Academic Press, 45-78.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Bovik, A.</string-name>
            </person-group>
            <year>2005</year>
            <article-title>Handbook of Image and Video Processing</article-title>
            <source>Academic Press</source>
            <volume>45</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Arridge, S., Maass, P., Öktem, O. and Schönlieb, C. (2019) Solving Inverse Problems Using Data-Driven Models. <italic>Acta</italic><italic>Numerica</italic>, 28, 1-174. https://doi.org/10.1017/s0962492919000059 <pub-id pub-id-type="doi">10.1017/s0962492919000059</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1017/s0962492919000059">https://doi.org/10.1017/s0962492919000059</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Arridge, S.</string-name>
              <string-name>Maass, P.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Solving Inverse Problems Using Data-Driven Models</article-title>
            <source>Acta Numerica</source>
            <volume>28</volume>
            <pub-id pub-id-type="doi">10.1017/s0962492919000059</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Weickert, J. (1998) Anisotropic Diffusion in Image Processing. B.G. Teubner, 45-89.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Weickert, J.</string-name>
            </person-group>
            <year>1998</year>
            <article-title>Anisotropic Diffusion in Image Processing</article-title>
            <source>B.G. Teubner</source>
            <volume>45</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Chambolle, A. and Pock, T. (2011) A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging. <italic>Journal</italic><italic>of</italic><italic>Mathematical</italic><italic>Imaging</italic><italic>and</italic><italic>Vision</italic>, 40, 120-145. https://doi.org/10.1007/s10851-010-0251-1 <pub-id pub-id-type="doi">10.1007/s10851-010-0251-1</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10851-010-0251-1">https://doi.org/10.1007/s10851-010-0251-1</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Chambolle, A.</string-name>
              <string-name>Pock, T.</string-name>
            </person-group>
            <year>2011</year>
            <article-title>A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging</article-title>
            <source>Journal of Mathematical Imaging and Vision</source>
            <volume>40</volume>
            <pub-id pub-id-type="doi">10.1007/s10851-010-0251-1</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Goodfellow, I., Bengio, Y. and Courville, A. (2016) Deep Learning. MIT Press, 326-390.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Goodfellow, I.</string-name>
              <string-name>Bengio, Y.</string-name>
              <string-name>Courville, A.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Deep Learning</article-title>
            <source>MIT Press</source>
            <volume>326</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>