The Radar Resource Management (RRM) problem in a multi-sensor multi-target scenario is considered. The problem is defined as a constrained optimization problem in which the predicted error covariance is minimized subject to resource budget constraints. By applying Lagrangian Relaxation (LR) the problem is decoupled into multiple sub-optimization problems. The problem is modeled according to a Partially Observable Markov Decision Process (POMDP). Using a stochastic optimization framework called policy rollout, the POMDP is solved non-myopically by looking ahead into the expected future. Two novel implementations, namely a centralized and distributed implementation are presented as viable approaches for solving this problem for a multi-sensor case. The centralized implementation, defined as the approximately optimal solution, utilizes a global policy per task. As such, the policy rollout for a single target needs to explore the actions of multiple sensors. The distributed implementation is considered as a practical alternative to improve on the computational complexity of the policy rollout of the centralized implementation. Now per sensor and per task a policy rollout is computed. To maintain a similar performance as the centralized implementation, at the beginning of each policy rollout the last known actions of the other sensors are shared. An additional third independent implementation is considered. The independent implementation uses no communication during the optimization process and is considered to be the implementation with the lowest performance with respect to the cost. All implementations have been applied to multiple two-dimensional simulated radar tracking scenarios. A comparison is made between the centralized, distributed and independent implementation based on the average cost and runtime. Results indicate that both the centralized and distributed implementation outperform the independent implementation with respect to the cost by a factor two. Subsequently, the distributed solution converges to similar results as the centralized implementation while requiring significantly less computational resources.

With modern multi-function radars becoming more flexible, handling the limited amount of resources of these radars becomes increasingly important. In this thesis the radar resource management (RRM) problem in a multi-target tracking scenario is considered. Partially observable Markov decision processes (POMDPs) are used to describe each tracking task. By comparing the future effect of radar actions using model predictive control (MPC), the POMDPs are solved in a non-myopic way. The model predictive control problem can be decoupled into sub-problems using Lagrangian Relaxation to reduce the computational complexity of the solution method. An algorithm based on golden section search is employed to find the Lagrange multiplier. An interacting multiple model filter is used to allow the method to be effective in RRM problems involving the tracking of targets performing a broad number of maneuvers.
The novel approach is compared to an existing solution method based on policy rollout and Monte Carlo sampling. Through simulations of dynamic multi-target tracking scenarios in which the cost and computational complexity of different approaches are compared, it was shown that the computational complexity is greatly reduced while the resulting resource allocation results remain similar.

Indoor positioning using Bluetooth addressed a great concern. The properties of narrowband usage, low energy consumption and universality on devices attract numerous customers and promote researchers to investigate potential of Bluetooth in indoor positioning field. It has already supported Angle-of-Arrival (AoA) and Angle-of-Departure (AoD) in angle domain for indoor localization. In range domain, using Received Signal Strength (RSS) is practicable but it cannot provide enough resolution. It is needed to develop a technique that can improve resolution for range finding feature. The challenges of localization in indoor environments are mainly from the multipath propagation of signals. In this thesis, a subspace-based super-resolution algorithm for time delay dispersion estimate is developed. Range finding is realized by computing time-of-arrival (ToA) parameter of signal arriving at direct line-of-sight (DLoS). An essential procedure before the developed algorithm is applied is that to correctly separate subspace into signal space and noise space. Techniques for subspace separation are investigated in this thesis. In this thesis, we want to explore the potential of indoor localization using Bluetooth narrowband radios. To start with, a data model according to the property of the conducted measurement data is developed. The conducted measurement data is radio channel measurements based on channel sounding technique. Then the data model is developed as channel impulse response model and multipath signals are indicated by different time delays. Since an accurate covariance matrix of measurement data is required for super-resolution algorithm, smoothing techniques is employed. The smoothing techniques considered are forward smoothing technique and forward-backward smoothing technique. For the purpose of obtaining an accurate subspace separation, two techniques are investigated in this thesis, namely MDL criteria algorithm and the threshold method. in order to investigate the performance and reliability of those two techniques, experiments are taken out using different parameter values. Comparison is made between the results of these two techniques. Afterwards, subspace-based super-resolution algorithm is taken into consideration. In this thesis, the super-resolution algorithm implemented is MUSIC algorithm. The functionality of MUSIC algorithm on narrowband radios measurements is tested and evaluated firstly by simulation experiments, which demonstrates the practicability of applying MUSIC algorithm on narrowband radios measurements. Then experiments are extended to the measurement data that conducted from real indoor environments, for the purpose of indoor localization realization using narrowband radios.

