MétaCan
Menu
Back to cohort
Record W2135962321 · doi:10.1109/ccece.1993.332258

Object-oriented image sequence coding using the minimum description length principle

2002· article· en· W2135962321 on OpenAlexaff
Hai-Ying Zheng, Steven D. Blostein

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsMinimum description lengthCoding (social sciences)Computer scienceSegmentationArtificial intelligenceComputer visionMotion estimationObject (grammar)Image segmentationAlgorithmMathematicsStatistics

Abstract

fetched live from OpenAlex

It is evident that there are increasing demands for ultra-low bit-rate video image transmission. We present a new formulation of moving object segmentation and estimation for the purpose of object-oriented coding schemes. Motivated by the minimum description length (MDL) principle's unified treatment of data modelling and parameter estimation, a global optimal criterion is constructed in terms of the ideal coding length for each frame image. An optimization procedure to segment and estimate moving objects in a scene is proposed using a region-merging technique. Each object in the scene is represented by boundaries, motion parameters, and the motion-compensated prediction error. A number of experimental comparisons between block-oriented and object-oriented coding schemes are made to assess the coding gain using the new MDL-based method.>

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.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.084
GPT teacher head0.320
Teacher spread0.237 · 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 designSimulation or modeling
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

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207