Share Email Print

Proceedings Paper

Synthesis and simulation of digital images by tree-indexed Markov chains
Author(s): Frederik Michel Dekking; Cor Kraaikamp; Amro M. Elfeki; Johannes Bruining
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Quad trees and dyadic trees are hierarchical data structures that are used to represent spatial data or images. With a collection of images, a tree-indexed Markov chain can be generated by letting the transition probabilities from one level to the next level be estimated by the empirical transition probabilities. Depending on the original collection of images various goals may be achieved. One may for instance synthesize new structures from given structures. Another example is the modeling of heterogeneous structures are multi-scales for geological characterization.

Paper Details

Date Published: 30 September 1999
PDF: 12 pages
Proc. SPIE 3815, Digital Image Recovery and Synthesis IV, (30 September 1999); doi: 10.1117/12.364133
Show Author Affiliations
Frederik Michel Dekking, Delft Univ. of Technology (Netherlands)
Cor Kraaikamp, Delft Univ. of Technology (Netherlands)
Amro M. Elfeki, Delft Univ. of Technology (Netherlands)
Johannes Bruining, Delft Univ. of Technology (Netherlands)

Published in SPIE Proceedings Vol. 3815:
Digital Image Recovery and Synthesis IV
Timothy J. Schulz; Paul S. Idell, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?