MétaCan
Menu
Back to cohort
Record W2099556803 · doi:10.1109/icip.1998.723469

Arithmetic coding of a lossless contour based representation of label images

2002· article· en· W2099556803 on OpenAlexaff
Lilian Labelle, Daniel Lauzon, Janusz Konrad, Éric Dubois

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDigital Image Processing Techniques
Canadian institutionsInstitut National de la Recherche Scientifique
Fundersnot available
KeywordsChain codeLossless compressionArithmetic codingComputer scienceLossy compressionArtificial intelligenceComputer visionEncoderENCODECoding (social sciences)Topology (electrical circuits)Data compressionAlgorithmMathematicsContext-adaptive binary arithmetic codingImage (mathematics)

Abstract

fetched live from OpenAlex

We propose a new method for the encoding of label images (also known as segmentation maps or alpha planes) that are often used to identify object location in region-based image and video coders. The method is contour-based and lossless with a contour model composed of two parts: a contour graph describing the topology of the contour network and a directional chain code to deal with the geometric part of the label image (internal contour points). The graph-based description of the topology is designed to minimize the cost of encoding the nodes, while the directional chain codes are compressed by arithmetic coding. The approach is flexible since separating the contour network into topological and geometrical parts allows the use of other lossless or lossy methods to encode the geometric part without changing the graph representation. The proposed method has been compared with an arithmetic encoder used in MPEG-4.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.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.054
GPT teacher head0.301
Teacher spread0.248 · 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

Citations14
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDigital Image Processing TechniquesFrench-language works237,207