MétaCan
Menu
Back to cohort
Record W2064064554 · doi:10.1109/mwc.2012.6339474

Cooperative target tracking in vehicular sensor networks

2012· article· en· W2064064554 on OpenAlexaff
Heitor S. Ramos, Azzedine Boukerche, Richard W. Pazzi, Alejandro C. Frery, Antônio A. F. Loureiro

Bibliographic record

VenueIEEE Wireless Communications · 2012
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceVariety (cybernetics)Vehicular ad hoc networkWireless sensor networkKey (lock)Wireless ad hoc networkCollision avoidanceVehicle tracking systemTracking (education)WirelessVideo trackingDistributed computingReal-time computingComputer networkArtificial intelligenceCollisionComputer securityTelecommunicationsKalman filter

Abstract

fetched live from OpenAlex

Target tracking plays a key role for vehicular ad hoc networks (VANETs) due to the fact that a wide variety of envisioned applications rely on the ability of this technique of detecting, localizing, and tracking objects surrounding a vehicle. This subject has been studied in fields such as airborne traffic, computer vision, and wireless sensor networks. A VANET brings out new challenges that should be addressed. For instance, the cluttered and dense scenarios, communication issues such as short term links, and the variety of objects considered to be targets, are some of the new ingredients to be taken into account. Applications such as collision warning/avoidance systems require strict time constrains, while others impose only mild restrictions. This complex and heterogeneous environment is discussed in this work, where we didactically divide the main problems into four components: the targets’ motion model, measurement models, data association problem, and filtering. We also discuss the communication issues and how they affect these systems.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.038
GPT teacher head0.291
Teacher spread0.253 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations39
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Wireless CommunicationsSame topicTarget Tracking and Data Fusion in Sensor NetworksFrench-language works237,207