Siamese Temporal Convolutional Networks for Driver Identification Using Driver Steering Behavior Analysis
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Driver identification has shown sustainable development in recent years in a wide variety of applications including but not limited to security, personalization, fleet management, insurance telematics, or ride-hailing. However, the current progress suffers from several challenges such as costly data collections and the need for a huge amount of data from each individual for both driver identification and impostor detection. Therefore, more novel and efficient solutions are required to mitigate the existing challenges. In this paper, we address driver identification and impostor detection tasks using driving behavior analysis of the drivers. We design a deep learning-based system architecture that analyzes windows of 30 seconds of driving data to capture the unique underlying characteristics of the individuals steering behavior based on which it further distinguishes the drivers. We also develop a novel strategy to tackle driver verification and impostor detection tasks based on the combination of the proposed system architecture and Siamese networks concepts. We map the steering behavior of the drivers into latent representations which can be later used to train a similarity function. The performance of the proposed systems is tested over a real-world dataset of 95 drivers. The evaluation results indicate that our system outperforms well-established benchmarks and baseline methodologies.
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.
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.001 | 0.001 |
| Science and technology studies | 0.001 | 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 it