MétaCan
Menu
Back to cohort
Record W2112686133 · doi:10.1109/tcsvt.2009.2017304

Places Clustering of Full-Length Film Key-Frames Using Latent Aspect Modeling Over SIFT Matches

2009· article· en· W2112686133 on OpenAlexaff
Maguelonne Héritier, L. Gagnon, Samuel Foucher

Bibliographic record

VenueIEEE Transactions on Circuits and Systems for Video Technology · 2009
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsComputer Research Institute of Montréal
Fundersnot available
KeywordsKey (lock)Cluster analysisComputer scienceKey frameArtificial intelligencePattern recognition (psychology)Probabilistic latent semantic analysisScale-invariant feature transformConstant false alarm rateMatching (statistics)Probabilistic logicSet (abstract data type)Feature extractionComputer visionData miningMathematicsFrame (networking)Statistics

Abstract

fetched live from OpenAlex

An improved unsupervised classification method to extract and link places features and cluster recurrent physical locations (key-places) within a movie is presented. Our approach finds links between key frames of a common key-place based on the use of a probabilistic latent space model over the possible local matches between the key frames image set. This allows the extraction of significant groups of local matching descriptors that may represent characteristic elements of a key-place. An exhaustive evaluation of our approach was conducted on in-house and public image datasets, as well as on full-length movies. Results revealed that our method is very efficient for near-duplicate object/background detection with weak overlap. Performance measurements on full-length movies indicate a recognition rate of about 75% on the key-places clustering with a false alarm rate (FAR) of approximately 2%.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.007
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

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

Opus teacher head0.036
GPT teacher head0.285
Teacher spread0.249 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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

Quick stats

Citations9
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Circuits and Systems for Video TechnologySame topicAdvanced Image and Video Retrieval TechniquesFrench-language works237,207