An Energy-Efficient Vehicle Detection Algorithm for a Complex Urban Traffic Environment
Bibliographic record
Abstract
Magnetometer-based sensors have been proven to be an effective method for vehicle detection in intelligent traffic systems (ITS). Many algorithms have been proposed to improve the performance of magnetometer-based traffic sensing. However, few studies consider the effectiveness of these algorithms in context with a high-density traffic flow, which is typical in urban areas of developing countries such as China. In addition, the energy-efficiency of the existing algorithms has been largely ignored, hence limiting the application of the battery-powered sensor network in practice. Considering both high-density traffic flow and energy-efficiency, this paper presents a real-time vehicle detection algorithm using magnetometers. The proposed algorithm first assesses the data after the noise removal, and extracts a set of magnetic features from these data. The extracted features are then fed into a finite state machine with self-adaptive parameters. The proposed algorithm has been implemented in an embedded processor manufactured by Texas Instruments, and a wireless sensor network carrying sensor nodes running our proposed algorithms is deployed as the test bed in several major roads inside and outside the Huazhong University of Science and Technology campus. Tested by 6 traffic flow datasets collected during rush-hour, the results show that our algorithm can achieve 91% or above detection accuracy under complex urban traffic environment.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 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".