Generating Connected Textured Fractal Patterns Using Markov Random Fields

Authors:
Levent Onural
Affiliations:
-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1991

Citing 2
Cited 0

Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields

IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple Parallel Hierarchical and Relaxation Algorithms for Segmenting Noncausal Markovian Random Fields

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.14

Visualization

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.