A new method to reduce the noise of the miniaturised inertial sensors disposed in redundant linear configurations
Bibliographic record
Abstract
Abstract This paper presents a new adaptive algorithm for the statistical filtering of miniaturised inertial sensor noise. The algorithm uses the minimum variance method to perform a best estimate calculation of the accelerations or angular speeds on each of the three axes of an Inertial Measurement Unit (IMU) by using the information from some accelerometers and gyros arrays placed along the IMU axes. Also, the proposed algorithm allows the reduction of both components of the sensors’ noise (long term and short term) by using redundant linear configurations for the sensors dispositions. A numerical simulation is performed to illustrate how the algorithm works, using an accelerometer sensor model and a four-sensor array (unbiased and with different noise densities). Three cases of ideal input acceleration are considered: 1) a null signal; 2) a step signal with a no-null time step; and 3) a low frequency sinusoidal signal. To experimentally validate the proposed algorithm, some bench tests are performed. In this way, two sensors configurations are used: 1) one accelerometers array with four miniaturised sensors (n = 4); and 2) one accelerometers array with nine miniaturised sensors (n = 9). Each of the two configurations are tested for three cases of input accelerations: 0ms−1, 9·80655m/s2 and 9·80655m/s2.
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.001 | 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.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".