MétaCan
Menu
Back to cohort
Record W2038870549 · doi:10.1109/tsp.2009.2013896

Filter Banks for Prediction-Compensated Multiple Description Coding

2009· article· en· W2038870549 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

VenueIEEE Transactions on Signal Processing · 2009
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsFilter bankBiorthogonal systemAlgorithmComputer scienceMultiple description codingFilter (signal processing)Sub-band codingCoding (social sciences)Filter designTransform codingJPEGCoding gainData compressionTheoretical computer scienceMathematicsDecoding methodsArtificial intelligenceImage (mathematics)Computer visionDiscrete cosine transformStatisticsWavelet transformWavelet

Abstract

fetched live from OpenAlex

In this paper, a prediction-compensated multiple description (MD) coding framework for two-band filter banks is proposed, in which the coefficients in each subband are split into two descriptions. Each description also includes the prediction residuals of the data in the other description. The designs of the optimal orthogonal and biorthogonal filter banks are formulated in a unified framework, and both one-level and multiple-level decompositions are analyzed. Contrary to the existing MD filter banks in the literature, the optimal filter banks in the proposed scheme are quite similar to those in single description coding. Therefore, the method can be applied to systems with single-description-optimized filter banks and still attain near-optimal performance. Image coding results show that this method achieves better performance and lower complexity than the latest JPEG 2000 based MDC.

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

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.0010.000
Scholarly communication0.0000.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.040
GPT teacher head0.278
Teacher spread0.238 · 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