Object Detection Using Efficient Partitioning and Frame Reduction
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.
Bibliographic record
Abstract
Rapid object detection is crucial for safety-critical applications, such as post-event analysis of surveillance videos in crime investigations and the operation of autonomous vehicles. The objective of this paper is to improve the speed of object detection through efficient partitioning and frame reduction using parallel processing. Techniques to improve Spark's default partitioning by using entropy-based algorithms to create more evenly distributed partitions based on the estimated workload of the frames are considered. Redundant frames are removed to efficiently reduce the workload. Algorithms for removing redundant frames are introduced and evaluated for their effectiveness in comparison to random and fixed frame removals. The results from this paper demonstrate that partitioning algorithms that estimate workload using entropy provide faster processing time when compared to those that use random partitioning. The results also indicate that frame removal algorithms that use frame-specific information, like entropy difference between frames, further improve performance without notably reducing detection accuracy when compared to those that do not utilize frame-specific information.
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 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 it