On Succinct Representations of Textured Surfaces by Weighted Finite Automata
Explore this paper's citation graph
Summary
This work studies the combination of these highly effective compression techniques with a generalization of weighted finite automata to higher dimensions, which establish d-dimensional relations between result- sets of ordinary weighted automata.
- Type
- article
- Published
- 2010-01-01
- Cited by
- 0
- References
- 30
- Access
- Open access
- OpenAlex
- https://openalex.org/W26135611
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9914177
Keywords
Computer science, Grayscale, JPEG, Generalization, Theoretical computer science
References
- On Computability and some Decision Problems of Parametric Weighted Finite Automata
- Properties and Applications of Parametric Weighted Finite Automata
- Rational series and their languages
- Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
- Automata-Theoretic Aspects of Formal Power Series
- Handbook of Weighted Automata
- ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA
- Implementing Daubechies wavelet transform with weighted finite automata
- Computational fractal geometry with WFA
- On the Definition of a Family of Automata
- Fast Pattern Matching in Strings
- The JPEG still picture compression standard
- Finite Automata Computing Real Functions
- Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference
- Orthonormal bases of compactly supported wavelets
- Image and video coding with weighted finite automata
- Weighted finite automata for video compression
- A Practical Guide to Splines
- Automata, languages, and machines. A
- Fractals everywhere
Cited by
No citing papers recorded for this paper.
Related papers
- Input-Trees of Finite Automata and Application to Cryptanalysis
- Image representation using distributed weighted finite automata
- Featured Weighted Automata
- An inference implementation based on extended weighted finite automata
- Quantitative properties of featured automata
- From Hadamard Expressions to Weighted Rotating Automata and Back
- Implicitly Intersecting Weighted Automata using Dual Decomposition
- Efficient Simulation of Nondeterministic Weighted Finite Automata