MétaCan
Menu
Back to cohort
Record W2152950896 · doi:10.1109/icip.1995.537465

Region-adaptive transform based on a stochastic model

2002· article· en· W2152950896 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

VenueProceedings - International Conference on Image Processing · 2002
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsInstitut National de la Recherche Scientifique
Fundersnot available
KeywordsDiscrete cosine transformMarkov chainComputer scienceCovarianceAlgorithmMarkov processSeparable spaceBasis (linear algebra)Boundary (topology)MathematicsImage (mathematics)Mathematical optimizationArtificial intelligenceApplied mathematicsMathematical analysisStatisticsMachine learningGeometry

Abstract

fetched live from OpenAlex

This paper is concerned with linear transforms for arbitrarily-shaped image segments. In contrast to other techniques described in the literature, the proposed transform is based upon a stochastic model of image covariance within the considered region. Emerging from a separable stationary Markov model proposed for rectangular regions, we derive a non-stationary Markov model with natural boundary conditions. We compute its eigentransform, which is the optimum linear transform under a broad variety of performance measures. For the special case of a rectangular region, the method yields the DCT basis functions. Simulation results for natural imagery are provided.

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), Scholarly communication
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.956
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.000
Science and technology studies0.0000.000
Scholarly communication0.0010.002
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.088
GPT teacher head0.309
Teacher spread0.221 · 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