Optimising Spatial and Tonal Data for PDE-based Inpainting

Some recent methods for lossy signal and image compression store only a few selected pixels and fill in the missing structures by inpainting with a partial differential equation (PDE). Suitable operators include the Laplacian, the biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The quality of such approaches depends substantially on the selection of the data that is kept. Optimising this data in the domain and codomain gives rise to challenging mathematical problems that shall be addressed in our work. In the 1D case, we prove results that provide insights into the difficulty of this problem, and we give evidence that a splitting into spatial and tonal (i.e. function value) optimisation does hardly deteriorate the results. In the 2D setting, we present generic algorithms that achieve a high reconstruction quality even if the specified data is very sparse. To optimise the spatial data, we use a probabilistic sparsification, followed by a nonlocal pixel exchange that avoids getting trapped in bad local optima. After this spatial optimisation we perform a tonal optimisation that modifies the function values in order to reduce the global reconstruction error. For homogeneous diffusion inpainting, this comes down to a least squares problem for which we prove that it has a unique solution. We demonstrate that it can be found efficiently with a gradient descent approach that is accelerated with fast explicit diffusion (FED) cycles. Our framework allows to specify the desired density of the inpainting mask a priori. Moreover, is more generic than other data optimisation approaches for the sparse inpainting problem, since it can also be extended to nonlinear inpainting operators such as EED. This is exploited to achieve reconstructions with state-of-the-art quality. We also give an extensive literature survey on PDE-based image compression methods

Nonlocal smoothing and adaptive morphology for scalar- and matrix-valued images

In this work we deal with two classic degradation processes in image analysis, namely noise contamination and incomplete data. Standard greyscale and colour photographs as well as matrix-valued images, e.g. diffusion-tensor magnetic resonance imaging, may be corrupted by Gaussian or impulse noise, and may suffer from missing data. In this thesis we develop novel reconstruction approaches to image smoothing and image completion that are applicable to both scalar- and matrix-valued images. For the image smoothing problem, we propose discrete variational methods consisting of nonlocal data and smoothness constraints that penalise general dissimilarity measures. We obtain edge-preserving filters by the joint use of such measures rich in texture content together with robust non-convex penalisers. For the image completion problem, we introduce adaptive, anisotropic morphological partial differential equations modelling the dilation and erosion processes. They adjust themselves to the local geometry to adaptively fill in missing data, complete broken directional structures and even enhance flow-like patterns in an anisotropic manner. The excellent reconstruction capabilities of the proposed techniques are tested on various synthetic and real-world data sets.In dieser Arbeit beschäftigen wir uns mit zwei klassischen Störungsquellen in der Bildanalyse, nämlich mit Rauschen und unvollständigen Daten. Klassische Grauwert- und Farb-Fotografien wie auch matrixwertige Bilder, zum Beispiel Diffusionstensor-Magnetresonanz-Aufnahmen, können durch Gauß- oder Impulsrauschen gestört werden, oder können durch fehlende Daten gestört sein. In dieser Arbeit entwickeln wir neue Rekonstruktionsverfahren zum zur Bildglättung und zur Bildvervollständigung, die sowohl auf skalar- als auch auf matrixwertige Bilddaten anwendbar sind. Zur Lösung des Bildglättungsproblems schlagen wir diskrete Variationsverfahren vor, die aus nichtlokalen Daten- und Glattheitstermen bestehen und allgemeine auf Bildausschnitten definierte Unähnlichkeitsmaße bestrafen. Kantenerhaltende Filter werden durch die gemeinsame Verwendung solcher Maße in stark texturierten Regionen zusammen mit robusten nichtkonvexen Straffunktionen möglich. Für das Problem der Datenvervollständigung führen wir adaptive anisotrope morphologische partielle Differentialgleichungen ein, die Dilatations- und Erosionsprozesse modellieren. Diese passen sich der lokalen Geometrie an, um adaptiv fehlende Daten aufzufüllen, unterbrochene gerichtet Strukturen zu schließen und sogar flussartige Strukturen anisotrop zu verstärken. Die ausgezeichneten Rekonstruktionseigenschaften der vorgestellten Techniken werden anhand verschiedener synthetischer und realer Datensätze demonstriert

Effective SAR image despeckling based on bandlet and SRAD

