Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Sangarapillai Lambotharan"

Filter results by typing the first few letters
Now showing 1 - 6 of 6
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    An improved resampling approach for particle filters in tracking
    (IEEE, 2017-11-06) Yu Gong; Sangarapillai Lambotharan; Abdullahi Daniyan
    Resampling is an essential step in particle filtering (PF) methods in order to avoid degeneracy. Systematic resampling is one of a number of resampling techniques commonly used due to some of its desirable properties such as ease of implementation and low computational complexity. However, it has a tendency of resampling very low weight particles especially when a large number of resampled particles are required which may affect state estimation. In this paper, we propose an improved version of the systematic resampling technique which addresses this problem and demonstrate performance improvement.
  • No Thumbnail Available
    Item
    Bayesian Multiple Extended Target Tracking Using Labeled Random Finite Sets and Splines
    (IEEE, 2018-10-04) Abdullahi Daniyan; Sangarapillai Lambotharan; Anastasios Deligiannis; Yu Gong; Wen-Hua Chen
    In this paper, we propose a technique for the joint tracking and labeling of multiple extended targets. To achieve multiple extended target tracking using this technique, models for the target measurement rate, kinematic component, and target extension are defined and jointly propagated in time under the generalized labeled multi-Bernoulli filter framework. In particular, we developed a Poisson mixture variational Bayesian model to simultaneously estimate the measurement rate of multiple extended targets and extended target extension was modeled using B-splines. We evaluated our proposed method with various performance metrics. Results demonstrate the effectiveness of our approach.
  • No Thumbnail Available
    Item
    Data association using game theory for multi-target tracking in passive bistatic radar
    (IEEE, 2017-06-20) Yu Gong; Abdullahi Daniyan; Abdulrazaq Aldowesh; Sangarapillai Lambotharan
    We investigate a game theoretic data association technique for multi-target tracking (MTT) with varying number of targets in a real passive bi-static radar (PBR) environment. The radar measurements were obtained through a PBR developed using National Instrument (NI) Universal Software Radio Peripheral (USRP). We considered the problem of associating target state-estimates-to-tracks for varying number of targets. We use the sequential Monte Carlo probability hypothesis density (SMC-PHD) filter to perform the multi-target tracking in order to obtain the target state estimates and model the interaction between target tracks as a game. Experimental results using this real radar data demonstrate effectiveness of the game theoretic data association for multiple target tracking.
  • No Thumbnail Available
    Item
    Game theoretic data association for multi-target tracking with varying number of targets
    (IEEE, 2016-06-23) Abdullahi Daniyan; Yu Gong; Sangarapillai Lambotharan
    We investigate a game theoretic data association technique for multi-target tracking (MTT) with varying number of targets. The problem of target state-estimate-to-track data association has been considered. We use the SMC-PHD filter to handle the MTT aspect and obtain target state estimates. We model the interaction between target tracks as a game by considering them as players and the set of target state estimates as strategies. Utility functions for the players are defined and a regret-based learning algorithm with a forgetting factor is used to find the equilibrium of the game. Simulation results are presented to demonstrate the performance of the proposed technique.
  • No Thumbnail Available
    Item
    Kalman-Gain Aided Particle PHD Filter for Multitarget Tracking
    (IEEE, 2017-04-05) Abdullahi Daniyan; Yu Gong; Sangarapillai Lambotharan; Pengming Feng; Jonathon Chambers
    We propose an efficient sequential Monte Carlo probability hypothesis density (PHD) filter which employs the Kalman-gain approach during weight update to correct predicted particle states by minimizing the mean square error between the estimated measurement and the actual measurement received at a given time in order to arrive at a more accurate posterior. This technique identifies and selects those particles belonging to a particular target from a given PHD for state correction during weight computation. Besides the improved tracking accuracy, fewer particles are required in the proposed approach. Simulation results confirm the improved tracking performance when evaluated with different measures.
  • No Thumbnail Available
    Item
    Secrecy Rate Optimizations for MIMO Communication Radar
    (IEEE, 2018-03-28) Anastasios Deligiannis; Abdullahi Daniyan; Sangarapillai Lambotharan; Jonathon A. Chambers
    In this paper, we investigate transmit beampattern optimization techniques for a multiple-input multiple-output radar in the presence of a legitimate communications receiver and an eavesdropping target. The primary objectives of the radar are to satisfy a certain target-detection criterion and to simultaneously communicate safely with a legitimate receiver by maximizing the secrecy rate against the eavesdropping target. Therefore, we consider three optimization problems, namely target return signal-to-interference-plus-noise ratio maximization, secrecy rate maximization, and transmit power minimization. However, these problems are nonconvex due to the nonconcavity of the secrecy rate function, which appears in all three optimizations either as the objective function or as a constraint. To solve this issue, we use Taylor series approximation of the nonconvex elements through an iterative algorithm, which recasts the problem as a convex problem. Two transmit covariance matrices are designed to detect the target and convey the information safely to the communication receiver. Simulation results are presented to validate the efficiency of the aforementioned optimizations.

DSpace software copyright © 2002-2025 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify