Representation Learning in Distributed Networks

The effectiveness of machine learning (ML) in today's applications largely depends on the goodness of the representation of data used within the ML algorithms. While the massiveness in dimension of modern day data often requires lower-dimensional data representations in many applications for efficient use of available computational resources, the use of uncorrelated features is also known to enhance the performance of ML algorithms. Thus, an efficient representation learning solution should focus on dimension reduction as well as uncorrelated feature extraction. Even though Principal Component Analysis (PCA) and linear autoencoders are fundamental data preprocessing tools that are largely used for dimension reduction, when engineered properly they can also be used to extract uncorrelated features. At the same time, factors like ever-increasing volume of data or inherently distributed data generation impede the use of existing centralized solutions for representation learning that require ...

Gang, Arpita — Rutgers University-New Brunswick


Algorithmic Enhancements to Polynomial Matrix Factorisations

In broadband array processing applications, an extension of the eigenvalue decomposition (EVD) to parahermitian Laurent polynomial matrices - named the polynomial matrix EVD (PEVD) - has proven to be a useful tool for the decomposition of space-time covariance matrices and their associated cross-spectral density matrices. Existing PEVD methods typically operate in the time domain and utilise iterative frameworks established by the second-order sequential best rotation (SBR2) or sequential matrix diagonalisation (SMD) algorithms. However, motivated by recent discoveries that establish the existence of an analytic PEVD - which is rarely recovered by SBR2 or SMD - alternative algorithms that better meet analyticity by operating in the discrete Fourier transform (DFT)-domain have received increasing attention. While offering promising results in applications including broadband MIMO and beamforming, the PEVD has seen limited deployment in hardware due to its high computational complexity. If the ...

Coutts, Fraser Kenneth — University of Strathclyde


SPECTRAL MINUTIAE REPRESENTATIONS

,The term biometrics refers to the technologies that measure and analyze human intrinsic physical or behavioral characteristics for authenticating individuals. Nowadays, biometric technology is increasingly deployed in civil and commercial applications. The growing use of biometrics is raising security and privacy concerns. Storing biometric data, known as biometric templates, in a database leads to several privacy risks such as identity fraud and cross matching. A solution is to apply biometric template protection techniques, which aim to make it impossible to recover the biometric data from the templates. The goal of our research is to combine biometric systems with template protection. Aimed at fingerprint recognition, this thesis introduces the Spectral Minutiae Representation method, which enables the combination of a minutiae-based fingerprint recognition system with template protection schemes based on fuzzy commitment or helper data schemes. In this thesis, three spectral minutiae ...

Xu, Haiyung — University of Twente


Exploiting Sparsity for Efficient Compression and Analysis of ECG and Fetal-ECG Signals

Over the last decade there has been an increasing interest in solutions for the continuous monitoring of health status with wireless, and in particular, wearable devices that provide remote analysis of physiological data. The use of wireless technologies have introduced new problems such as the transmission of a huge amount of data within the constraint of limited battery life devices. The design of an accurate and energy efficient telemonitoring system can be achieved by reducing the amount of data that should be transmitted, which is still a challenging task on devices with both computational and energy constraints. Furthermore, it is not sufficient merely to collect and transmit data, and algorithms that provide real-time analysis are needed. In this thesis, we address the problems of compression and analysis of physiological data using the emerging frameworks of Compressive Sensing (CS) and sparse ...

Da Poian, Giulia — University of Udine


Kernel PCA and Pre-Image Iterations for Speech Enhancement

In this thesis, we present novel methods to enhance speech corrupted by noise. All methods are based on the processing of complex-valued spectral data. First, kernel principal component analysis (PCA) for speech enhancement is proposed. Subsequently, a simplification of kernel PCA, called pre-image iterations (PI), is derived. This method computes enhanced feature vectors iteratively by linear combination of noisy feature vectors. The weighting for the linear combination is found by a kernel function that measures the similarity between the feature vectors. The kernel variance is a key parameter for the degree of de-noising and has to be set according to the signal-to-noise ratio (SNR). Initially, PI were proposed for speech corrupted by additive white Gaussian noise. To be independent of knowledge about the SNR and to generalize to other stationary noise types, PI are extended by automatic determination of the ...

