MétaCan
Menu
Back to cohort
Record W2146705558 · doi:10.1109/ccece.2004.1344993

Image compression with optimal wavelet

2004· article· en· W2146705558 on OpenAlexafffund
G.Y. Chen, Tien D. Bui, Adam Krzyżak

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsWaveletWavelet transformImage compressionArtificial intelligenceComputer scienceDaubechies waveletSimulated annealingStationary wavelet transformDiscrete wavelet transformData compressionLifting schemeComputer visionPattern recognition (psychology)Image (mathematics)MathematicsImage processingAlgorithm

Abstract

fetched live from OpenAlex

Wavelets have been successfully used in image compression. However, for the given image, the choice of the wavelet to use is an important issue. In this paper, we propose to use the optimal wavelet for image compression, given the number of most significant wavelet coefficients to be kept. Simulated annealing is used to find the optimal wavelet for the given image to be compressed. In simulated annealing, we need a cost function to minimize. This cost function is defined as the mean square error between the decompressed image and the original image. We conduct some experiments in Matlab by using the test images Lena, MRIScan and Fingerprint. These images are available in WaveLab, developed by Donoho et al., at Stanford University. Experimental results show that this approach is better than the Daubechies-8 wavelet (D8) for image compression. In some cases, we get nearly 0.6 dB improvement over D8 by using the optimal wavelet. This indicates that the choice of the wavelet indeed makes a significant difference in image compression.

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.003
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: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.267
Teacher spread0.253 · 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
GenreEmpirical

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

Citations0
Published2004
Admission routes2
Has abstractyes

Explore more

Same topicImage and Signal Denoising MethodsFrench-language works237,207