• DocumentCode
    1367564
  • Title

    Generating connected textured fractal patterns using Markov random fields

  • Author

    Onural, Levent

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey
  • Volume
    13
  • Issue
    8
  • fYear
    1991
  • fDate
    8/1/1991 12:00:00 AM
  • Firstpage
    819
  • Lastpage
    825
  • Abstract
    An algorithm that yields textured and connected binary fractals is presented. The texture is imposed by modelling the fractal as a Markov random field (MRF) at every resolution level. The model size and the parameters specify the texture. The generation starts at a coarser level and continues at finer levels. Connectivity, which is a global property, is maintained by restricting the flow of the sample generating Markov chain within a limited subset of all possible outcomes of the Markov random field. The texture is controlled by the parameters of the MRF model being used. Sample patterns are shown
  • Keywords
    Markov processes; fractals; pattern recognition; picture processing; statistical analysis; Markov random fields; binary fractals; connected textured fractal patterns; pattern recognition; picture processing; sample generating Markov chain; statistical analysis; Character generation; Fractals; Image segmentation; Markov random fields; Mathematics; Pattern matching; Performance evaluation; Physics; Shape; Uncertainty;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/34.85673
  • Filename
    85673