Despeckling of a SAR image without losing features of the image is a daring task as it is intrinsically affected by multiplicative noise called speckle. This thesis proposes a novel technique to efficiently despeckle SAR images. Using an SRAD filter, a Bandlet transform based filter and a Guided filter, the speckle noise in SAR images is removed without losing the features in it. Here a SAR image input is given parallel to both SRAD and Bandlet transform based filters. The SRAD filter despeckles the SAR image and the despeckled output image is used as a reference image for the guided filter. In the Bandlet transform based despeckling scheme, the input SAR image is first decomposed using the bandlet transform. Then the coefficients obtained are thresholded using a soft thresholding rule. All coefficients other than the low-frequency ones are so adjusted. The generalized cross-validation (GCV) technique is employed here to find the most favorable threshold for each subband. The bandlet transform is able to extract edges and fine features in the image because it finds the direction where the function gives maximum value and in the same direction it builds extended orthogonal vectors. Simple soft thresholding using an optimum threshold despeckles the input SAR image. The guided filter with the help of a reference image removes the remaining speckle from the bandlet transform output. In terms of numerical and visual quality, the proposed filtering scheme surpasses the available despeckling schemes

Mapping the 3-D Dark Matter potential with weak shear

We investigate the practical implementation of Taylor's (2002) 3-dimensional gravitational potential reconstruction method using weak gravitational lensing, together with the requisite reconstruction of the lensing potential. This methodology calculates the 3-D gravitational potential given a knowledge of shear estimates and redshifts for a set of galaxies. We analytically estimate the noise expected in the reconstructed gravitational field, taking into account the uncertainties associated with a finite survey, photometric redshift uncertainty, redshift-space distortions, and multiple scattering events. In order to implement this approach for future data analysis, we simulate the lensing distortion fields due to various mass distributions. We create catalogues of galaxies sampling this distortion in three dimensions, with realistic spatial distribution and intrinsic ellipticity for both ground-based and space-based surveys. Using the resulting catalogues of galaxy position and shear, we demonstrate that it is possible to reconstruct the lensing and gravitational potentials with our method. For example, we demonstrate that a typical ground-based shear survey with redshift limit z=1 and photometric redshifts with error Delta z=0.05 is directly able to measure the 3-D gravitational potential for mass concentrations >10^14 M_\odot between 0.1<z<0.5, and can statistically measure the potential at much lower mass limits. The intrinsic ellipticity of objects is found to be a serious source of noise for the gravitational potential, which can be overcome by Wiener filtering or examining the potential statistically over many fields. We examine the use of the 3-D lensing potential to measure mass and position of clusters in 3-D, and to detect clusters behind clusters.Comment: 21 pages, including 24 figures, submitted to MNRA

Learning filter functions in regularisers by minimising quotients

Learning approaches have recently become very popular in the field of inverse problems. A large variety of methods has been established in recent years, ranging from bi-level learning to high-dimensional machine learning techniques. Most learning approaches, however, only aim at fitting parametrised models to favourable training data whilst ignoring misfit training data completely. In this paper, we follow up on the idea of learning parametrised regularisation functions by quotient minimisation as established in [3]. We extend the model therein to include higher-dimensional filter functions to be learned and allow for fit- and misfit-training data consisting of multiple functions. We first present results resembling behaviour of well-established derivative-based sparse regularisers like total variation or higher-order total variation in one-dimension. Our second and main contribution is the introduction of novel families of non-derivative-based regularisers. This is accomplished by learning favourable scales and geometric properties while at the same time avoiding unfavourable ones

Nonlocal evolutions in image processing

The main topic of this thesis is to study a general framework which encompasses a wide class of nonlocal filters. For that matter, we introduce a general initial value problem, defined in terms of integro-differential equations and following the work of Weickert, we impose a set of basic assumptions that turn it into a well-posed model and develop nonlocal scale-space theory. Moreover, we go one step further and consider the consequences of relaxing some of this initial set of requirements. With each particular modification of the initial requirements, we obtain a particular framework which encompasses a more specific, yet wide, family of nonlocal processes.Das Hauptthema dieser Arbeit ist die Untersuchung eines allgemeinen Rahmens für eine breite Klasse nichtlokaler Filter. Zuerst führen wir ein Modell ein, das auf Integro-Differentialgleichungen basiert. Wir ergänzen es mit einer Reihe von Grundannahmen, die es uns ermöglichen, eine nichtlokale Skalenraumtheorie zu entwickeln, wie in [1]. Außerdem betrachten wir die Konsequenzen der Abschwächung einiger dieser Annahmen. Wir stellen verschiedene Beispiele für die mit jeder Relaxation erhaltenen Prozesse vor