MétaCan
Menu
Back to cohort
Record W2029597966 · doi:10.1117/12.465280

<title>Hiding-based compression for improved color image coding</title>

2002· article· en· W2029597966 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2002
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsChrominanceComputer scienceArtificial intelligenceSet partitioning in hierarchical treesComputer visionLuminanceGrayscaleImage compressionData compressionJPEGColor Cell CompressionColor depthJPEG 2000Color imageImage processingImage (mathematics)

Abstract

fetched live from OpenAlex

This paper considers the use of data hiding strategies for improved color image compression. Specifically, color information is piggybacked on the luminance component of the image in order to reduce the overall signal storage requirements. A practical wavelet-based data hiding scheme is proposed in which selected perceptually irrelevant luminance bands are replaced with perceptually salient chrominance components. Simulation results demonstrate the improvement in compression quality of the proposed scheme to SPIHT and JPEG at low bit rates. The novel technique also has the advantage that it can be used to further reduce the storage requirements of algorithms such as SPIHT which is optimized for grayscale 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.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.660
Threshold uncertainty score0.768

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.001
Open science0.0010.000
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.014
GPT teacher head0.242
Teacher spread0.228 · 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