Online Dynamic Window (ODW) Assisted 2-Stage LSTM Indoor Localization for Smart Phones
Bibliographic record
Abstract
There has been a recent surge of interest on smart phone-based indoor localization due to the urgent need for real-time, accurate, and scalable indoor positioning solutions independent of any proprietary sensors/modules. Existing Inertial Measurement Unit (IMU)-based approaches, typically, use statistical and error prone heading and step length estimation techniques rendering them impractical for robust, real-time and accurate indoor positioning. In this regard, the paper takes one step forward to transfer offline IMU-based models to online positioning frameworks. More specifically, inspired by prominent advances in sequential Signal Processing (SP) and Natural Language Processing (NLP) techniques, two near real-time dynamic windowing mechanisms are proposed based on a two stage Long Short-Term Memory (LSTM) localization architecture. The two underlying LSTM architectures are trained with 2100 Action Units (AU). Compared to the traditional LSTM-based positioning approaches suffering from either high tensor computation requirements or low accuracy preventing them for real-time deployment, the proposed Online Dynamic Windowing (ODW) assisted two stage LSTM models can perform localization in a real-time fashion. Performance evaluations based on a real Pedestrian Dead Reckoning (PDR) dataset shows that the proposed model can achieve exceptional classification accuracy of 97.9% and 95.5% for the two underlying LSTMs.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".