Computational Complexity Closed-Form Upper Bounds Derivation for Fingerprint-Based Point-of-Interest Recognition Algorithms

被引：2

作者：

Bisio, Igor ^{[1
]}

Garibotto, Chiara ^{[1
]}

Lavagetto, Fabio ^{[1
]}

Sciarrone, Andrea ^{[1
]}

机构：

[1] Univ Genoa, DITEN Dept, I-16126 Genoa, Italy

来源：

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | 2020年 / 69卷 / 08期

关键词：

Wireless fidelity; Computational complexity; Upper bound; Mobile handsets; Fingerprint recognition; Indexes; Global Positioning System; Place recognition; WiFi fingerprinting; access points; mobile devices; smartphones;

D O I：

10.1109/TVT.2020.3000568

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Place recognition and user positioning methods are becoming trending topics among the research community thanks to the need of providing cutting-edge solutions to enable innovative and efficient Location-Based Services (LBS) and applications. However, the mobile framework suffers from typical constraints on energy and computational capabilities due to the inherent characteristics of wireless mobile devices. For this reason, in order to be suitable for deploying in such framework, a place recognition algorithm should be thrifty in terms of resource consumption. In this paper we consider six different WiFi-based outdoor positioning approaches and we analytically derive an upper-bound for their computational burden in terms of number of FLoating-point OPerations (FLOPs).

引用

页码：9083 / 9096

页数：14