Sensing physical fields: Inverse problems for the diffusion equation and beyond

Due to significant advances made over the last few decades in the areas of (wireless) networking, communications and microprocessor fabrication, the use of sensor networks to observe physical phenomena is rapidly becoming commonplace. Over this period, many aspects of sensor networks have been explored, yet a thorough understanding of how to analyse and process the vast amounts of sensor data collected remains an open area of research. This work, therefore, aims to provide theoretical, as well as practical, advances this area. In particular, we consider the problem of inferring certain underlying properties of the monitored phenomena, from our sensor measurements. Within mathematics, this is commonly formulated as an inverse problem; whereas in signal processing, it appears as a (multidimensional) sampling and reconstruction problem. Indeed it is well known that inverse problems are notoriously ill-posed and very demanding to solve; meanwhile ...

Murray-Bruce, John — Imperial College London


Transmission Line Matrix (TLM) Modelling of Medical Ultrasound

This thesis introduces TLM as a new method for modelling medical ultrasound wave propagation. Basic TLM theory is presented and how TLM is related to Huygens principle is discussed. Two dimensional TLM modelling is explained in detail and one dimensional and three dimensional TLM modelling are explained. Implementing TLM in single CPU computers and parallel computers is discussed and several algorithms are presented together with their advantages and disadvantages. Inverse TLM and modelling non linear wave propagation and different types of mesh are discussed. A new idea for modelling TLM as a digital filter is presented and removing the boundary effect based on digital filter modelling of TLM is discussed. Some modelling experiments such as : Focusing mirror. Circular mirror. Array transducers. Doppler effect. are presented and how to use TLM to model these experiments is explained. A new low ...

Ahmadian, Mansour — University Of Edinburgh


Implementation of the radiation characteristics of musical instruments in wave field synthesis applications

In this thesis a method to implement the radiation characteristics of musical instruments in wave field synthesis systems is developed. It is applied and tested in two loudspeaker systems. Because the loudspeaker systems have a comparably low number of loudspeakers the wave field is synthesized at discrete listening positions by solving a linear equation system. Thus, for every constellation of listening and source position all loudspeakers can be used for the synthesis. The calculations are done in spectral domain, denying sound propagation velocity at first. This approach causes artefacts in the loudspeaker signals and synthesis errors in the listening area which are compensated by means of psychoacoustic methods. With these methods the aliasing frequency is determined by the extent of the listening area whereas in other wave field synthesis systems it is determined by the distance of adjacent loudspeakers. Musical ...

Ziemer, Tim — University of Hamburg


Weighted low rank approximation : Algorithms and applications

In order to find more sophisticated trends in data, potential correlations between larger and larger groups of variables must be considered. Unfortunately, the number of such correlations generally increases exponentially with the number of input variables and, as a result, brute force approaches become unfeasible. So, the data needs to be simplified sufficiently. Yet, the data may not be oversimplified. A method that is widely used for this purpose is to first cast the data as a matrix and the compute a low rank matrix approximation. The tight equivalences between the Weighted Low Rank Approximation (WLRA) problem and the Total Least Squares (TLS) problem are explored. Despite the seemingly different problem formulations of WLRA and TLS, it is shown that both methods can be reduced to the same mathematical kernel problem, i.e. finding the closest (in a certain sense) weighted ...

Schuermans, Mieke — Katholieke Universiteit Leuven


Efficient representation, generation and compression of digital holograms

Digital holography is a discipline of science that measures or reconstructs the wavefield of light by means of interference. The wavefield encodes three-dimensional information, which has many applications, such as interferometry, microscopy, non-destructive testing and data storage. Moreover, digital holography is emerging as a display technology. Holograms can recreate the wavefield of a 3D object, thereby reproducing all depth cues for all viewpoints, unlike current stereoscopic 3D displays. At high quality, the appearance of an object on a holographic display system becomes indistinguishable from a real one. High-quality holograms need large volumes of data to be represented, approaching resolutions of billions of pixels. For holographic videos, the data rates needed for transmitting and encoding of the raw holograms quickly become unfeasible with currently available hardware. Efficient generation and coding of holograms will be of utmost importance for future holographic displays. ...

Blinder, David — Vrije Universiteit Brussel


Development of Fast Machine Learning Algorithms for False Discovery Rate Control in Large-Scale High-Dimensional Data

