MétaCan
Menu
Back to cohort
Record W1935790646 · doi:10.1109/pacrim.1997.619964

Image compression for facial photographs based on wavelet transform

2002· article· en· W1935790646 on OpenAlexaff
E. Barzykina, Panos Nasiopoulos, Rabab Ward

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsArtificial intelligenceComputer visionComputer scienceWavelet transformWaveletQuantization (signal processing)Pattern recognition (psychology)Image compressionDiscrete wavelet transformData compressionStationary wavelet transformSecond-generation wavelet transformImage processingImage (mathematics)

Abstract

fetched live from OpenAlex

This paper presents a wavelet based image compression algorithm specifically tailored for facial photographs. The proposed method dramatically reduces memory requirements for facial image databases. The algorithm makes it possible to reach compression rates of 0.25 to 0.1 bpp without compromising the visual quality of the facial features used for identification purposes. This is made possible by utilizing a novel strategy for quantizing the wavelet coefficients, where the spatial content and the frequency distribution of each input image are combined to produce a quantization scheme which is spatially and frequency dependent and different for each image being processed. The main steps of the algorithm are as follows: detection of more and less important spacial areas in the photograph; discrete wavelet transform; space and frequency dependent quantization customized for a specific frequency distribution of each image; and entropy encoding.

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 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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.841
Threshold uncertainty score0.601

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.024
GPT teacher head0.273
Teacher spread0.249 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
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

Citations3
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207