Generating connected textured fractal patterns using Markov random fields

Date
1991
Authors
Onural, L.
Advisor
Instructor
Source Title
IEEE Transactions on Pattern Analysis and Machine Intelligence
Print ISSN
0162-8828
Electronic ISSN
Publisher
Institute of Electrical and Electronics Engineers
Volume
13
Issue
8
Pages
819 - 825
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Abstract

An algorithm that yields textured and connected binary fractals is presented. The texture is imposed by modeling 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.

Course
Other identifiers
Book Title
Keywords
Computer Programming - Algorithms, Probability - Random Processes, Fractals, Image Texture Analysis, Markov Random Fields, Textured Fractal Patterns, Image Processing
Citation
Published Version (Please cite this version)