This dissertation develops false discovery rate (FDR) controlling machine learning algorithms for large-scale high-dimensional data. Ensuring the reproducibility of discoveries based on high-dimensional data is pivotal in numerous applications. The developed algorithms perform fast variable selection tasks in large-scale high-dimensional settings where the number of variables may be much larger than the number of samples. This includes large-scale data with up to millions of variables such as genome-wide association studies (GWAS). Theoretical finite sample FDR-control guarantees based on martingale theory have been established proving the trustworthiness of the developed methods. The practical open-source R software packages TRexSelector and tlars, which implement the proposed algorithms, have been published on the Comprehensive R Archive Network (CRAN). Extensive numerical experiments and real-world problems in biomedical and financial engineering demonstrate the performance in challenging use-cases. The first three main parts of this dissertation present ...

Machkour, Jasin — Technische Universität Darmstadt


Advanced Signal Processing Concepts for Multi-Dimensional Communication Systems

The widespread use of mobile internet and smart applications has led to an explosive growth in mobile data traffic. With the rise of smart homes, smart buildings, and smart cities, this demand is ever growing since future communication systems will require the integration of multiple networks serving diverse sectors, domains and applications, such as multimedia, virtual or augmented reality, machine-to-machine (M2M) communication / the Internet of things (IoT), automotive applications, and many more. Therefore, in the future, the communication systems will not only be required to provide Gbps wireless connectivity but also fulfill other requirements such as low latency and massive machine type connectivity while ensuring the quality of service. Without significant technological advances to increase the system capacity, the existing telecommunications infrastructure will be unable to support these multi-dimensional requirements. This poses an important demand for suitable waveforms with ...

Cheema, Sher Ali — Technische Universität Ilmenau


SPACE-TIME PARAMETRIC APPROACH TO EXTENDED AUDIO REALITY (SP-EAR)

The term extended reality refers to all possible interactions between real and virtual (computed generated) elements and environments. The extended reality field is rapidly growing, primarily through augmented and virtual reality applications. The former allows users to bring digital elements into the real world, while the latter lets us experience and interact with an entirely virtual environment. While currently extended reality implementations primarily focus on the visual domain, we cannot underestimate the impact of auditory perception in order to provide a fully immersive experience. As a matter of fact, effective handling of the acoustic content is able to enrich the engagement of users. We refer to Extended Audio Reality (EAR) as the subset of extended reality operations related to the audio domain. In this thesis, we propose a parametric approach to EAR conceived in order to provide an effective and ...

Pezzoli Mirco — Politecnico di Milano


A Unified Framework for Communications through MIMO Channels

MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) CHANNELS constitute a unified way of modeling a wide range of different physical communication channels, which can then be handled with a compact and elegant vector-matrix notation. The two paradigmatic examples are wireless multi-antenna channels and wireline Digital Subscriber Line (DSL) channels. Research in antenna arrays (also known as smart antennas) dates back to the 1960s. However, the use of multiples antennas at both the transmitter and the receiver, which can be naturally modeled as a MIMO channel, has been recently shown to offer a significant potential increase in capacity. DSL has gained popularity as a broadband access technology capable of reliably delivering high data rates over telephone subscriber lines. A DSL system can be modeled as a communication through a MIMO channel by considering all the copper twisted pairs within a binder as a whole rather ...

Palomar, Daniel Perez — Technical University of Catalonia (UPC)


MIMO instantaneous blind idenfitication and separation based on arbitrary order

This thesis is concerned with three closely related problems. The first one is called Multiple-Input Multiple-Output (MIMO) Instantaneous Blind Identification, which we denote by MIBI. In this problem a number of mutually statistically independent source signals are mixed by a MIMO instantaneous mixing system and only the mixed signals are observed, i.e. both the mixing system and the original sources are unknown or ¡blind¢. The goal of MIBI is to identify the MIMO system from the observed mixtures of the source signals only. The second problem is called Instantaneous Blind Signal Separation (IBSS) and deals with recovering mutually statistically independent source signals from their observed instantaneous mixtures only. The observation model and assumptions on the signals and mixing system are the same as those of MIBI. However, the main purpose of IBSS is the estimation of the source signals, whereas ...

van de Laar, Jakob — T.U. Eindhoven


