MétaCan
Menu
Back to cohort
Record W2789397886 · doi:10.1109/tcsi.2018.2799006

Low-Cost Lifting Architecture and Lossless Implementation of Daubechies-8 Wavelets

2018· article· en· W2789397886 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Circuits and Systems I Regular Papers · 2018
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Saskatchewan
FundersWestern Economic Diversification CanadaNatural Sciences and Engineering Research Council of CanadaCanada Foundation for Innovation
KeywordsDaubechies waveletWaveletLossless compressionArchitectureComputer scienceArtificial intelligenceWavelet transformData compressionDiscrete wavelet transformArt

Abstract

fetched live from OpenAlex

This paper presents three lifting structures of Daubechies-8 (also known as D8) wavelet transform using efficient factorization of the polyphase matrix. All new filter coefficients are optimally mapped with integers resulting in low cost hardware implementation. We first derive the polyphase matrices using a factorization algorithm, which forms the basis of multiple lifting structures of D8. A theoretical framework is then derived and proven experimentally to eliminate the scaling stage of the algorithm that incurs computation error in conventional integer-based wavelets. This elimination of the scaling stage makes the proposed architecture lossless. Also due to the optimum integer mapping, the 8-bit implementation of our schemes produces very similar results than that of the classical double-precision D8 filter. Finally, we compare our results with other existing lifting wavelets to demonstrate the advantage in terms of lower cost, losslessness and improved performance.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.954
Threshold uncertainty score0.617

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.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.015
GPT teacher head0.270
Teacher spread0.255 · 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