MétaCan
Menu
Back to cohort
Record W2118788844 · doi:10.1109/83.855428

A perceptually lossless, model-based, texture compression technique

2000· article· en· W2118788844 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

VenueIEEE Transactions on Image Processing · 2000
Typearticle
Languageen
FieldComputer Science
TopicComputer Graphics and Visualization Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLossless compressionArtificial intelligenceComputer scienceComputer visionPattern recognition (psychology)Data compressionTexture compressionWaveletImage compressionTexture synthesisBinary codeTexture filteringBinary numberImage textureBinary imageWavelet transformMathematicsImage processingImage (mathematics)

Abstract

fetched live from OpenAlex

In natural scenes, still images as well as sequences, backgrounds, and objects' surfaces usually have a textural structure. Therefore, in order to efficiently code images it is crucial to investigate the texture compression problem. In this paper, a perceptually lossless, synthesis-by-analysis texture coding method is presented. The proposed approach is model based; the parameters of the model consist of a binary excitation signal and the parsimonious representation of the reconstruction filter. The estimated parameters, which allow to one synthesize, at the decoder site, a texture that is perceptually indistinguishable from the original one, are then compressed using a lossless strategy, which is based on a fast binary wavelet transformation specifically tailored to binary images. The proposed method leads to very good perceptual results superior to those of existing techniques.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.962
Threshold uncertainty score1.000

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.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.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.015
GPT teacher head0.283
Teacher spread0.268 · 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