Leitner, Christina — Graz University of Technology


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


Novel Signal Processing Techniques For The Exploitation Of Thermal Hyperspectral Data

THIS doctoral thesis attemps to propose a novel signal processing chain, aimed to exploit data acquired by long wave infrared (LWIR) hyperspectral sensors. In the LWIR, infrared radiation from an object is directly related to its temperature, i.e. hotter the surface, higher the emitted thermal energy. Hyperspectral sensors capture the radiated energy from the objects (target) in a large number of consecutive spectral bands within the LWIR, e.g. with the aid of a prism, in order to estimate the spectrum(spectral emissivity) and the temperature of the surface material. In this framework, two main challenging tasks affect the development and the deployment of thermal hyperspectral sensors: - atmospheric correction: the process of estimate and compensate the thermal radiation produced by the atmosphere, that affects the thermal radiation procuded by the target. This process is made more complicated by the complex combination ...

Moscadelli, Matteo — University of Pisa


Spectral Variability in Hyperspectral Unmixing: Multiscale, Tensor, and Neural Network-based Approaches

The spectral signatures of the materials contained in hyperspectral images, also called endmembers (EMs), can be significantly affected by variations in atmospheric, illumination or environmental conditions typically occurring within an image. Traditional spectral unmixing (SU) algorithms neglect the spectral variability of the endmembers, what propagates significant mismodeling errors throughout the whole unmixing process and compromises the quality of the estimated abundances. Therefore, significant effort have been recently dedicated to mitigate the effects of spectral variability in SU. However, many challenges still remain in how to best explore a priori information about the problem in order to improve the quality, the robustness and the efficiency of SU algorithms that account for spectral variability. In this thesis, new strategies are developed to address spectral variability in SU. First, an (over)-segmentation-based multiscale regularization strategy is proposed to explore spatial information about the abundance ...

Borsoi, Ricardo Augusto — Université Côte d'Azur; Federal University of Santa Catarina


Robust Signal Processing with Applications to Positioning and Imaging

This dissertation investigates robust signal processing and machine learning techniques, with the objective of improving the robustness of two applications against various threats, namely Global Navigation Satellite System (GNSS) based positioning and satellite imaging. GNSS technology is widely used in different fields, such as autonomous navigation, asset tracking, or smartphone positioning, while the satellite imaging plays a central role in monitoring, detecting and estimating the intensity of key natural phenomena, such as flooding prediction and earthquake detection. Considering the use of both GNSS positioning and satellite imaging in critical and safety-of-life applications, it is necessary to protect those two technologies from either intentional or unintentional threats. In the real world, the common threats to GNSS technology include multipath propagation and intentional/unintentional interferences. This thesis investigates methods to mitigate the influence of such sources of error, with the final objective of ...

Li, Haoqing — Northeastern University


On some aspects of inverse problems in image processing

This work is concerned with two image-processing problems, image deconvolution with incomplete observations and data fusion of spectral images, and with some of the algorithms that are used to solve these and related problems. In image-deconvolution problems, the diagonalization of the blurring operator by means of the discrete Fourier transform usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard deconvolution techniques normally involve non-diagonalizable operators, resulting in rather slow methods, or, otherwise, use inexact convolution models, resulting in the occurrence of artifacts in the enhanced images. We propose a new deconvolution framework for images with incomplete observations that allows one to work with diagonalizable convolution operators, and therefore is very fast. The framework is also an efficient, high-quality alternative to existing methods of dealing with the image boundaries, such as edge ...

Simões, Miguel — Universidade de Lisboa, Instituto Superior Técnico & Université Grenoble Alpes


Bayesian methods for sparse and low-rank matrix problems

