Iteration Bayesian Reweighed Algorithm for Optical Carrier-Based Microwave Interferometry Sensing
Bibliographic record
Abstract
This paper proposes a novel iteration Bayesian reweighed (IBR) algorithm to obtain accurate estimates of a measurement parameter that uses only a few noisy measurement data. The method is applied to optimize the frequency fluctuation in an optical carrier-based microwave interferometry (OCMI) system. The algorithm iteratively estimates the frequency of the S-parameter valley point by collecting training samples to rebalance the weights between prior samples, which reduces the impact of noise in the system. Simulation shows that the estimated result of this algorithm is closer to the true value than that of the maximum likelihood estimation (MLE) using the same amount of measured data. Under the influence of system noise, this algorithm optimizes the frequency fluctuation of the S-parameter and reduces the impact of individual measured data. In this study, we applied the algorithm in the strain sensing experiment and compared it with the MLE. When axial strain changes 240 με, the IBR algorithm yields a deviation of 36 με, which is a significant reduction from 138 με (using the MLE method). Moreover, the average error rate decreases from 25% to 3% (with the MLE method), suggesting that the linear fitting degree of the estimated results and accuracy of the system are improved. Moreover, the algorithm has a wide range of applicability, for it can handle different application models in the OCMI system and the systems with frequency fluctuation problems.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".