WiFi-Aided Magnetic Matching for Indoor Navigation with Consumer Portable Devices
Bibliographic record
Abstract
This paper presents a WiFi-aided magnetic matching (MM) algorithm for indoor pedestrian navigation with consumer portable devices. This algorithm reduces both the mismatching rate (i.e., the rate of matching to an incorrect point that is more than 20 m away from the true value) and computational load of MM by using WiFi positioning solutions to limit the MM search space. Walking tests with Samsung Galaxy S3 and S4 smartphones in two different indoor environments (i.e., Environment #1 with abundant WiFi APs and significant magnetic features, and Environment #2 with less WiFi and magnetic information) were conducted to evaluate the proposed algorithm. It was found that WiFi fingerprinting accuracy is related to the signal distributions. MM provided results with small fluctuations but had a significant mismatch rate; when aided by WiFi, MM’s robustness was significantly improved. The outcome of this research indicates that WiFi and MM have complementary characteristics as the former is a point-by-point matching approach and the latter is based on profile-matching. Furthermore, performance improvement through integrating WiFi and MM depends on the environment (e.g., the signal distributions of magnetic intensity and WiFi RSS): In Environment #1 tests, WiFi-aided MM and WiFi provided similar results; in Environment #2 tests, the former was approximately 41.6% better. Our results supported that the WiFi-aided MM algorithm provided more reliable solutions than both WiFi and MM in the areas that have poor WiFi signal distribution or indistinctive magnetic-gradient features.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".