Real-Time Contactless Eye Blink Detection Using UWB Radar
Bibliographic record
Abstract
Blink detection is essential for various human-computer interaction scenarios, such as virtual reality and driving state detection. It has gained significant attention from industry and academia alike in recent years. Existing non-contact detection systems (cameras, acoustics, etc.) have made significant progress, but various issues have prevented their widespread adoption, including privacy concerns, line-of-sight requirements, and cost issues. Therefore, there is a critical need for a simple and robust system that can detect eye blinks using common commercial equipment. In this paper, we propose BlinkRadar, which uses a low-cost customized impulse-radio ultra- wideband (IR-UWB) radar for non-contact and fine-grained blink detection. BlinkRadar can reliably detect driver blinks in driving conditions, making it possible to infer drowsy driving. To effectively extract the eye blink signal, we analyzed real experimental data to study the characteristics of the eye blink pattern and successfully used the multi-sequence variational mode decomposition (MS-VMD) algorithm to separate the blink signal from the noise signal. We conducted extensive experiments in two different environments (a quiet room and moving vehicles) and found that BlinkRadar had an average blink detection accuracy of over 96.2%. Our results demonstrate the feasibility of using UWB radar for non-contact eye blink detection.
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.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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".