CRIM's content-based copy detection system for TRECVID
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Approach we have tested in our submitted runs: For visualbased copy detection, we find links between video shot key-frames using a probabilistic latent space model over local matches between the keyframe images. This facilitates the extraction of significant groups of local matching descriptors that may represent common semantic elements of near duplicate key-frames. For 2009, we have worked on an optimal representation of the test database. We first select the discriminant local descriptors. Then, we quantize the selected local descriptors into a hierarchical structure. For audio based copy detection, we give results with two different feature parameters: 15-bit energy difference parameters similar to [1] and a feature-based mapping of test frames to query frames. Differences we found among the runs: We submitted 1 run for the video only copy detection task (same run for Balanced and for nofa). Four runs were submitted for the ”audio only” copy detection task : • CRIM.a.NOFA.EnNN2pass: energy-diff parameter search rescored with nearest-neighbor mapping. • CRIM.a.NOFA.NN22para: search using nearest-neighbor mapping. • CRIM.a.BALANCED.EnNN2pass: lower threshold than for NOFA case. • CRIM.a.BALANCED.EnNN22wt15: fuse Energy-diff parameters search (wt 15) with nearest-neighbor mapping search. We fused the video submission from CRIM with each of the four audio only submissions to get four different submissions for audio+video copy detection task. The threshold was adjusted based on the results of 2008 a+v queries. Relative contribution of each component of our approach: For visual-based copy detection, the probabilistic latent space model over local matches between the key-frame images produces a robust and accurate filtering process in relation to all possible local matches. It works well even if there are only a few local matches between the key-frames of the copied video in question. We have introduced a new method for SIFT quantizing. It improves the time computation performance while keeping a good precision for SIFT representation. For audio only copy detection, the fingerprints obtained by mapping each test frame to the nearest query frame (NN-based fingerprints) reduced minimal NDCR by half over that obtained with energy-difference based fingerprints. This work was supported in part by the Natural Science and Engineering Research Council of Canada (NSERC) What we learned about runs/approaches and the research question(s) that motivated them : Approaches based on local descriptor matching are efficient for video copy detection but very time consuming. Our method is more adapted when there is very little common visual information to establish a link between two key-frames. Video copy detection may not need such a good precision. For audio copy detection, mapping each test frame to the nearest query frame (NN-mapping) results in robust audio copy detection. The minimal normalized detection cost rate (NDCR) for even the worst case transformations is less than 0.03 for 2008 queries, and less than 0.075 for 2009 queries. The algorithm provides easy parallel processing on a graphics processing unit, leading to a very fast search.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle