MétaCan
Menu
Back to cohort
Record W2109698133 · doi:10.1109/pcs.2012.6213322

Prediction with Partial Match using two-dimensional approximate contexts

2012· article· en· W2109698133 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAlgorithms and Data Compression
Canadian institutionsWestern University
Fundersnot available
KeywordsPixelRaster graphicsLossless compressionContext (archaeology)Raster scanComputer scienceArtificial intelligenceComputer visionData compressionSequence (biology)Raster dataCompression (physics)AlgorithmPhysicsGeography

Abstract

fetched live from OpenAlex

The Prediction with Partial Match (PPM) is a context-based lossless compression scheme developed in the mid 80's. Originally it was targeted towards compressing text that can be viewed as a one-dimensional sequence of symbols. When compressing digital images, PPM usually breaks the two-dimensional data into a one-dimensional raster scan form. This paper extends PPM in order to take full advantage of the two-dimensional nature of digital images. Unlike the traditional two-dimensional raster scan contexts (i.e. concerning upper pixels and pixels to the left), the proposed context is determined using pixels from all directions, including pixels to the right and the lower pixels. Results show that this type of context yields a significant improvement over the traditional raster scan context.

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: Methods · Consensus signal: none
Teacher disagreement score0.938
Threshold uncertainty score0.270

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.001
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.030
GPT teacher head0.260
Teacher spread0.230 · 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

Quick stats

Citations0
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicAlgorithms and Data CompressionFrench-language works237,207