MétaCan
Menu
Back to cohort
Record W2030593867 · doi:10.1109/iscas.2014.6865699

Deployment of visual sensor networks using a graph-based approach

2014· article· en· W2030593867 on OpenAlex
Jose Luis Alarcon-Herrera, Xiang Chen

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotics and Sensor-Based Localization
Canadian institutionsUniversity of Windsor
FundersNatural Sciences and Engineering Research Council of CanadaConsejo Nacional de Ciencia y Tecnología
KeywordsSoftware deploymentComputer scienceGraphTask (project management)Wireless sensor networkRegular polygonVisualizationState spaceDistributed computingMathematical optimizationTheoretical computer scienceArtificial intelligenceMathematicsEngineeringComputer network

Abstract

fetched live from OpenAlex

We present a method for automatic deployment of visual sensor networks, based on a polygonal mesh model of the task. This method uses a graph-based approach to ensure an optimal level of visual overlap between the sensors. In this brief our method is further leveraged by increasing the size of the solution space, which in turn moves the solution closer to the optimal state. The increase in computational cost incurred by the extended solution space is handled by taking advantage of some occlusion properties of a convex partitioning of the task. Simulations are used to demonstrate the effectiveness of the approach.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.869
Threshold uncertainty score0.382

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.013
GPT teacher head0.216
Teacher spread0.203 · 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

Quick stats

Citations2
Published2014
Admission routes2
Has abstractyes

Explore more

Same topicRobotics and Sensor-Based LocalizationFrench-language works237,207