MétaCan
Menu
Back to cohort
Record W1962592885 · doi:10.1109/icassp.2000.859195

Fuzzy trellis vector quantization of images

2002· article· en· W1962592885 on OpenAlexaff
Tariq Haddad, Abbas Yongaçoğlu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsCodebookLinde–Buzo–Gray algorithmVector quantizationAlgorithmDecoding methodsTrellis (graph)Distortion (music)Image compressionMathematicsViterbi algorithmFuzzy logicComputer scienceArtificial intelligenceImage (mathematics)Image processingBandwidth (computing)

Abstract

fetched live from OpenAlex

This paper introduces a new codebook search algorithm for trellis vector quantization systems (TVQ). The development of the new algorithm is based on the symbol-MAP channel decoding algorithm, which is modified for data compression to deliver soft distortion-related reliability information. Following a rate-distortion theoretic approach, the soft information is used to derive a codebook search algorithm that is capable of solving the problems associated with the LBG algorithm. The derived algorithm is fuzzy in the sense that it follows a soft association rule, however, it is deterministic in the descent towards the global minimum distortion point. Although the derivation is general, the algorithm is tested using gray-scale images, which provide a nonconvex square-error distortion surface. As shown in the simulation section, the new algorithm provides lower energy codebooks (/spl sim/0.8 dB gain), while being significantly less sensitive to initial codebooks using short training image sequences.

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

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.260
Teacher spread0.236 · 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 designBench or experimental
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

Citations2
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207