Adaptive Network Configuration for Efficient and Accurate Neural Video Inference
Bibliographic record
Abstract
Cameras are widely used in many fields, e.g., intelligent transportation, autonomous driving, surveillance, etc. It is thus vital to conduct video analytics in an efficient and accurate manner. However, camera’s built-in capacity is insufficient to support neural network processing, while offloading video streams incurs prohibitive latency and communication cost. In this paper, we find that frame rate, resolution, and neural network inference model, have an intertwined impact on network resource demand. The optimal configuration of these factors also varies with video content feature. To address these challenges, we propose a dynamic configuration update scheme based on predictive video perception using a long short-term memory (LSTM) neural network, to adapt configuration to content changes. This scheme consists of a change detector and a configuration profiler. Through theoretical modeling and analysis, we derive the detection thresholds for both dynamic and stationary video contents, considering the LSTM prediction error. The configuration profiler then updates system by solving an optimization problem, which maximizes the overall utility considering analytics accuracy and resource consumption. Extensive real-world traces-based experiments show that the proposed scheme can save profiling resources by up to 95% while ensuring high accuracy compared with other benchmarks.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".