In many countries the number of wind turbines is growing rapidly as a response to the increasing demandfor renewable energy.Modern wind turbines are large structures, many reach more than 150 meters above theground. Clusters of densely spaced wind turbines, so called wind farms, are being built both on- and offshore. Wind farm installations relatively near to radar systems generate clutter returns that usually affect the normal operation of these radars. Interference caused by wind turbines is more severe for many radar systems than interference caused by stationary objects such as masts or towers. This is due to the rotating blades of the wind turbines. Many Doppler radars use a filter that removes echoes originating from objects with no or little radial velocity. However, these filters do not work for rotating objects such as the rotating blades of wind turbines. Wind turbines located around the line of sight of Doppler radars can cause clutter, blockage, and erroneous velocity measurements, affecting the performance of both military and civilian radar systems. As a result, the unwanted radar return from wind farms, known as Wind Turbine Clutter (WTC), is considered to be dynamic clutter due to the nonzero Doppler return created by rotating wind turbine blades. Nowadays numerous radar systems are developed in order to exploit the diverse information obtained through transmission of waves with different polarizations. This technique is widely known as polarimetry. Many targets of interest exhibit Radar Cross Sections which vary with different transmitted and received polarizations. Wind Turbines also experiences this variability. In this thesis we propose a method to optimal detect the presence of WTC with the use of radar polarimetry. Since the crucial part of this interference comes from the blades rotation, we initially propose a method to estimate the angular velocity of these blades. The estimation of this parameter is derived with the use of proper combination of maximum likelihood estimation theory and radar polarimetry. As there is absence of Micro-Doppler when the radar beam axis and rotation coincide, a separate estimator for this case is pro-posed. In the final part of this thesis, we present a detection approach based on the same signal model used for angular velocity estimation. Again we define a detection rule for the case when radar beam axis and rotation axis coincide and one when they do not. Although at some extent the used model for the second case is valid for low frequencies (f<1 GHz), both estimator and detector derivations can be further applied for higher frequencies signal models. All these mathematical derivations are accompanied with proper simulations.

Generative adversarial networks (GANs) are a class of generative models, for which the goal is to learn from training data and then to generate data with similar characteristics. Despite the wide use of GANs, a quantitative evaluation method of their performance is lacking. In the current work, we invented a series of artificial datasets, consisting of images with one or two spheres in arbitrary locations, to evaluate the performance of GANs from two aspects: the quality, which evaluates the visual quality of generated images, and the diversity, which evaluates GANs’ ability to generate samples with different modes in the real data distribution. We further explored the validity of an alternative evaluation metric, the Wasserstein distance, as an indicator of the quality and the diversity for Wasserstein GANs. Furthermore, we explored two improving techniques that boosted the performance of GANs, namely the addition of regularization terms and the ‘Smooth-to-Sharp’ training algorithm, and validate their efficacy on the MINIST dataset. Our proposed quantitative evaluation method could help researchers select better models and promote the improvement of GANs’ performances. Future work to increase the complexity of our artificial datasets, to validate our improving techniques in more complicated real-world datasets, and to investigate the use of estimated Wasserstein distance is planned.

Clock synchronization among the nodes of a wireless acoustic sensor network (WASN) is a significant issue that affects the performance of multi-channel noise reduction schemes. Since independent sensors are utilized, each accompanied by its internal clock, clock offsets are inevitable, even if the mismatch in the sampling frequencies is negligible. In this thesis, clock offsets are mathematically modeled and the problem of multi-channel linear filtering for speech enhancement is addressed through signal subspace methods. For this purpose, the generalized eigenvalue decomposition (GEVD) of the cross-power spectral density (CPSD) matrices of the noise and target speech processes is capitalized. Beamformers based on this technique are proved to be invariant to sensor clock offsets when used in a blind manner, exploiting only network measurements. This result is confirmed through experiments in a simulated environment.

