Generation of Random Planar Tessellations by Hierarchical Decimation

We describe a method of generating a class of irregular tessellations of a digital image using a random decimation process. The decimation is hierarchical and can generate regions of varying sizes. The tessellation can be generated in O(log image size) time if the process is implemented in parallel on a cellular pyramid computer.

[1]  Azriel Rosenfeld,et al.  Models for neighbor dependency in planar point patterns , 1989, Pattern Recognit..

[2]  Anil K. Jain,et al.  Markov Random Field Texture Models , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Peter Meer,et al.  A fast parallel method for synthesis of random patterns , 1989, Pattern Recognit..

[4]  Avraham Margalit,et al.  A parallel algorithm to generate a Markov random field image on a SIMD hypercube machine , 1989, Pattern Recognit. Lett..