MétaCan
Menu
Back to cohort
Record W2057652873 · doi:10.1109/icassp.2010.5496298

Low-complexity computation of visual information fidelity in the discrete wavelet domain

2010· article· en· W2057652873 on OpenAlexaff
Soroosh Rezazadeh, Stéphane Coulombe

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicImage and Video Quality Assessment
Canadian institutionsÉcole de Technologie SupérieureUniversité du Québec à Montréal
Fundersnot available
KeywordsComputational complexity theoryHaar waveletFidelityComputer scienceWaveletMetric (unit)Discrete wavelet transformAlgorithmImage qualityWavelet transformArtificial intelligenceComputationDomain (mathematical analysis)Pattern recognition (psychology)Computer visionImage (mathematics)Mathematics

Abstract

fetched live from OpenAlex

The visual information fidelity (VIF) index is an objective quality metric that gives very accurate image similarity scores, but at the cost of very high computational complexity. In this paper, a method is presented for calculating VIF in the discrete wavelet domain using the Haar wavelet. The proposed method exploits scalar Gaussian Scale Mixture (GSM) instead of vector GSM for calculating the prediction scores. The complexity of the proposed method is assessed for five different popular image sizes and compared to other methods based on a C/C++ implementation of the algorithms. Experimental results show that the proposed method can compute the visual quality score with less than 30% of the computational complexity of the well-known SSIM index, with greater accuracy than that achieved by the original VIF index method (at about 5% of its computational complexity).

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation 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.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.001

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.023
GPT teacher head0.333
Teacher spread0.310 · 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 source (direct Gemma or distilled Codex), 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

Citations7
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicImage and Video Quality AssessmentFrench-language works237,207