When the re brigade arrives at a burning building, it is of vital importance that people who are still inside can quickly be found. In this thesis we contribute to an ultrasonic sound sensor for human presence detection in smoke-lled spaces. This type of sensor could assist the re brigade when evacuating a large building by directing them to the places where their help is most needed. The advantage of ultrasonic sound over other sensors or cameras is that its signal is able to pierce through smoke, does not require badges or other wearable devices and introduces little privacy and security risks. In addition, ultrasonic sensors are very inexpensive making it possible to equip every room of a building with an ultrasonic presence detector. In this research an ultrasonic sensor was built for less than 20 Euros and it was found to be unaected by the glycerine based smoke that it was tested in. Using a particle filter based on sequential importance resampling as well as a Filter based on Gaussian approximation of the posterior density the resulting system was reliably able to detect when there was a single person walking in the sensor direction, even when other sources of movement such as doors and chairs were present.

The detection of unusual behavior plays a crucial role in the prevention of illegal and harmful activities such as smuggling, piracy, arms trading, human trafficking and illegal immigration. Also for military applications, it is useful to detect anomalous behavior to provide an alert for potential threats, especially with the more recent widespread use of drones for warfare and terrorist activities. In order to provide a solution for these emerging needs, in this work, a novel method for target dynamic behavior classification by analyzing trajectories using data gathered from multiple heterogeneous sensors is presented. The aim is to develop a context-free (i.e., sensor indifferent) method to robustly classify a selected set of anomalous trajectories and present those results to a human operator in remote sensing applications. In order to track maneuvering targets, it is typically required to use multiple (dynamic) model approach to make dynamic state inferences accurately. In practice, system parameters are typically tuned manually. The approach taken here is to estimate the parameters of a set of these so-called hybrid systems, also known as jump-Markov systems (JMS). This task will be carried out using a maximum likelihood (ML) approach, via the expectation-maximization (EM) algorithm. To handle highly nonlinear measurement models, such as those typically present in remote sensing applications, sequential Monte Carlo (SMC) or particle filters will be used to make accurate state estimations. These methods are also capable of dealing with non-Gaussian measurement or process noise. The central question explored in this work is if jump-Markov systems are a suitable class of models for trajectory classification by learning their parameters from multi-sensor measurement data.

According to literature, MIMO radars often use orthogonal waveforms on their different channels to achieve a wide angular beam and so-called colored transmission. The generation of orthogonal signals is very difficult and true orthogonality cannot be achieved in practice. The Circulating Codes provide a simplified alternative to orthogonal signals, by transmitting the same waveform, but slightly shifted in time from channel to channel. By applying digital beamforming on transmit through signal processing on receive, a performance similar to orthogonal signals can be achieved. The Circulating Codes can also be used with a spatial code along the antenna elements, to improve the auto-correlation properties of the signal and thus the range resolution of the radar. These codes are called Hybrid or Delft Codes.

In this thesis, the Circulating Codes, as well as Hybrid Codes are revisited and analyzed again. An implementation for simulations has been created in Matlab to examine their behavior in more detail. To improve the range resolution of the Hybrid Codes, this thesis proposes the use of so-called Golay pairs as spatial codes. Each Golay pair consists of two codes, which have the property that the sum of their auto-correlation functions produces one strong peak and zero sidelobes. Since the application of these codes requires the transmission of two pulses, the phase shift due to the displacement of a moving target in between of the pulses has an impact on the result. This thesis focuses on the mitigation or correction of this phase shift, by the use of different methods and presents two possible solutions which perform well in simulations.

Finally, some of the techniques are applied in practical measurements with an available radar system. The results of these measurements show that the single-pulse techniques of the Circulating and Hybrid Codes perform well with the system, while the multi-pulse techniques with Golay pairs suffer from much higher sidelobes than expected from the simulations. First of all, this shows that the system has certain issues that need to be improved. Secondly, it shows that Hybrid Codes with Golay pairs are sensitive to disturbances and phase shifts. Therefore, very clean signals are required that might be difficult to generate in practice.