MétaCan
Menu
Back to cohort
Record W2059252790 · doi:10.1142/s0219691303000268

NOISY SIGNAL COMPRESSION BY WAVELET TRANSFORM WITH OPTIMAL DOWNSAMPLING

2003· article· en· W2059252790 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

VenueInternational Journal of Wavelets Multiresolution and Information Processing · 2003
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsMcMaster University
Fundersnot available
KeywordsUpsamplingWaveletDiscrete wavelet transformWavelet transformAlgorithmWavelet packet decompositionSecond-generation wavelet transformQuantization (signal processing)ThresholdingMathematicsStationary wavelet transformComputer scienceArtificial intelligencePattern recognition (psychology)

Abstract

fetched live from OpenAlex

This paper presents a wavelet transform (WT) based on simultaneous de-noising and compression scheme for noisy signal. Due to the downsampling in decomposition process, the orthogonal wavelet transform (OWT) is translation variant, which significantly hinders its performance in coding and denoising. In this paper the wavelet bintree decomposition (WBD), which is equivalent to a translation invariant WT, is first formed and an optimal downsampling route is then traversed among all the routes of the bintree. The WT with the optimal route would most effectively decorrelate and compactly represent the signal. During the process of noisy signal encoding, wavelet thresholding based denoising is performed. Thresholding is similar to the quantization of a zero-zone in lossy encoding procedure. We applied a signal-adaptive threshold to the wavelet coefficients and quantized the coefficients outside the zero-zone. Experiments show that the proposed scheme significantly outperforms the OWT-based method.

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.001
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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.979
Threshold uncertainty score0.594

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.008
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.010
GPT teacher head0.259
Teacher spread0.249 · 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