Browsing Fakultät für Mathematik und Informatik (inkl. GAUSS) by Referee "PlonkaHoch, Gerlind Prof. Dr."
Now showing items 120 of 24

A Wassersteinlike Distance on Vector Fields
(20231006)We introduce a new distance on the space of vector fields over a Riemannian manifold that is motivated by the construction and properties of the Wasserstein distance. The construction relies on a particular metric on the ... 
On minimax detection of localized signals from indirect or correlated data
(20220505)This is a cumulative thesis consisting of two papers, in which we treat two problems related to the detectability of local anomalies within certain types of data. In the first paper, we suppose that a segment of a Gaussian ... 
Optimal Hankel Structured Rank1 Approximation
(20220310)Hankel matrices are closely related to linear timeinvariant (LTI) models, which are widely used in areas like system theory, signal processing, computer algebra, or machine learning. The complexity of such a model is ... 
Modifications of Prony's Method for the Reconstruction of Structured Functions
(20211220)The reconstruction and analysis of sparse signals is a common and widely studied problem in signal processing, for example in wireless telecommunication or power system theory. Hereby, most recovery methods exploit structures ... 
Adaptive Sparsification Mechanisms in Signal Recovery
(20210406)This thesis considers two different adaptive recovery concepts. The first concept is concerned with proximity operators intertwined between an injective linear operator with bounded range and its pseudoinverse. A prominent ... 
Convergence rates for variational regularization of statistical inverse problems
(20200513)We consider inverse problems with statistical (noisy) data. By applying regularization methods one can approximate the true solution of the inverse problem by a regularized solution. In this thesis we show convergence rates ... 
CartoonResidual Image Decompositions with Application in Fingerprint Recognition
(20191211)Image decompositions into a piecewise smooth part  called a cartoon  and a residual part containing oscillating patterns and/or noise, proved to be very useful in automated image processing, for example in applications ... 
Sparse Fast Trigonometric Transforms
(20190722)Trigonometric transforms like the Fourier transform or the discrete cosine transform (DCT) are of immense importance in signal and image processing, physics, engineering, and data processing. The research of past decades ... 
Inverse Problems in Propagationbased Xray Phase Contrast Imaging and Tomography: Stability Analysis and Reconstruction Methods
(20190612)Propagationbased Xray phase contrast imaging (XPCI) and tomography (XPCT) extend the capabilities of classical Xray radiography and computed tomography (CT) to imaging of microscopic specimens with nanometersized ... 
The Generalized Operator Based Prony Method
(20190510)The well known Prony method was introduced to reconstruct finite linear combinations of complex exponentials. A first approach towards generalizing this method to more arbitrary expansions was made by Peter & Plonka in ... 
Compressed Sensing and ΣΔQuantization
(20190211)The main issue of my thesis is to bound the error while recovering signals from their compressed and quantized form. Especially my central contribution is that, together with my coauthors, we provide the first analysis ... 
Adaptive Multiscale Methods for Sparse Image Representation and Dictionary Learning
(20190116)In this thesis we are interested in the topic of sparse digital image representation through adaptive multiscale basis. We develop for this two numerical methods: the Region Based Easy Path Wavelet Transform and the Haardict. ... 
Application of AAK theory for sparse approximation
(20171027)Sparse approximation of structured signals is a common problem in signal processing and system theory. In particular, approximation by exponential sums often arises in natural sciences for the analysis of decay processes. ... 
On two Random Models in Data Analysis
(20170302)In this thesis, we study two random models with various applications in data analysis. For our first model, we investigate subspaces spanned by biased random vectors. The underlying random model is motivated by applications ... 
Deterministic Sparse FFT Algorithms
(20160930)The discrete Fourier transform (DFT) is a wellknown transform with many applications in various fields. By fast Fourier transform (FFT) algorithms, the DFT of a vector can be efficiently computed. Using these algorithms, ... 
Empirical Bayesian Smoothing Splines for Signals with Correlated Errors: Methods and Applications
(20160812)Smoothing splines is a well stablished method in nonparametric statistics, although the selection of the smoothness degree of the regression function is rarely addressed and, instead, a two times differentiable function, ... 
Phase Retrieval with Sparsity Constraints
(20160629)The twodimensional phase retrieval problem arises in many areas of experimental physics, e.g. in xray microscopy. The central theme of this thesis is the application of sparsity constraints in the twodimensional ... 
Ambiguities in onedimensional phase retrieval from Fourier magnitudes
(20160113)In many scientific areas, such as astronomy, electron microscopy, and crystallography, one is faced with the problem to recover an unknown signal from the magnitudes of its Fourier transform. Unfortunately, this phase ... 
Application of Persistent Homology in Signal and Image Denoising
(20150729)Motivated by recent developments in topological persistence for assessment of the importance of features in data sets, we study the ideas of persistence homology for onedimensional digital signals and its application in ... 
Reconstruction of Structured Functions From Sparse Fourier Data
(20150119)In several scientific areas, such as radio astronomy, computed tomography, and magnetic resonance imaging, the reconstruction of structured functions from the knowledge of samples of their Fourier transform is a common ...