Kernel Methods for Accurate UWB-Based Ranging with Reduced Complexity

2015-11-10 · Vladimir Savic, Erik G. Larsson, Javier Ferrer-Coll, Peter Stenumgaard

Accurate and robust positioning in multipath environments can enable many applications, such as search-and-rescue and asset tracking. For this problem, ultra-wideband (UWB) technology can provide the most accurate range estimates, which are required for range-based positioning. However, UWB still faces a problem with non-line-of-sight (NLOS) measurements, in which the range estimates based on time-of-arrival (TOA) will typically be positively biased. There are many techniques that address this problem, mainly based on NLOS identification and NLOS error mitigation algorithms. However, these techniques do not exploit all available information in the UWB channel impulse response. Kernel-based machine learning methods, such as Gaussian Process Regression (GPR), are able to make use of all information, but they may be too complex in their original form. In this paper, we propose novel ranging methods based on kernel principal component analysis (kPCA), in which the selected channel parameters are projected onto a nonlinear orthogonal high-dimensional space, and a subset of these projections is then used as an input for ranging. We evaluate the proposed methods using real UWB measurements obtained in a basement tunnel, and found that one of the proposed methods is able to outperform state-of-the-art, even if little training samples are available.

📄 PDF Abstract BibTeX arXiv:1511.04045

Code (0)

등록된 구현이 없습니다.

Tasks

GPR

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Cascaded Coarse-to-Fine Deep Kernel Networks for Efficient Satellite Image Change Detection

2018-12-21 · Hichem Sahbi

Deep networks are nowadays becoming popular in many computer vision and pattern recognition tasks. Among these networks, deep kernels are particularly interesting and effective, however, their computational complexity is…

Change Detection

Non-Linear Reduced Modeling by Generalized Kernel-Based Dynamic Mode Decomposition

2017-10-30 · Patrick Héas, Cédric Herzet, Benoit Combès

Reduced modeling of a computationally demanding dynamical system aims at approximating its trajectories, while optimizing the trade-off between accuracy and computational complexity. In this work, we propose to achieve s…

Generalized Kernel-Based Dynamic Mode Decomposition

2020-02-11 · Patrick Heas, Cedric Herzet, Benoit Combes

Reduced modeling in high-dimensional reproducing kernel Hilbert spaces offers the opportunity to approximate efficiently non-linear dynamics. In this work, we devise an algorithm based on low rank constraint optimization…

PDE-DKL: PDE-constrained deep kernel learning in high dimensionality

2025-01-30 · Weihao Yan, Christoph Brune, Mengwu Guo

Many physics-informed machine learning methods for PDE-based problems rely on Gaussian processes (GPs) or neural networks (NNs). However, both face limitations when data are scarce and the dimensionality is high. Althoug…

Computational Efficiency Gaussian Processes Physics-informed machine learning Uncertainty Quantification

Learning Infinite Layer Networks without the Kernel Trick

2017-08-01 · ICML 2017 8 · Roi Livni, Daniel Carmon, Amir Globerson

Infinite Layer Networks (ILN) have been proposed as an architecture that mimics neural networks while enjoying some of the advantages of kernel methods. ILN are networks that integrate over infinitely many nodes wit…