The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1991 vol.13)
pp: 819-825
ABSTRACT
<p>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.</p>
INDEX TERMS
picture processing; pattern recognition; statistical analysis; connected textured fractal patterns; Markov random fields; binary fractals; sample generating Markov chain; fractals; Markov processes; pattern recognition; picture processing; statistical analysis
CITATION
L. Onural, "Generating Connected Textured Fractal Patterns Using Markov Random Fields", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.13, no. 8, pp. 819-825, August 1991, doi:10.1109/34.85673
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool