Modified Jaccard index analysis and adaptive feature selection for location fingerprinting with limited computational complexity

被引:4
|
作者
Zhou, Caifa [1 ]
Wieser, Andreas [1 ]
机构
[1] Swiss Fed Inst Technol, Inst Geodesy & Photogrammetry, Zurich, Switzerland
关键词
Fingerprinting-based indoor positioning; adaptive forward-backward greedy algorithm; feature selection; modified Jaccard; subregion selection; INDOOR LOCALIZATION; SYSTEMS;
D O I
10.1080/17489725.2019.1577505
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We propose an approach for fingerprinting-based positioning which reduces the data requirements and computational complexity of the online positioning stage. It is based on a segmentation of the entire region of interest into subregions, identification of candidate subregions during the online-stage, and position estimation using a pre-selected subset of relevant features. The subregion selection uses a modified Jaccard which quantifies the similarity between the features observed by the user and those available within the reference fingerprint map. The adaptive feature selection is achieved using an adaptive forward-backward greedy search which determines a subset of features for each subregion, relevant with respect to a given fingerprinting-based positioning method. In an empirical study using signals of opportunity for fingerprinting the proposed subregion and feature selection reduce the processing time during the online-stage by a factor of about 10 while the positioning accuracy does not deteriorate significantly. In fact, in one of the two study cases, the 90th percentile of the circular error increased by 7.5% while in the other study case we even found a reduction of the corresponding circular error by 30%.
引用
收藏
页码:128 / 157
页数:30
相关论文
共 50 条
  • [1] Jaccard Analysis and LASSO-Based Feature Selection for Location Fingerprinting with Limited Computational Complexity
    Zhou, Caifa
    Wieser, Andreas
    PROGRESS IN LOCATION BASED SERVICES 2018, 2018, : 71 - 87
  • [2] A MODIFIED STRUCTURAL SIMILARITY INDEX WITH LOW COMPUTATIONAL COMPLEXITY
    Loh, Woei-Tan
    Bong, David Boon Liang
    2019 INTERNATIONAL SYMPOSIUM ON INTELLIGENT SIGNAL PROCESSING AND COMMUNICATION SYSTEMS (ISPACS), 2019,
  • [3] Unsupervised Modified Adaptive Floating Search Feature Selection
    Devakumari, D.
    Thangavel, K.
    ADVANCES IN COMPUTING AND COMMUNICATIONS, PT 2, 2011, 191 : 358 - +
  • [4] A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems
    Froese, Vincent
    van Bevern, Rene
    Niedermeier, Rolf
    Sorge, Manuel
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 445 - 456
  • [5] Adaptive feature selection for hyperspectral data analysis
    Korycinski, D
    Crawford, MM
    Barnes, JW
    IMAGE AND SIGNAL PROCESSING FOR REMOTE SENSING IX, 2004, 5238 : 213 - 225
  • [6] Computational complexity analysis of the sensor location flow observability problem
    Monica Gentili
    Pitu Mirchandani
    Optimization Letters, 2014, 8 : 2245 - 2259
  • [7] Computational complexity analysis of the sensor location flow observability problem
    Gentili, Monica
    Mirchandani, Pitu
    OPTIMIZATION LETTERS, 2014, 8 (08) : 2245 - 2259
  • [8] Computational Intelligence in Human Feature Analysis and Pose Selection
    Pettigrew, Jacob
    Woo, Gideon
    Tsang, Herbert H.
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 2031 - 2038
  • [9] TOWARD A FUNDAMENTAL THEORY OF OPTIMAL FEATURE SELECTION - II: IMPLEMENTATION AND COMPUTATIONAL COMPLEXITY.
    Morgera, Salvatore D.
    IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987, PAMI-9 (01) : 29 - 38
  • [10] The multilevel facility location and pricing problems: the computational complexity and the stability analysis
    Panin, Artem A.
    Plyasunov, Alexandr, V
    OPTIMIZATION LETTERS, 2023, 17 (06) : 1295 - 1315