MétaCan
Menu
Back to cohort
Record W2291478302

Image texture analysis using weighted finite automata

2003· article· en· W2291478302 on OpenAlexaff
Helmut Jürgensen, Mark Eramian

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsWestern University
Fundersnot available
KeywordsAutomatonNondeterministic finite automatonMathematicsTexture (cosmology)Finite-state machineDFA minimizationENCODEImage textureAlgorithmImage (mathematics)Hausdorff spaceQuantum finite automataComputer scienceTheoretical computer scienceArtificial intelligencePattern recognition (psychology)Discrete mathematicsAutomata theoryImage processing
DOInot available

Abstract

fetched live from OpenAlex

We investigate the viability of extracting local texture information from finite automata that encode images. Local Hausdorff dimension is considered as a possible measure of texture complexity and is found to be only somewhat representative of texture despite previous claims. A theoretical framework for analysis of images encoded by weighted finite automata is developed, implemented and tested. During this project, a new efficient algorithm for simulating weighted finite automata is introduced. We find that texture analysis of images from the finite automata that represent them is possible and the successful results of a first method for doing so are presented.

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.003
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.012
GPT teacher head0.246
Teacher spread0.234 · 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

Citations5
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicsemigroups and automata theoryFrench-language works237,207