MétaCan
Menu
Back to cohort
Record W2144496206 · doi:10.1109/ccece.1993.332208

An improved 2D interpolation scheme using FFT

2002· article· en· W2144496206 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
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsInterpolation (computer graphics)Fast Fourier transformComputer scienceSampling (signal processing)Window (computing)Scheme (mathematics)SIGNAL (programming language)AlgorithmImage (mathematics)Signal processingDiscrete Fourier transform (general)Sample (material)Artificial intelligenceComputer visionDigital signal processingMathematicsFourier transformFourier analysisComputer hardware

Abstract

fetched live from OpenAlex

In many in digital signal processing systems, it is required to change the sampling rate of a digital signal. The interpolation of an image provides an approach to first sample an image at a low rate for transmission or storage, and then increase the sampling rate later. In this paper, a pre-transform is introduced into the 2D interpolation scheme through a DFT. This pre-transform takes advantage of the periodicity of the DFT. Example images show this technique to be superior to the window technique, and the improvement is remarkable.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.996
Threshold uncertainty score0.323

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.002
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.074
GPT teacher head0.303
Teacher spread0.229 · 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
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207