arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.11091physics.soc-ph
收藏

通过级联AI分类器和彩色图表示的博物馆中基于RSSI的游客跟踪

RSSi-based visitor tracking in museums via cascaded AI classifiers and coloured graph representations

Elia Onofri, Alessandro Corbetta

摘要:

基于便携式无线电信标的博物馆参观者个人跟踪,是行为分析和舒适/性能改进的资产,正在日益普及。从概念上讲,这种方法能够基于小型天线网络进行房间级定位(因此,无需对现有结构进行侵入性修改)。天线测量由单独分配给访客的信标广播的自广告信号的强度(RSSI)。信号强度提供了到天线的距离的代理,从而指示定位。然而,众所周知,即使在理想条件下(高天线密度,没有障碍物,没有人群,......),RSSI信号也是嘈杂的。在这方面的贡献,我们提出了一种方法来执行准确的RSSI为基础的游客跟踪时,天线的密度相对较低,例如,由于历史建筑的技术限制。我们结合了一个合奏的“简单”定位器,训练的基础上地面的真相,与编码的博物馆拓扑结构的总彩色图。这就把定位问题变成了一个级联过程,从大到小,在空间和时间上。我们的用例是在罗马(意大利)的Galleria Borghese的访客跟踪,我们的方法管理>96%的定位准确度,大大提高了我们以前的工作(J. COMPUT. Sci. 101357,2021)。

英文摘要:

Individual tracking of museum visitors based on portable radio beacons, an asset for behavioural analyses and comfort/performance improvements, is seeing increasing diffusion. Conceptually, this approach enables room-level localisation based on a network of small antennas (thus, without invasive modification of the existent structures). The antennas measure the intensity (RSSi) of self-advertising signals broadcasted by beacons individually assigned to the visitors. The signal intensity provides a proxy for the distance to the antennas and thus indicative positioning. However, RSSi signals are well-known to be noisy, even in ideal conditions (high antenna density, absence of obstacles, absence of crowd, ...). In this contribution, we present a method to perform accurate RSSi-based visitor tracking when the density of antennas is relatively low, e.g. due to technical constraints imposed by historic buildings. We combine an ensemble of "simple" localisers, trained based on ground-truth, with an encoding of the museum topology in terms of a total-coloured graph. This turns the localisation problem into a cascade process, from large to small scales, in space and in time. Our use case is visitors tracking in Galleria Borghese, Rome (Italy), for which our method manages >96% localisation accuracy, significantly improving on our previous work (J. Comput. Sci. 101357, 2021).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