Passive Indoor Visible Light Positioning System Using Deep Learning
Bibliographic record
Abstract
A passive indoor visible light positioning system is proposed that does not require active participation from the user and is suitable for IoT sensor networks. This approach does not require a line-of-sight path and measures the impulse response (IR) between sources and receivers installed in the room. The presence of an object of interest (OI), i.e., a person to be localized, disrupts the IRs among the source–receiver pairs, which can be related to its position. A deep learning framework is developed that learns the relationship between changes in sets of IRs and the OI position through a set of training data obtained by placing the OI at random locations in the room. This approach shows that the OI can be localized using a very limited set of training data under a wide range of illumination levels. In order to represent a realistic scenario, a room with furniture is modeled in the optical system design software. The ray trace information of the modeled room is used to construct IR measurements among different source–receiver pairs that include multiorder reflections. The results show that localization performance is crucially related to the signal-to-noise ratio and the number of training data points used in the learning process. A root-mean-square error (RMSE) near 30 cm is possible in the case of high SNR and a large training set. However, even with a very limited training set and over a range of dimming levels, RMSEs of near 80 cm were obtained without the need for explicit user involvement.
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.000 |
| 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".