The dimension of graph directed attractors with overlaps on the line, with an application to a problem in fractal image recognition

Michael Keane, Károly Simon, Boris Solomyak

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

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 languageEnglish
Pages (from-to)279-292
Number of pages14
JournalFundamenta Mathematicae
Volume180
Issue number3
DOIs
StatePublished - 2003
Externally publishedYes

Keywords

  • Fractal image recognition
  • Fractals with overlapping cylinders
  • Graph directed IFS
  • Self-affine fractals

Fingerprint

Dive into the research topics of 'The dimension of graph directed attractors with overlaps on the line, with an application to a problem in fractal image recognition'. Together they form a unique fingerprint.

Cite this