MétaCan
Menu
Back to cohort
Record W4398174344 · doi:10.1109/dcc58796.2024.00064

Quantization of Content-adaptive Orthonormal Transforms using a Gauss-Markov Random Field Model for Images

2024· article· en· W4398174344 on OpenAlexaff
Rashmi Boragolla, Pradeepa Yahampath

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsCodebookLinde–Buzo–Gray algorithmVector quantizationAlgorithmTransform codingMathematicsComputer scienceOrthonormal basisS transformDiscrete cosine transformArtificial intelligenceWavelet transformImage (mathematics)Discrete wavelet transform

Abstract

fetched live from OpenAlex

Forward adaptive transform coding requires a codebook of transform matrices from which the best transform can be chosen for each macroblock in an image. Codebook construction involves designing a vector quantizer for a sample set of KarhunenLoeve transform (KLT) matrices. While several approaches to designing such matrix codebooks have been proposed in previous work [1] , [2] , these non-parametric methods carry out matrix quantization in very high dimensional spaces which can suffer from the curse of dimensionality. Furthermore, the resulting transform matrices are not scalable - if multiple transform block sizes are to be used, such as in video compression, a separate matrix codebook must be designed for each block size.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.000
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.072
GPT teacher head0.327
Teacher spread0.255 · 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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207