Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T03:56:52.932Z Has data issue: false hasContentIssue false

Consistency in the Reconstruction of Patterns from Sample Data

Published online by Cambridge University Press:  20 November 2018

Marc Moore*
Affiliation:
Ecole Polytechnique, Montréal, Québec
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let A be a k-dimensional Euclidean region having unit volume. An m-colors pattern is a partition PA of A into m sets Ai, i—1,…, m with positive volume. PA is called a random pattern if in addition the partition of A is a realization of a random process with the following stationarity and isotropy properties:

  • (i) for all points s ∊ A, P(s ∊ Ai) =pi9, i = 1,..., m

  • (ii) for all pair of points s, s'∊ A with distance |s—s|=d between them, P(s' ∊ Ai | s ∊ Aj)Pij(d) i,j= 1,..., m.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1972