Modified Ant Colony Optimization for Human Recognition in Videos of Low Resolution
Bibliographic record
Abstract
Privacy protections for people filmed in public settings is a prerequisite to widespread camera use. For this reason, low-resolution videos are used from which specific people can be reliably obscured. Since the human region in low-resolution videos comprises of so few pixels and so little information, human detection is more challenging there than it is in high-resolution videos. With the current state of affairs, one of the most important challenges is tracking a target from lower resolution movies. Identification or monitoring of persons in low-resolution movies has become a common issue in many domains due to a lack of appropriate data. This study presents a novel people-detection algorithm that makes use of low-resolution film to overcome the aforementioned problem. In the first stage, a three-step procedure is executed, the video data gathered from low-resolution videos from various form of data is considered. The captured video is separated into frames and transformed from RGB to gray-scale. Local Binary Pattern (LBP) method is used in the second phase to accomplish background subtraction. Thirdly the feature extraction is performed in which histogram of optical flow (HOF)and some of the features are extracted in the form of eigen values. Finally these features are optimized using Modified Ant Colony Optimization (MACO) model to remove the unwanted features and select global features. Finally, classification operation is performed using Support Vector Machine (SVM) classifier to recognize the person from lower resolution videos. The results obtained using the implemented MACO-SVM obtains good results when compared with existing techniques with rate of accuracy 91.46% for soccer dataset, 90.8% for KTH dataset and 89.75% accuracy using VIRAT dataset.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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".