MIMO Instantaneous Blind Identification and Separation based on Arbitrary Order Temporal Structure in the Data

This thesis is concerned with three closely related problems. The first one is called Multiple-Input Multiple-Output (MIMO) Instantaneous Blind Identification, which we denote by MIBI. In this problem a number of mutually statistically independent source signals are mixed by a MIMO instantaneous mixing system and only the mixed signals are observed, i.e. both the mixing system and the original sources are unknown or ‘blind’. The goal of MIBI is to identify the MIMO system from the observed mixtures of the source signals only. The second problem is called Instantaneous Blind Signal Separation (IBSS) and deals with recovering mutually statistically independent source signals from their observed instantaneous mixtures only. The observation model and assumptions on the signals and mixing system are the same as those of MIBI. However, the main purpose of IBSS is the estimation of the source signals, whereas ...

van de Laar, Jakob — TU Eindhoven


Algorithms and architectures for adaptive array signal processing

Antenna arrays sample propagating waves at multiple locations. They are employed e.g. in radar, sonar and wireless communication systems because of their capacity of spatial selectivity and localization of radiating sources. Current model-based algorithms make use of computationally demanding orthogonal matrix decompositions such as the singular value decomposition (SVD). On the other hand the data rates are often extremely high. Therefore, real-time execution of complex algorithms often requires parallel computing. We study the simultaneous design of new algorithms and parallel architectures for subspace tracking, for robust adaptive beamforming and for direction finding of narrow-band and wide-band sources. By structuring all recursive algorithms in a similar way, they can be mapped efficiently onto the Jacobi architecture, which was originally developed for SVD updating. The numerical and architectural aspects of this algorithm are improved by the use of a minimal parameterziation of ...

Vanpoucke, Filiep — Katholieke Universiteit Leuven


Random sampling methods for two-view geometry estimation

This thesis treats efficient estimation algorithms for the epipolar geometry, the model underlying two views of the same scene or object. The epipolar geometry is computed from image correspondences that are found by local feature matching. These correspondences are used to calculate the fundamental matrix, which is the mathematical representation of the epipolar geometry. Since there are outliers among the correspondences, the fundamental matrix is usually calculated by the robust RANSAC (RANdom SAmple Consensus) algorithm which is very well suited for this purpose. A disadvantage of the algorithm, however, is that it shows a considerable complexity for higher outlier ratios. This hampers its application in vision algorithms dealing with many views. In this thesis we investigate techniques for faster fundamental matrix estimation using RANSAC. The first approach that is taken is the computation of inlier probabilities for the correspondences, that ...

Den Hollander, Richard Jacobus Maria — Delft University of Technology


Optimization Algorithms for Discrete Markov Random Fields, with Applications to Computer Vision

A large variety of important tasks in low­-level vision, image analysis and pat­tern recognition can be formulated as discrete labeling problems where one seeks to optimize some measure of the quality of the labeling. For example such is the case in optical flow estimation, stereo matching, image restoration to men­tion only a few of them. Discrete Markov Random Fields are ideal candidates for modeling these labeling problems and, for this reason, they are ubiquitous in computer vision. Therefore, an issue of paramount importance, that has at­tracted a significant amount of computer vision research over the past years, is how to optimize discrete Markov Random Fields efficiently and accurately. The main theme of this thesis is concerned exactly with this issue. Two novel MRF op­timization schemes are thus presented, both of which manage to extend current state-­of­-the­-art techniques in significant ways. ...

Komodakis, Nikos — University of Crete


Fast Blind Adaptive Equalisation for Multiuser CDMA Systems

In order to improve communication over a dispersive channel in a CDMA system, we have to re-establish the orthogonally of codes which are used when combining input signals from many users onto a single communication path, as otherwise the performance of such system is limited significantly by inter-symbol interference (ISI) and multiuser access interference (MAI). In order to achieve this, adaptive filters are employed. A variety of adaptive schemes to remove ISI and MAI have been reported in the literature, some of which rely on training sequences, such as the Least Mean Squares (LMS) and Recursive Least Squares (RLS) algorithms, or on blind adaptation, such as the Constant Modulus Algorithm (CMA) or the Decision Directed algorithm (DD), which has similar convergence properties as the LMS in the absence of decision errors, the CMA is relatively slow compared to the DD ...

Daas, Adel — University of Strathclyde

The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.

The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.