MétaCan
Menu
Back to cohort
Record W2130945075 · doi:10.1109/ccece.2000.849744

Optimum sampling frequency in wavelet based signal compression

2002· article· en· W2130945075 on OpenAlexaff
R.L. Kirlin, R.M. Dizaji

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsWaveletComputer scienceWavelet packet decompositionWavelet transformDiscrete wavelet transformAlgorithmSIGNAL (programming language)Filter bankMathematicsFilter (signal processing)Artificial intelligenceComputer vision

Abstract

fetched live from OpenAlex

Wavelets are recognized to be an efficient tool for signal compression. They can be matched to different parts of a signal so that only a few wavelet tree nodes can carry most of the signal energy. Restrictions to a maximum level (number of down samplings and therefore analysis bands) arise because computational complexity is increased or only a finite data record is available. Further, a non-adaptive wavelet transform does not allow optimal matching between signal and wavelet filter bank and for best basis wavelet as adaptive procedure, we cannot merge adjacent terminal nodes when they come from different parents. We reduce these restrictions and combine several potentials to increase the compression rate. By changing the sampling frequency we change the relative location of the signal frequency spectrum with respect to the terminal node filter bands. We show that even though the amount of redundant data increases when the sampling frequency goes above Nyquist's, we nevertheless achieve improved compression rate.

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 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: Methods
Teacher disagreement score0.974
Threshold uncertainty score0.673

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.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.066
GPT teacher head0.295
Teacher spread0.228 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations3
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicImage and Signal Denoising MethodsFrench-language works237,207