MétaCan
Menu
Back to cohort
Record W2123034937 · doi:10.1109/dcc.2008.39

Filter Banks for Prediction-Compensated Multiple Description Coding

2008· article· en· W2123034937 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

VenueDCC · 2008
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsBiorthogonal systemMultiple description codingFilter bankJPEGAlgorithmComputer scienceCoding (social sciences)Filter (signal processing)Transform codingFilter designSub-band codingJPEG 2000Data compressionImage compressionTheoretical computer scienceMathematicsDecoding methodsArtificial intelligenceImage processingImage (mathematics)Computer visionDiscrete cosine transformWavelet transformWaveletStatistics

Abstract

fetched live from OpenAlex

This paper investigates the design and application of the optimal filter banks for a prediction-compensated multiple description coding (PC-MDC) scheme, where 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 optimal designs of orthogonal and biorthogonal filter banks with multiple-level decompositions are formulated in a unified framework. The optimal results in all cases are found to be very close to the optimal filter banks in traditional single description coding. This allows us to apply the proposed method to existing systems with single-description-optimized filter banks and still enjoy near-optimal performance. Image coding results in the JPEG 2000 framework show that the proposed method achieves similar or better performance than other methods. It also has lower complexity and is more compatible to the JPEG 2000 standard.

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: Methods · Consensus signal: none
Teacher disagreement score0.599
Threshold uncertainty score0.382

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.001
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.060
GPT teacher head0.263
Teacher spread0.203 · 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