STC: Spatial and Temporal Clustering for Cooperative Perception System
Bibliographic record
Abstract
Transportation safety is a very important concern for many decision-makers. Not only does it aim at preventing vehicle accidents, but also saves the lives of individuals who may be distracted while crossing the streets. Various traffic conditions can hinder the visibility of pedestrians and other vehicles when only relying on the local sensors attached to these AVs. Therefore, Cooperative Perception (CP) among Connected Autonomous Vehicles (CAV) is suggested to overcome this problem by utilizing inter-vehicle communication. However, communication network limitations, including limited bandwidth, packet loss, operator compatibilities, or even lack of coverage, can significantly impede the performance of these cooperative perception solutions. To this end, we propose a spatial safety-aware clustering algorithm. This algorithm clusters the perceived objects across AVs. This effective idea allows a decrease in communication payload by approximately 20% and efficiently increases the information reception over an infrastructure-less Vehicle-to-Vehicle (V2V) network by 10% compared to ETSI. Furthermore, we suggest integration of the spatial clustering algorithm with existing baselines, showing improvements of up to 18% for road object perception. Lastly, we propose a Spatial and Temporal Clustering (STC) approach that performs a clustering for information sent over the time domain in addition to the spatial clustering. This further decreases the payload by 41% and increases the perception up to 37% while showing more than a 12X increase in the reception of safety-relevant information compared to ETSI.
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 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.000 | 0.000 |
| Science and technology studies | 0.000 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".