9 August 2018 in IEEE Transactions on Mobile Computing
Mobile Cloud Computing or Fog computing refers to offloading computationally intensive algorithms from a mobile device to the cloud or an intermediate cloud in order to save resources e.g., time and energy in the mobile device. This paper proposes new solutions for situations when the cloud or fog is not available. First, the sensor network is modelled using a network of queues, then a linear programming technique is used to make scheduling decisions. Various centralized and distributed algorithms are then proposed, which improves overall system performance. Extensive simulations show slightly higher energy usage in comparison to the baseline non-offloading case, however, the job completion rate is significantly improved, the efficiency score metric shows the extra energy usage is justified. The algorithms have been simulated in various environments including high and low bandwidth, partial connectivity, and different rate of information exchanges to study the pros and cons of the proposed algorithms.
8 March 2023 in IEEE Transactions on Signal Processing
Sequential Bayesian filters in non-linear dynamic systems require the recursive estimation of the predictive and posterior probability density function (pdf). This paper introduces a Bayesian filter called the adaptive kernel Kalman filter (AKKF). The AKKF approximates the arbitrary predictive and posterior pdf of hidden states using the kernel mean embedding (KME) in reproducing kernel Hilbert space (RKHS). In parallel with the KME, some particles in the data space are used to capture the properties of the dynamic system model. Specifically, particles are generated and updated in the data space. Moreover, the corresponding kernel weight means vector and covariance matrix associated with the particles' kernel feature mappings are predicted and updated in the RKHS based on the kernel Kalman rule (KKR). Simulation results are presented to confirm the improved performance of our approach with significantly reduced numbers of particles by comparing with the unscented Kalman filter (UKF), particle filter (PF), and Gaussian particle filter (GPF). For example, compared with the GPF, the AKKF provides around 50% logarithmic mean square error (LMSE) tracking performance improvement in the bearing-only tracking (BOT) system when using 50 particles.
24 July 2019 in IEEE Transactions on Aerospace and Electronic Systems
The number of nodes in sensor networks is continually increasing, and maintaining accurate track estimates inside their common surveillance region is a critical necessity. Modern sensor platforms are likely to carry a range of different sensor modalities, all providing data at differing rates, and with varying degrees of uncertainty. These factors complicate the fusion problem as multiple observation models are required, along with a dynamic prediction model. However, the problem is exacerbated when sensors are not registered correctly with respect to each other, i.e. if they are subject to a static or dynamic bias. In this case, measurements from different sensors may correspond to the same target, but do not correlate with each other when in the same Frame of Reference (FoR), which decreases track accuracy. This paper presents a method to jointly estimate the state of multiple targets in a surveillance region, and to correctly register a radar and an Infrared Search and Track (IRST) system onto the same FoR to perform sensor fusion. Previous work using this type of parent-offspring process has been successful when calibrating a pair of cameras, but has never been attempted on a heterogeneous sensor network, nor in a maritime environment. This article presents results on both simulated scenarios and a segment of real data that show a significant increase in track quality in comparison to using incorrectly calibrated sensors or single-radar only.
20 June 2022 in IEEE Signal Processing Letters
This letter incorporates the adaptive kernel Kalman filter (AKKF) into the belief propagation (BP) algorithm for Multi-target tracking (MTT) in single-sensor systems. The algorithm is capable of tracking an unknown and time-varying number of targets, in the presence of false alarms, clutter and measurement-to-target association uncertainty. Experiment results reveal that the proposed method has a favourable tracking performance using the generalized optimal sub-patten assignment (GOSAP) metrics at substantially less computation cost than the particle filter (PF) based Multi-target tracking (MTT) BP algorithm.
1 March 2014 in Signal Processing
8 February 2024 in Methods and Applications in Fluorescence
Many medical imaging modalities have benefited from recent advances in Machine Learning (ML), specifically in deep learning, such as neural networks. Computers can be trained to investigate and enhance medical imaging methods without using valuable human resources. In recent years, Fluorescence Lifetime Imaging (FLIm) has received increasing attention from the ML community. FLIm goes beyond conventional spectral imaging, providing additional lifetime information, and could lead to optical histopathology supporting real-time diagnostics. However, most current studies do not use the full potential of machine/deep learning models. As a developing image modality, FLIm data are not easily obtainable, which, coupled with an absence of standardisation, is pushing back the research to develop models which could advance automated diagnosis and help promote FLIm. In this paper, we describe recent developments that improve FLIm image quality, specifically time-domain systems, and we summarise sensing, signal-to-noise analysis and the advances in registration and low-level tracking. We review the two main applications of ML for FLIm: lifetime estimation and image analysis through classification and segmentation. We suggest a course of action to improve the quality of ML studies applied to FLIm. Our final goal is to promote FLIm and attract more ML practitioners to explore the potential of lifetime imaging.