MétaCan
Menu
Back to cohort
Record W2137509276 · doi:10.1109/icassp.2005.1415417

Improvement of JPEG2000 Using Curved Wavelet Transform

2006· article· en· W2137509276 on OpenAlexaff
Demin Wang, Liang Zhang, A. Vincent

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsCommunications Research Centre Canada
Fundersnot available
KeywordsWavelet transformSecond-generation wavelet transformWaveletStationary wavelet transformWavelet packet decompositionLifting schemeDiscrete wavelet transformHarmonic wavelet transformArtificial intelligenceJPEG 2000MathematicsComputer visionComputer sciencePattern recognition (psychology)AlgorithmImage compressionImage processingImage (mathematics)

Abstract

fetched live from OpenAlex

The wavelet transform in JPEG2000 is performed using one-dimensional (1D) filtering in the vertical and horizontal directions. This conventional wavelet transform is not effective to represent edges and lines in images. In this paper we present a curved wavelet transform that improves the performance of JPEG200. The curved wavelet transform is performed using 1D filtering along curves that are usually parallel to edges and lines in images. The pixels along these curves can be well represented by a small number of wavelet coefficients. A simple algorithm is proposed in this paper to determine the curves according to image content. Experimental results show that the curved wavelet transform can significantly improve the compression efficiency of JPEG2000, especially for images that contain sharp edges and lines. The coding gain can be up to 1.6 dB in the terms of PSNR.

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.000
metaresearch head score (Gemma)0.002
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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.014
GPT teacher head0.262
Teacher spread0.248 · 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

Citations11
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207