Data Fusion Algorithms for Multiple Inertial Measurement Units
Bibliographic record
Abstract
A single low cost inertial measurement unit (IMU) is often used in conjunction with GPS to increase the accuracy and improve the availability of the navigation solution for a pedestrian navigation system. This paper develops several fusion algorithms for using multiple IMUs to enhance performance. In particular, this research seeks to understand the benefits and detriments of each fusion method in the context of pedestrian navigation. Three fusion methods are proposed. First, all raw IMU measurements are mapped onto a common frame (i.e., a virtual frame) and processed in a typical combined GPS-IMU Kalman filter. Second, a large stacked filter is constructed of several IMUs. This filter construction allows for relative information between the IMUs to be used as updates. Third, a federated filter is used to process each IMU as a local filter. The output of each local filter is shared with a master filter, which in turn, shares information back with the local filters. The construction of each filter is discussed and improvements are made to the virtual IMU (VIMU) architecture, which is the most commonly used architecture in the literature. Since accuracy and availability are the most important characteristics of a pedestrian navigation system, the analysis of each filter's performance focuses on these two parameters. Data was collected in two environments, one where GPS signals are moderately attenuated and another where signals are severely attenuated. Accuracy is shown as a function of architecture and the number of IMUs used.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".