An ICA Mixture Hidden Markov Model for Video Content Analysis
Bibliographic record
Abstract
In this paper, a new theoretical framework based on hidden Markov model (HMM) and independent component analysis (ICA) mixture model is presented for content analysis of video, namely ICAMHMM. Unlike the Gaussian mixture observation model commonly used in conventional HMM applications, the observations in the new ICAMHMM are modeled as a mixture of non-Gaussian components. Each non-Gaussian component is formulated by an ICA mixture, reflecting the independence of different components across video frames. In addition, to construct a compact feature space to represent a video frame, ICA is applied on video frames and the ICA coefficients are used to form a compact 2-D feature subspace that makes the subsequent modeling computationally efficient. The model parameters can be identified using supervised learning by the training sequences. The new re-estimation learning formulae of iterative ICAMHMM parameter estimation are derived based on a maximum likelihood function. Employing the identified model, maximum likelihood algorithms are developed to detect and recognize video events. As a case study, golf video sequences are used to test the effectiveness of the proposed algorithm. Experimental results show that the presented method can effectively detect and recognize the recurrent event patterns in video data. The presented new ICAMHMM is generic and can be applied to sequential data analysis in other applications.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".