<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-22T00:02:03Z</responseDate><request verb="GetRecord" identifier="oai:www.repository.cam.ac.uk:1810/304305" metadataPrefix="uketd_dc">https://api.repository.cam.ac.uk/server/oai/request</request><GetRecord><record><header><identifier>oai:www.repository.cam.ac.uk:1810/304305</identifier><datestamp>2025-12-19T21:47:42Z</datestamp><setSpec>com_1810_205871</setSpec><setSpec>com_1810_256064</setSpec><setSpec>col_1810_206446</setSpec></header><metadata><uketd_dc:uketddc xmlns:uketd_dc="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:uketdterms="http://naca.central.cranfield.ac.uk/ethos-oai/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/ http://naca.central.cranfield.ac.uk/ethos-oai/2.0/uketd_dc.xsd">
   <dc:title>A Multiplicative Regularisation for Inverse Problems</dc:title>
   <dc:identifier xsi:type="dcterms:DOI">10.17863/CAM.51386</dc:identifier>
   <dc:creator>Qiao, Yujun</dc:creator>
   <uketdterms:advisor>Rath-Spivack, Orsola</uketdterms:advisor>
   <dcterms:abstract>This thesis considers self-adaptive regularisation methods, focusing particularly on new,
multiplicative methods, in which the cost functional is constructed as a product of two terms,
rather than the more usual sum of a fidelity term and a regularisation term.

By re-formulating the multiplicative regularisation model in the framework of the alternating
minimisation algorithm, we were able to obtain a series of rigorous theoretical results,
as well as formulating a number of new models in both multiplicative and additive form.

The first two chapters of my thesis set the scene of my research. Chapter 1 gives a
general review of the field of inverse problems and common regularisation strategies, while
Chapter 2 provides relevant technical details as mathematical preliminaries. The multiplicative
regularisation model by Abubakar et al (2004) falls into the category of self-adaptive
methods, where the regularisation strength is automatically adjusted in the model. By investigating
the model and implementing it on various examples, I demonstrated its power
for deblurring piecewise constant images with the presence of noise with high amplitude
and various distributions (Chapter 3). I also discovered a possible improvement of this
model by the introduction an extra parameter μ, and came up with a formula to determine its
most appropriate value in a straightforward manner. The derivation and numerical validation
or this formula is presented in Chapter 4. This parameter μ supplements Abubakar’s
multiplicative method, and plays an important role in the model: it enables the multiplicative
model to reach its full potential, without adding any significant effort in parameter tuning.

Despite its numerical strength, there are barely any theoretical results regarding the
multiplicative type of regularisation, which motivates me to carry out further research in
this aspect. Inspired by Charbonnier et al (1997) who provided an additive model with
regularisation strength spatially controlled by a sequence of self-adapted weight functions
bn, I re-formulated the multiplicative regularisation model in the framework of alternating
minimisation algorithm. This results in a series of new models of the multiplicative type.
In Chapter 5 I presented two new models MMR and MSSP equipped with two-step and
three-step alternating minimization algorithm respectively. The scaling parameter δ is fixed
in the former model while it is self-adaptive based on an additional recurrence relation in the
latter model. In both models, the objective cost functional Cn is monotonically decreasing
and convergent, while the image intensity un exhibits semi-convergence nature. Both models
are capable of incorporating different potential functions in the objective cost functional,
and require no extra tuning parameter μ in the algorithm. Numerically they exhibit similar
behaviours as Abubakar’s multiplicative method in terms of high noise level tolerance and
robustness over different noise distributions.

In Chapter 6 I presented a third, enhanced multiplicative model (EMM), which employs
not only a three-step minimisation with self-adaptive weight function bn and scaling parameter
δn, but also the same augmented recurrence relation as discussed in Chapter 4 with
steering parameter μ. This model leads to promising results both theoretically and numerically.
It is a novel approach with enhanced performance exceeding all the multiplicative type
of models presented in this dissertation.</dcterms:abstract>
   <uketdterms:institution>University of Cambridge</uketdterms:institution>
   <dcterms:issued>2020-08-03</dcterms:issued>
   <dc:type>Thesis</dc:type>
   <uketdterms:qualificationlevel>Doctoral</uketdterms:qualificationlevel>
   <uketdterms:qualificationname>Doctor of Philosophy (PhD)</uketdterms:qualificationname>
   <dc:language>en</dc:language>
   <uketdterms:sponsor>Cambridge Trust Scholarship awarded by Cambridge Commonwealth, European and International Trust, 2014
Trinity Hall Research Studentship awarded by Trinity Hall College, 2014</uketdterms:sponsor>
   <dcterms:isReferencedBy xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/handle/1810/304305</dcterms:isReferencedBy>
   <dc:identifier xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/bitstreams/a4e0f720-7290-4dd8-b0bf-1c192529f8af/download</dc:identifier>
   <uketdterms:checksum xsi:type="uketdterms:MD5">4f502a495211f9045dd0a82514711a78</uketdterms:checksum>
   <dcterms:license>https://www.repository.cam.ac.uk/bitstreams/4cb1b433-ab99-4dc2-9a87-85f64cf63874/download</dcterms:license>
   <uketdterms:checksum xsi:type="uketdterms:MD5">87eda9de84448d1f82354d60eee3eb5f</uketdterms:checksum>
   <dc:rights>https://www.rioxx.net/licenses/all-rights-reserved/</dc:rights>
   <dc:subject>Self-adaptive regularisation</dc:subject>
   <dc:subject>multiplicative regularisation</dc:subject>
   <dc:subject>deblurring</dc:subject>
   <dc:subject>denoising</dc:subject>
   <dc:subject>regularisation with spatial dependence</dc:subject>
   <dc:subject>piecewise constant image</dc:subject>
   <dc:subject>non-convex objective functional</dc:subject>
   <dc:subject>conjugate gradient method</dc:subject>
   <dc:subject>alternating minimisation algorithm</dc:subject>
   <dc:subject>optimisation</dc:subject>
   <dc:subject>gradient descent.</dc:subject>
</uketd_dc:uketddc>
</metadata></record></GetRecord></OAI-PMH>