MétaCan
Menu
Back to cohort
Record W2102440026 · doi:10.1109/lcn.2008.4664154

Reconstructing the Plenoptic function from wireless multimedia sensor networks

2008· article· en· W2102440026 on OpenAlexaff
Azzedine Boukerche, Jing Feng, Richard Werner, Yan Du, Ying Huang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceKey (lock)WirelessReal-time computingWireless sensor networkProtocol (science)Transmission (telecommunications)Image sensorChannel (broadcasting)Computer visionArtificial intelligenceComputer networkTelecommunications

Abstract

fetched live from OpenAlex

The development of low-cost image/video sensors has enabled wireless multimedia sensor networks (WMSN). Equipped with the ability to collect images/video streams from surrounding environments, many interesting applications will emerge through the use of WMSN. One of the key targets of a WMSN application is reconstructing the Plenoptic function by using collected images. However, due to the characteristics of wireless channels, this task is challenging. In this paper, a reliable transport protocol for WMSN is presented. This protocol utilizes JPEG stream semantics to distinguish the importance of different parts within the stream, and schedules the transmission based on the importance of the information. In order to investigate the performance of the proposed protocol, a novel image mosaicking algorithm is used as a sample WMSN application. The experimental results show that the proposed protocol and application can offer snapshots of the interested environment with larger field-of-view (FOV) and with little delay. The quality of the view can be improved gradually with the arrival of the data representing the higher frequency part of the images.

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.000
metaresearch head score (Gemma)0.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.000
Threshold uncertainty score0.002

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.001
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.021
GPT teacher head0.227
Teacher spread0.207 · 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

Citations6
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207