By Topic

Generating connected textured fractal patterns using Markov random fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
L. Onural ; Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey

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 in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:13 ,  Issue: 8 )