Parameter Optimization for Partitioning Algorithms in Object Detection
Bibliographic record
Abstract
Fast object detection is essential for safety-critical applications. Effective partitioning of video frames captured by cameras acting as sensors can enhance the performance of object or target detection in a parallel processing system, ensuring that no node becomes a bottleneck. More specifically, algorithms that utilize frame-specific information, such as entropy, to estimate the workload of frames and then partition them accordingly perform better than those that partition frames randomly. The objective of this paper is to optimize partitioning algorithms for big data applications to achieve the best performance. Parameters, such as neighborhood size for Entropy-Based partitioning, are determined experimentally to minimize overheads while ensuring accurate workload estimation. A novel hybrid partitioning algorithm is proposed to enhance the performance of previously proposed frame-specific partitioning algorithms. Workload of the frames are estimated using object detection models. To identify the most effective object detection model, pretrained models such as You Only Look Once (YOLO) and Vision Transformer (ViT) are deployed within the Apache Spark parallel processing framework and the model with the best processing time and accuracy is chosen for workload estimation. To demonstrate the robustness of the proposed techniques, the partitioning and frame removal algorithms are evaluated under noisy frame conditions and in a Graphics Processing Unit-accelerated environment. The proposed partitioning and frame removal algorithms performed well in noisy frame conditions where workload estimation was more difficult and achieved approximately 50 % better performance when a GPU was utilized.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".