1. Generating connected textured fractal patterns using Markov random fields
- Author
-
L. Onural
- Subjects
Markov kernel ,Image Processing ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Markov process ,Markov model ,Image Texture Analysis ,symbols.namesake ,Computer Programming - Algorithms ,Artificial Intelligence ,Markov Random Fields ,Textured Fractal Patterns ,Mathematics ,ComputingMethodologies_COMPUTERGRAPHICS ,Random field ,Markov random field ,Markov chain ,business.industry ,Applied Mathematics ,Variable-order Markov model ,Pattern recognition ,Probability - Random Processes ,Fractals ,Computational Theory and Mathematics ,Computer Science::Computer Vision and Pattern Recognition ,symbols ,Markov property ,Computer Vision and Pattern Recognition ,Artificial intelligence ,business ,Algorithm ,Software - 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. >
- Published
- 1991