Multiresolution Based Gaussian Mixture Model for Background Suppression
Bibliographic record
Abstract
This paper aims toward improving background suppression from video frames by incorporating multiresolution features in Gaussian mixture model (GMM). GMM has proven its place for background modeling due to its better applicability and robustness compared with other popular methods in literature. However, GMM fails in a number of situations such as noisy and non-stationary background, slow foregrounds, and illumination variation. Extensions to GMM have also been proposed to increase accuracy in expense of increased complexity, decrease in execution speed, and reduced applicability. In view of the above, this paper aims to provide a methodology to assimilate useful multiresolution features with GMM that considerably improves the performance. The contributions of this paper are: 1) a novel framework to incorporate wavelet subbands in GMM to improve its performance; 2) an approach to incorporate variable number of clusters in the aforesaid framework; and 3) a generic platform to use any multiresolution decomposition based GMM for background suppression. Extensive experimentations on several video sequences are performed to verify the improvement in accuracy compared with conventional GMM as well as a number of state-of-the-arts approaches. Along with qualitative and quantitative analysis, justification on the use of multiresolution is provided for clarification.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
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".