Abstract
Consider a graph directed iterated function system (GIFS) on the line which consists of similarities. Assuming neither any separation conditions, nor any restrictions on the contractions, we compute the almost sure dimension of the attractor. Then we apply our result to give a partial answer to an open problem in the field of fractal image recognition concerning some self-affine graph directed attractors in space.
Original language | English |
---|---|
Pages (from-to) | 279-292 |
Number of pages | 14 |
Journal | Fundamenta Mathematicae |
Volume | 180 |
Issue number | 3 |
DOIs | |
State | Published - 2003 |
Externally published | Yes |
Keywords
- Fractal image recognition
- Fractals with overlapping cylinders
- Graph directed IFS
- Self-affine fractals