Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Ahuja and B.J. Schachter, Pattern Models. Wiley-Interscience, New York (1983).
S.K. Bhaskar, A. Rosenfeld, and A.Y. Wu, Models for neighbor dependency in planar dot patterns, Pattern Recognition 22, 533–559 (1989).
G.R. Cross and A.K. Jain, Markov random field texture models, IEEE Trans. Pattern Analysis Mach. Intell. PAMI-5, 25–39 (1983).
A. Margalit, A parallel algorithm to generate a Markov random field image on a SIMD hypercube machine, Pattern Recognition Letters 9, 263–278 (1989).
P. Meer and S. Connelly, A fast parallel method for synthesis of random patterns, Pattern Recognition 22, 189–204 (1989).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meer, P., Rosenfeld, A. (1992). Generation of Random Planar Tessellations by Hierarchical Decimation. In: Rozenberg, G., Salomaa, A. (eds) Lindenmayer Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58117-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-58117-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63474-1
Online ISBN: 978-3-642-58117-5
eBook Packages: Springer Book Archive