Filtyp
The central problem of this thesis is estimating receiver-sender node positions from measured receiver-sender distances or equivalent measurements. This problem arises in many applications such as microphone array calibration, radio antenna array calibration, mapping and positioning using ultra-wideband and mapping and positioning using round-trip-time measurements between mobile phones and Wi-Fi-
Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly parametrized using a bilinear factorization, or low rank can be implicitly enforced using regularization terms penalizing non-zero singular values. While the for
Global fire-vegetation models are widely used to assess impacts of environmental change on fire regimes and the carbon cycle and to infer relationships between climate, land use and fire. However, differences in model structure and parameterizations, in both the vegetation and fire components of these models, could influence overall model performance, and to date there has been limited evaluation
Image quality measures are becoming increasingly important in the field of computer graphics. For example, there is currently a major focus on generating photorealistic images in real time by combining path tracing with denoising, for which such quality assessment is integral. We present FLIP, which is a difference evaluator with a particular focus on the differences between rendered images and co
Concerns about food security under climate change motivate efforts to better understand future changes in crop yields. Process-based crop models, which represent plant physiological and soil processes, are necessary tools for this purpose since they allow representing future climate and management conditions not sampled in the historical record and new locations to which cultivation may shift. How
Low rank structures are present in many applications of computer vision and machine learning. A popular approach consists of explicitly parameterising the set or matrices with sought rank, leading to a bilinear factorisation, reducing the problem to find the bilinear factors. While such an approach can be efficiently implemented using second-order methods, such as Levenberg-Marquardt (LM) or Varia
Estimating receiver and sender positions is often solved using a stratified, two-tiered approach. In the first step the problem is converted to a low-rank matrix estimation problem. The second step can be seen as an affine upgrade. This affine upgrade is the focus of this paper. In the paper new efficient algorithms for solving for the upgrade parameters using minimal data are presented. It is als
Inference of CO2 surface fluxes using atmospheric CO2 observations in atmospheric inversions depends critically on accurate representation of atmospheric transport. Here we characterize regional-scale CO2 transport uncertainties due to uncertainties in meteorological fields using a mesoscale atmospheric model and an ensemble of simulations with flow-dependent transport errors. During a 1-month sum
The fact that deep learning based algorithms used for digital pathology tend to overfit to the site of the training data is well-known. Since an algorithm that does not generalize is not very useful, we have in this work studied how different data augmentation techniques can reduce this problem but also how data from different sites can be normalized to each other. For both of these approaches we
The problem of monotone smoothing splines with bounds is formulated as a constrained minimization problem of the calculus of variations. Existence and uniqueness of solutions of this problem is proved, as well as the equivalence of it to a finite dimensional but nonlinear optimization problem. A new algorithm for computing the solution which is a spline curve, using a branch and bound technique, i
Learning a computationally efficient kernel from data is an important machine learning problem. The majority of kernels in the literature do not leverage the geometry of the data, and those that do are computationally infeasible for contemporary datasets. Recent advances in approximation techniques have expanded the applicability of the kernel methodology to scale linearly with the data size. Data
The problem of estimating receiver or sender node positions from measured receiver-sender distances is a key issue in different applications such as microphone array calibration, radio antenna array calibration, mapping and positioning using UWB or using round-trip-time measurements between mobile phones and WiFi-units. In this paper we address the problem of optimally estimating a receiver positi
In this paper we study the problem of estimating receiver and sender positions from time-difference-of-arrival measurements, assuming an unknown constant time-difference-of-arrival offset. This problem is relevant for example for repetitive sound events. In this paper it is shown that there are three minimal cases to the problem. One of these (the five receiver, five sender problem) is of particul
We derive an expression for the error introduced by the second-order accurate temporal finitedifference (FD) operator, as present in the FD, pseudospectral and spectral element methods for seismic wave modeling applied to time-invariant media. The 'time-dispersion' error speeds up the signal as a function of frequency and time step only. Time dispersion is thus independent of the propagation path,
This thesis explores methods for estimating 3D models using depth sensors andfinding low-rank approximations of matrices. In the first part we focus on how toestimate the movement of a depth camera and creating a 3D model of the scene.Given an accurate estimation of the camera position, we can produce dense 3Dmodels using the images obtained from the camera. We present algorithms thatare both accu
Signal apparition is a method for encoding sources in simultaneous multisource seismic acquisition and decoding the multisource response of the earth into its single-source responses. For M sources, encoding is performed by applying periodic sequences of period M to each of the sources along source lines. Decoding is achieved in the wavenumber domain for each frequency by solving an M × M linear s
This paper studies the problem of determining the absolute pose of a perspective camera observing a scene through a known refractive plane, the flat boundary between transparent media with different refractive indices. Efficient minimal solvers are developed for the 2D, known orientation and known rotation axis cases, and near-minimal solvers for the general calibrated and unknown focal length cas
