MétaCan
Menu
Back to cohort
Record W2118249782 · doi:10.1109/isspit.2006.270905

A New Efficient Context-Based Relative-Directional Chain Coding

2006· article· en· W2118249782 on OpenAlexaff
Lele Zhou, Saif Zahir

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsUniversity of Northern British Columbia
Fundersnot available
KeywordsCoding (social sciences)Context-adaptive binary arithmetic codingVariable-length codeComputer scienceShannon–Fano codingArithmetic codingCoding tree unitTunstall codingContext-adaptive variable-length codingDifferential codingChain codeENCODESub-band codingAlgorithmTheoretical computer scienceDecoding methodsArtificial intelligenceMathematicsData compressionImage (mathematics)Statistics

Abstract

fetched live from OpenAlex

Chain coding is widely used in a variety of image processing applications. In this paper, we present a new chain coding scheme: context-based relative-directional chain coding (CRCC). It applies a novel context modeling with adaptive arithmetic coding to encode contour images. The proposed context modeling is based on the relative-directional chain representation. It provides a favorable conditional probability for the next encoding pixel so that the arithmetic coding is efficiently performed. The experimental results shows that the CRCC coding scheme overall outperforms the chain coding (CC), differential chain coding (DCC) and Differential chain coding mode-8 (DCC-8). More importantly, the proposed CRCC coding scheme completely avoids the cost in computation of eight-directional chain codes and its associated sequence of differences

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 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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.809
Threshold uncertainty score0.376

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.013
GPT teacher head0.259
Teacher spread0.245 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations8
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Image and Video Retrieval TechniquesFrench-language works237,207