MétaCan
Menu
Back to cohort
Record W2133505688 · doi:10.3103/s1060992x11030088

Efficient ghost removal in motion detection with patch-corrected background differentiation

2011· article· en· W2133505688 on OpenAlex

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

VenueOptical Memory and Neural Networks · 2011
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image Processing Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsPixelArtificial intelligenceComputer scienceComputer visionFrame (networking)Frame rateSequence (biology)Noise reductionNoise (video)Motion detectionMotion (physics)Image (mathematics)Telecommunications

Abstract

fetched live from OpenAlex

An efficient ghost removal technique is proposed as an extension to adaptive background differentiation for motion detection. The pixels of the first frame in the sequence representing moving objects are replaced with the values taken for the same pixels from the memory bank where those pixels are identified as non-moving ones. The memory bank is built of the frames immediately following or, alternatively preceding, the initial frame of the analyzed sequence. This allows creating the initial background model with no moving pixels. Parameters optimization is conducted for specific case of traffic control system application. Experiments demonstrate that threshold reduction is beneficial to achieve completeness of the ghost removal. Additionally, a second improvement is introduced to reduce for the noise by non-stationary cameras which are shown to be efficiently compensated by a second derivative in the temporal differentiation when working with videos at a sufficiently high frame rate.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.977
Threshold uncertainty score0.462

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.019
GPT teacher head0.228
Teacher spread0.209 · 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