MétaCan
Menu
Back to cohort
Record W2116096293 · doi:10.1109/lsp.2003.821661

Quadtree-Based Multiregion Multiquality Image Coding

2004· article· en· W2116096293 on OpenAlexaff
S. Tasdoken, A. Çuhadar

Bibliographic record

VenueIEEE Signal Processing Letters · 2004
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsCarleton University
Fundersnot available
KeywordsQuadtreeComputer scienceJPEG 2000JPEGContext-adaptive binary arithmetic codingArtificial intelligenceComputer visionImage compressionCoding (social sciences)Data compressionCoding tree unitImage resolutionPixelFidelityImage processingAlgorithmDecoding methodsImage (mathematics)Mathematics

Abstract

fetched live from OpenAlex

Region-based video coding schemes employed in MPEG-4 are also promising for still image coding applications where images contain a number of objects that can be encoded at different bit rates, such as compression of medical images for archiving and transmission. Motivated by this fact, in this letter we investigate multiregion multiquality (MRMQ) coding with quadtree-based wavelet coders. We present a novel scheme which addresses the region size sensitivity problem in region-based coding. The proposed method outperforms the region-of-interest (ROI) coding unit of JPEG-2000; it is possible to save 0.3 bits per pixel to attain the same ROI/background fidelity without sacrificing the additional features provided by JPEG-2000, such as resolution scalability and error resilience.

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.001
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.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.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.298
Teacher spread0.270 · 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

Citations9
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Signal Processing LettersSame topicAdvanced Data Compression TechniquesFrench-language works237,207