Many scientific and engineering problems require us to process measurements and data in order to extract information. Since we base decisions on information, it is important to design accurate and efficient processing algorithms. This is often done by modeling the signal of interest and the noise in the problem. One type of modeling is Compressed Sensing, where the signal has a sparse or low-rank representation. In this thesis we study different approaches to designing algorithms for sparse and low-rank problems. Greedy methods are fast methods for sparse problems which iteratively detects and estimates the non-zero components. By modeling the detection problem as an array processing problem and a Bayesian filtering problem, we improve the detection accuracy. Bayesian methods approximate the sparsity by probability distributions which are iteratively modified. We show one approach to making the Bayesian method the Relevance Vector ...

Sundin, Martin — Department of Signal Processing, Royal Institute of Technology KTH


Broadband angle of arrival estimation using polynomial matrix decompositions

This thesis is concerned with the problem of broadband angle of arrival (AoA) estimation for sensor arrays. There is a rich theory of narrowband solutions to the AoA problem, which typically involves the covariance matrix of the received data and matrix factorisations such as the eigenvalue decomposition (EVD) to reach optimality in various senses. For broadband arrays, such as found in sonar, acoustics or other applications where signals do not fulfil the narrowband assumption, working with phase shifts between different signals — as sufficient in the narrowband case — does not suffice and explicit lags need to be taken into account. The required space-time covariance matrix of the data now has a lag dimension, and classical solutions such as those based on the EVD are no longer directly applicable. There are a number of existing broadband AoA techniques, which are ...

Alrmah, Mohamed Abubaker — University of Strathclyde


Signal processing of FMCW Synthetic Aperture Radar data

In the field of airborne earth observation there is special attention to compact, cost effective, high resolution imaging sensors. Such sensors are foreseen to play an important role in small-scale remote sensing applications, such as the monitoring of dikes, watercourses, or highways. Furthermore, such sensors are of military interest; reconnaissance tasks could be performed with small unmanned aerial vehicles (UAVs), reducing in this way the risk for one's own troops. In order to be operated from small, even unmanned, aircrafts, such systems must consume little power and be small enough to fulfill the usually strict payload requirements. Moreover, to be of interest for the civil market, cost effectiveness is mandatory. Frequency Modulated Continuous Wave (FMCW) radar systems are generally compact and relatively cheap to purchase and to exploit. They consume little power and, due to the fact that they are ...

Meta, Adriano — Delft University of Technology


Distributed Signal Processing Algorithms for Acoustic Sensor Networks

In recent years, there has been a proliferation of wireless devices for individual use to the point of being ubiquitous. Recent trends have been incorporating many of these devices (or nodes) together, which acquire signals and work in unison over wireless channels, in order to accomplish a predefined task. This type of cooperative sensing and communication between devices form the basis of a so-called wireless sensor network (WSN). Due to the ever increasing processing power of these nodes, WSNs are being assigned more complicated and computationally demanding tasks. Recent research has started to exploit this increased processing power in order for the WSNs to perform tasks pertaining to audio signal acquisition and processing forming so-called wireless acoustic sensor networks (WASNs). Audio signal processing poses new and unique problems when compared to traditional sensing applications as the signals observed often have ...

Szurley, Joseph — KU Leuven


Spatio-temporal characterization of the surface electrocardiogram for catheter ablation outcome prediction in persistent atrial fibrillation

Atrial fibrillation (AF) is the most common sustained cardiac arrhythmia encountered in clinical practice, and one of the main causes of ictus and strokes. Despite the advances in the comprehension of its mechanisms, its thorough characterization and the quantification of its effects on the human heart are still an open issue. In particular, the choice of the most appropriate therapy is frequently a hard task. Radiofrequency catheter ablation (CA) is becoming one of the most popular solutions for the treatment of the disease. Yet, very little is known about its impact on heart substrate during AF, thus leading to an inaccurate selection of positive responders to therapy and a low success rate; hence, the need for advanced signal processing tools able to quantify AF impact on heart substrate and assess the effectiveness of the CA therapy in an objective and ...

Marianna Meo — Université Nice Sophia Antipolis

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.