Generating connected textured fractal patterns using Markov random fields

Date

1991

Authors

Onural, L.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
3
views
25
downloads

Citation Stats

Series

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.

Source Title

IEEE Transactions on Pattern Analysis and Machine Intelligence

Publisher

Institute of Electrical and Electronics Engineers

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English