Enhanced Multiple DBSCAN Algorithm for Traffic Detection Using mmWave Radar
Bibliographic record
Abstract
The ability to robustly and effectively detect and classify road objects is vital to an all-purpose traffic monitoring system. Recent development in mmWave radar technologies offers improved range and resolution at an affordable price, making it an ideal candidate for Intelligent Transportation System (ITS) applications. Modern mmWave radars output 3D detection point clouds representing moving objects. The Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm is a popular method for clustering radar point clouds. However, our study found that several variations of DBSCAN perform less than expected in a road and intersection scene. To address this, we propose an Enhanced Multiple DBSCAN algorithm tailored specifically for traffic monitoring applications, which aims to improve detection performance using radar point cloud data. By using adaptive parameters, the Enhanced Multiple DBSCAN algorithm addresses the problem of reducing cluster size over distance. Additionally, a modified Non-Maximum Suppression (NMS) variation is included to address missed detections when merging results from multiple DBSCANs. Our Enhanced Multiple DBSCAN achieves over 90% precision in detecting road objects, the best result among all tested methods. The algorithms proposed and evaluated in this study provide a valuable reference for modern radar ITS applications.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".