Hybrid Fingerprinting-EKF Based Tracking Schemes for Indoor Passive Localization

This paper investigates a combination of fingerprinting (FP) and extended Kalman filter (EKF) based tracking aiming to tackle conventional problems related to implementation of either tracking or fingerprinting separately. One of the common drawbacks of FP belongs to large data size and consequent l...

Full description

Saved in:
Bibliographic Details
Main Authors: Salar Bybordi, Luca Reggiani
Format: Article
Language:English
Published: Wiley 2014-12-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2014/351523
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates a combination of fingerprinting (FP) and extended Kalman filter (EKF) based tracking aiming to tackle conventional problems related to implementation of either tracking or fingerprinting separately. One of the common drawbacks of FP belongs to large data size and consequent large search space. By taking advantage of latest position estimate got from EKF, a virtual surveillance area (VSA) is defined around the estimate. The dimension of this defined surveillance area is much smaller than the size of indoor environment. Consequently, there will be a possibility for FP to be applied in larger areas maintaining the possibility of adding necessary grid points in order to achieve a desired localization performance. Additionally, in order to improve accuracy of ranging, we investigate the impact of a priori knowledge related to the clusters impulse responses and other features; the applied so called soft ranging algorithm for time of arrival (TOA) estimation is modified in order to take advantage of this a priori information and to make its decision variables more accurate. Simulation results show a promising performance improvement via using the proposed hybrid tracking technique and applying a priori information to soft ranging. The tradeoff is along a reasonable increased implementation complexity.
ISSN:1550-1477