MétaCan
Menu
Back to cohort
Record W1967002662 · doi:10.1109/icassp.2010.5495963

Content-based audio copy detection using nearest-neighbor mapping

2010· article· en· W1967002662 on OpenAlex
Vishwa Gupta, Gilles Boulianne, Patrick Cardinal

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMusic and Audio Processing
Canadian institutionsComputer Research Institute of Montréal
Fundersnot available
KeywordsComputer scienceFrame (networking)Task (project management)Graphicsk-nearest neighbors algorithmGraphics processing unitArtificial intelligenceAudio signal processingSpeech recognitionPattern recognition (psychology)Speech codingAudio signalComputer graphics (images)Parallel computing

Abstract

fetched live from OpenAlex

We report results on audio copy detection for TRECVID 2008 copy detection task. This task involves searching for transformed audio queries in over 200 hours of test audio. The queries were transformed in seven different ways, three of them involved mixing unrelated speech to the original query, making it a much more difficult task. We give results with a few promising algorithms and show that mapping each test frame to the nearest query frame results in robust audio copy detection. The minimal normalized detection cost rate (NDCR) for even the worst case transformations is less than 0.03. The algorithm provides easy parallel processing on a graphics processing unit, leading to a very fast search.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.581
Threshold uncertainty score0.406

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.059
GPT teacher head0.251
Teacher spread0.192 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations15
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicMusic and Audio ProcessingFrench-language works237,207