Novel Indoor Device-Free Human Tracking Using Learning Systems with Hidden Markov Models
Bibliographic record
Abstract
This paper proposes a novel indoor device-free localization and tracking approach using the received signal-strength indicators (RSSIs) of WiFi signals. The RSSI feature-vectors simulated by a channel-propagation emulator software are adopted as the training data for our proposed scheme. Prevalent discriminative machine-learning methods are used to predict the locations of a moving human-object. Hidden Markov models (HMMs) are also incorporated with such machine-learning techniques for robust and reliable indoor tracking. In this work, we partition the given indoor geometry into several equi-sized zones and then convert the underlying localization/tracking problem to the classical multi-classification problem. Simulation results demonstrate that the gradient boosting decision-tree (GBDT) classifier in conjunction with the Viterbi algorithm over hidden Markov models leads to the highest localization-accuracies of 83.9% for eight zones and 71.4% for sixteen zones. As a result, our proposed new indoor localization and tracking scheme can be very promising for many indoor device-free surveillance applications in the future.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".