MétaCan
Menu
Back to cohort
Record W4398163706 · doi:10.1109/dcc58796.2024.00053

Construction of Fast Data-driven Transforms for Image Compression via Multipath Coordinate Descent on Orthogonal Matrix Manifold

2024· article· en· W4398163706 on OpenAlexaff
Dilshan Morawaliyadda, Pradeepa Yahampath

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsCoordinate descentDiscrete cosine transformComputer scienceAlgorithmData compressionImage compressionOrthonormal basisOrthogonal transformationGradient descentOrthogonal matrixTransform codingArtificial intelligenceComputer visionMathematicsImage processingImage (mathematics)Orthogonal basis

Abstract

fetched live from OpenAlex

Recent research indicates that data-driven transforms can outperform the widely used separable two-dimensional discrete cosine transform (2D-DCT) in applications such as video coding. However, unlike the 2D-DCT, data-driven transforms are random matrices with no structure and do not lend themselves to fast computations. In this paper, we investigate a new approach to construct low-complexity data-driven transforms by exploiting a connection between the Givens rotation matrices and coordinate descent on the orthonormal matrix manifold. We propose a multi-path coordinate descent algorithm which is observed to produce better transform matrices than the simple coordinate descent. Our experiments with many images showed that the proposed algorithm can be used to design fast data-driven transforms which achieve a higher coding gain than the 2D-DCT in some image blocks.

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.763
Threshold uncertainty score0.666

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.002
Open science0.0010.001
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.028
GPT teacher head0.332
Teacher spread0.304 · 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

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207