Video Copy Detection Using Temporally Informative Representative Images
Bibliographic record
Abstract
Content-based video hashing was introduced recently to serve the purpose of video copy detection. A conventional approach to video hashing is to apply image hashing techniques to either every frame or to the selected key frames of a video sequence. Both approaches ignore the temporal information contained in a video sequence. This study proposes an approach for generating representative images of a video sequence that carry the temporal as well as the spatial information. These images are denoted as TIRIs, Temporally Informative Representative Images. Performance of the proposed approach is demonstrated by applying a simple image hashing technique on TIRIs of a video database. It is shown that the resulted video hashing algorithm is highly robust to noise, frame dropping, changes in brightness and contrast, as well as a range of geometric attacks. An average true positive rate of 99.2% and false positive rate of 0.4% of the proposed approach demonstrate the robustness and uniqueness of the generated hashes. It is demonstrated that the proposed approach is easy to implement and computationally more efficient than another state-of-the-art video hashing method.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".