MétaCan
Menu
Back to cohort
Record W2139806954 · doi:10.1109/icip.2002.1040033

Fractal image compression using MNLPC, MIC and H-MPC network library

2003· article· en· W2139806954 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 - International Conference on Image Processing · 2003
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsFractal compressionIterated function systemComputer scienceDecoding methodsImage compressionFractalData compressionFractal transformArtificial neural networkArtificial intelligencePattern recognition (psychology)AlgorithmPrincipal component analysisMathematicsImage (mathematics)Image processing

Abstract

fetched live from OpenAlex

The partitioned iterated function systems (PIFS) fractal image compression technique provides very competitive rate-distortion curves and fast decoding. However, it suffers from complicated encoding computation. Three novel neural network techniques, mixture of nonlinear principal components (MNLPC), mixture of independent components (MIC) and high-dimensional mixture of principal components (H-MPC) are developed to reduce the encoding complexity of the PIFS fractal coding. Applying these new techniques, the potential best range-domain matching search is confined to a relatively small size domain block pool. Using the new techniques, the encoding time is shortened dramatically, and the compression performance is improved as well.

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 categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.715
Threshold uncertainty score1.000

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.0030.006
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.035
GPT teacher head0.306
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