# Miles formulae for Boolean models observed on lattices.

INTRODUCTION

With the fast development of new materials like foams or fibre reinforced composites there is a growing need for non-destructive testing and structure characterisation. Often, geometric characteristics of the whole structure have to be estimated from the given 2D or 3D image of a small sample. A very attractive set of geometric characteristics are the intrinsic volumes (or quermassintegrals or Minkowski functionals). On the one hand, they include the widely used volume V, surface area S, and Euler number [chi]. On the other hand, they are in some sense complete, see Hadwiger (1957). The fourth intrinsic volume in 3D--the integral of mean curvature M--has nice interpretations for various structures, too. In particular for random fibre systems, it is proportional to the total fibre length.

Throughout this paper, we assume that the structure of interest is observed in an n-dimensional binary digital image. That is, the structure is given by its intersection with a lattice and a cuboidal window and values associated the lattice points indicating structure (1) or background (0).

The well known integral geometric Crofton formulae provides a method for determining the intrinsic volumes from lower dimensional sections of the structure. A discretisation of this formula is the basis of our method, see also Chapter 4 in Ohser and Mucklich (2000) and Lang et al. (2001). The Crofton formulae reduce the estimation of intrinsic volumes to the estimation of the Euler number in lower dimensional sections. Therefore, the present paper is based on thorough investigations of digital connectivity and consistent estimation of the Euler number, see Nagel et al. (2000); Ohser et al. (2002; 2003); Schladitz et al. (2006). The consistency results for the Euler number estimates of foreground and background established in Ohser et al. (2002) carry over to all intrinsic volumes. In order to give the reader a comprehensive description of our approach making the latter as self-contained as possible, we recall some facts addressed in the papers mentioned above. In the present paper it is shown that this approach can be extended on all intrinsic volumes in arbitrary dimensions.

In order to check the accuracy of the proposed method, the bias of the estimators is computed for macroscopically homogeneous (stationary) and isotropic Boolean models. Using ideas of Serra (1982), we show that our surface area estimator is multigrid convergent for this very rich class of sets. However, the bias of the estimators for the integral of mean curvature and for the Euler number does not necessarily vanish with decreasing lattice distance. Even worse, for three out of the four adjacency systems examined, the bias of the Euler number estimator diverges. Nevertheless, for lattice distances in the range of 1% to 10% of the mean grain size of the Boolean model, the estimation is sufficiently accurate for practical applications. The explicit formulae for the bias of the estimators lead to formulae connecting the estimated intrinsic volumes with the parameters of the Boolean model. The structure of these formulae resembles the original Miles' formulae (Miles, 1976) in the Euclidean space with additional terms correcting for the discretisation effects.

The presented method yields a fast algorithm for simultaneously determining the intrinsic volumes and their densities. The core of the algorithm consists in a convolution of the binary image with a suitably chosen [2.sup.n] mask resulting in a grey value image, see Lang et al. (2001); Ohser and Mucklich (2000). All further steps are based solely on the grey value histogram whose size does not depend on image size or content. Thus the advantage over other methods for estimating the intrinsic volumes, see Blasquez and Poiraudeau (2003); Schmidt and Spodarev (2005) are simplicity and speed of the algorithm. The surface area in 31) is measured directly from the binary volume image without need to approximate the surface. Moreover, compared to empirical marching cubes methods like in Windreich et al. (2003), only a small number of pixel configurations has to be taken into account. In Schladitz et al. (2006) the weights for the surface are compared with those of Lindblad and Nystrom (2002), see also Ziegel and Kiderlen (2009) for a sound investigation of surface area estimation.

This paper is organised as follows: First we repeat some facts about homogeneous lattices and summarise results on adjacency systems and Euler number estimation from Nagel et al. (2000); Ohser et al. (2002; 2003); Schladitz et al. (2006). Based on concepts of section lattices and their translative complements, we derive discrete versions of the Crofton formulae for polyconvex sets and from these, estimators for the densities of the intrinsic volumes of random sets. In particular, we compute weights for the estimation of the density of the integral of the mean curvature in [R.sup.3]. Finally, we present Miles' formulae for Boolean models in [R.sup.n] sampled on homogeneous lattices. In principle, we follow Ohser et al. (2003) where formulae are given for the density of the Euler number of Boolean models in [R.sup.3] with balls of constant diameter. These results are generalised as follows: We derive formulae for the expectations of the densities of the intrinsic volumes for Boolean models with convex grains. Advantages and drawbacks of the presented method are discussed in the last section.

POINT LATTICES AND PIXEL CONFIGURATIONS

Image data are usually given on homogeneous point lattices, e.g., the cubic primitive lattice [L.sup.n] = a[Z.sup.n], a > 0, where Z denotes the set of integers and a is the lattice distance. Of course, most images are given on orthogonal lattices. However, we will consider lower dimensional section lattices of cubic or orthorhombic lattices, too, which are not necessarily orthogonal. Hence we introduce homogeneous lattices in a more general setting.

Let [u.sub.1], ... , [u.sub.n] [member of] [R.sup.n] form a basis of [R.sup.n] and let U = ([u.sub.1], ... , [u.sub.n]) be the matrix of column vectors. Then [L.sup.n] = U[Z.sup.n] is called an n-dimensional homogeneous lattice. The closed unit cell of [L.sup.n] w. r. t. the basis [u.sub.1], ... , [u.sub.n] is the Minkowski sum C = [0, [u.sub.1]] [symmetry] ... [symmetry] [0, [u.sub.n]] of the segments [0, [u.sub.i]] between the origin 0 and the lattice points [u.sub.i]. Its volume is vo1C = [parallel] det U > 0, and the value of [parallel] det U does not depend on the choice of the lattice basis.

The intersection X [intersection] [L.sup.n] of a compact set X [subset] [R.sup.n] and a homogeneous lattice [L.sup.n] is called a [L.sup.n]-sampling of X. In the language of image processing, X [intersection] [L.sup.n] is the set of foreground pixels and [X.sup.c] [intersection] [L.sup.n] is the background.

Locally, an [L.sup.n]-sampling of X can be described by pixel configurations which are specified as follows: The vertices of the unit cell C are indexed, and we write [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] with the index [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Clearly, the unit cell C has 2n vertices, [x.sub.j] [member of] [F.sup.0] (C), j = 0, ... , [2.sup.n]-1, where [F.sup.0] (C) denotes the set of vertices of C. In a similar way we introduce the indices for all subsets [xi] [subset or equal to] [F.sup.0] (C). Let 1 denote the indicator function, i.e., 1(x [member of] [xi]) = 1 if [member of] [xi] and 1(x [member of] [xi]) = 0 otherwise. An index f is assigned to a [xi], and we write [[xi].sub.l] if

l = [[2.sup.n]-1 summation over (j=0)] [2.sup.j] * 1([x.sub.j] [member of] [xi]), (1)

for all [xi] [subset or equal to][F.sup.0](C). We have l [member of] {0, ... ,v} with v = [2.sup.2n] - 1. That means, the powers of 2 are used for encoding the vertices. Notice that [[xi].sub.0] = [empty set], [[xi].sub.v], = [F.sup.0](C), and [[xi].sub.v-l] = [[xi].sub.v] [[xi].sub.l]. The set [[xi].sub.l] can be considered as a local pixel configuration of the foreground.

We use pictograms to illustrate configurations where full discs mark foreground pixels and empty discs mark background pixels, see Table 1 for examples. Sets of pixel configurations are denoted by pictograms with vertices not marked with a disc, which can be either foreground or background pixels, see Table 2.

In the case of a cubic primitive lattice which is highly symmetric, the pixel configurations [[xi].sub.l] [subset or equal to] [F.sup.0] (C) are commonly grouped in equivalence classes. Let M be the set of all linear isometrics (rigid motions and reflections) leaving [L.sup.n] unchanged, i.e., [theta][L.sup.n] = Ln for all [theta] [member of] M. The configuration [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is equivalent to [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] if there is a [theta] [member of] M and a y [member of] [L.sup.n] such that [theta] [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] + y = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. By [D.sub.0], ... , [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] we denote the congruence classes of {[[xi].sub.0], ... ,[[xi].sub.v]} under M. Furthermore, we choose a system {[[eta].sub.0], ... , [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]} of representatives [[eta].sub.j] [member of] [D.sub.j]. We write [[eta].sup.c.sub.j] for a representative of the equivalence class of [F.sup.0](C) \ [[eta].sub.j].

Since the intrinsic volumes are motion invariant characteristics, their weights can be presented in terms of the congruence classes instead for the complete set of pixel configurations. The [v.sub.0] + 1 = 22 congruence classes in the 3D case are given in Table 1 with our choice of representatives [[eta].sub.0], ... , [[eta].sub.21].

ADJACENCY AND EULER NUMBER

In the literature the adjacency relation of lattice points (or pixels) is usually characterised by a neighbourhood graph and the complementarity of adjacencies is defined via the Jordan surface theorem (Jordan-Brouwer theorem), see, e.g., Lachaud and Montanvert (2000). Here we follow Ohser et al. (2003); Schladitz et al. (2006) where the definition of adjacency is based on a consistency relation for the Euler number.

We first consider the convex hulls [F.sub.l] = conv [[xi].sub.l] of a configuration [[xi].sub.l] forming convex polytopes with [F.sub.l] [subset or equal to] C and [F.sup.0]([F.sub.l]) [subset or equal to] [F.sup.0](C), l = 1, ... , v. We set [F.sub.0] = [theta]. Let [F.sup.j] (F) denote the set of all j-dimensional faces of a convex polytope F. For a set F of convex polytopes write [F.sup.j](F) = [union] {[F.sup.j](F) : F [member of] F} using the convention [union] {[F.sup.j](F) : F [member of] F} = [[union].sub.F[member of]F][F.sup.j](F). Furthermore, by A we denote the topological closure of a set A [subset] [R.sup.n] and #N denotes the number of elements of a finite set N.

Definition 1 Let [F.sub.loc] [subset or equal to] {[F.sub.0], ... ,[F.sub.v]} be a set of convex polytopes [F.sub.l] = conv [[xi].sub.l] fulfilling the conditions

(i) [theta] [member of] [F.sub.loc], C [member of] [F.sub.loc],

(ii) if F [member of] [F.sub.loc] then [F.sup.i](F) [subset] [F.sub.loc] for i = 0, ... , dim F,

(iii) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

(iv) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Then [F.sub.loc] is called a local adjacency system and F = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]([F.sub.loc] + x) is said to be an adjacency system of the lattice [L.sup.n].

From (i) it immediately follows that [F.sup.0] (F) = [L.sup.n]. The conditions (ii) and (iii) ensure that the Euler number of the unions [union]{F [member of] F : [F.sup.0](F) [subset] [[xi].sub.l]}, l = 0, ... , v, can be computed via the Euler-Poincare formula and the inclusion-exclusion principle, see Schneider (1993). Condition (iv) prevents the existence of many different local adjacency systems generated from the same 'basic bricks'.

The pair [GAMMA] = ([F.sup.0](F), [F.sup.1](F)) is said to be the neighbourhood graph of F; it consists of the set [F.sup.0] (F) of vertices and the set [F.sup.1](F) of edges. All vertices are of the same order since [GAMMA] is homogeneous, [GAMMA] + x = [GAMMA], x [member of] [L.sup.k]. The order of the vertices is called the connectivity of [L.sup.n]. We write [F.sub.m] if the corresponding neighbourhood graph is m-connected.

For n = 3 we recall the adjacency systems [F.sub.6], [F.sub.14.1], [F.sub.14.2], and [F.sub.26] considered in detail in Ohser et al. (2002; 2003).

-- [F.sub.6] is generated by the singleton containing the unit cell C, i.e., [F.sub.6] = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] [[union].sup.3].sub.j=0][F.sup.j] (C + x).

-- [F.sub.14.1] is generated by the tessellation of C into the 6 tetrahedra [F.sub.139], [F.sub.141], [F.sub.163], [F.sub.177], [F.sub.197], [F.sub.209], i.e., [F.sub.14.1] is the smallest adjacency system containing these tetrahedra.

-- [F.sub.14.2] is generated by the family of tetrahedra [F.sub.43], [F.sub.41], [F.sub.49], [F.sub.69], [F.sub.77], and [F.sub.212]

-- The maximum adjacency system [F.sub.26] on [L.sup.3] is generated by [F.sub.loc] = {[F.sub.0], ... , [F.sub.255]} .

Now we introduce a discretisation of a set w.r.t. a given adjacency system.

Definition 2 The discretisation X [??] F of a compact subset X [subset] [R.sup.n] w.r.t. a given adjacency system F is defined as the union of all elements of F that have all their vertices in X, i.e.,

X [??] F = [union]{F [member of] F : [F.sup.0](F) [subset or equal to] X}. (2)

An adjacency system F can be seen as a set of 'bricks' of the discretisation where a 'brick' F [member of] F is a subset of the discretisation of X if and only if all vertices of F belong to X. Notice that X [??] F = (X [intersection] [L.sup.n]) [??] F, i.e., the discretisation X [??] F is determined by the [L.sup.n]-sampling of X alone.

As in Ohser et al. (2002; 2003); Schladitz et al. (2006) we approximate X by a discretisation X [??] F w. r. t. an adjacency system F. Since the set X [??] F forms a (not necessarily convex) polyhedron, the number #[F.sup.j] (X [??] F) of elements of [F.sup.j] (X [??] F) is finite and, therefore, the Euler number [chi] (X [??] F) can be computed via the Euler-Poincare formula,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (3)

In order to apply a "local method" for measuring the Euler number we consider a local version of the Euler-Poincare formula (Eq. 3). The conditions (ii) and (iii) in Definition 1 ensure that the Euler number of a discretisation X [??] IF can be computed from local knowledge. We observe that for the local configuration [xi] = X [intersection] C [intersection] [L.sup.n] we have [xi] [??] F = (X [??] F) [intersection] C. Now we define the weights

[[mu].sub.F] = min {j : there is a G [member of] [F.sup.j] (C) with F [subset or equal to] G}, (4)

for correcting effects occurring at the cells' edges. The expression [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is the number of lattice cells covering F, i.e., the face F belongs to totally [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] neighbouring cells. Thus, the reciprocal weight [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] should be used when counting F locally. Now the number [[chi].sup.n.sub.0] can be introduced as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (5)

for l = 0, ... , v. We have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for all x [member of][L.siup.n], cf. also Jernot et al. (2004). In fact, [[chi].sup.n.sub.0] can be considered as an edge-corrected localisation of [chi]. One observes that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all [[xi].sub.l] [subset or equal to] [F.sup.0] (C). Now, the additivity and translation invariance of the Euler number and the fact that X [??] F = (X [intersection] [L.sup.n]) [??] F yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (6)

with the convention 0 *[infinity] = 0. The last equation shows that the Euler number can be written as a scalar product of the vectors w = ([w.sub.l]) and h = ([h.sub.l]). The components [w.sub.l] = [X.sup.n.sub.0] ([[xi].sub.l] [??] F) of the vector w = ([w.sub.l]) serve as weights for computing the Euler number. It is important to realise that these weights depend on F, but they are independent of X. On the other hand, the vector h = ([h.sub.l]) is independent of IF. The components of w for the adjacency systems [F.sub.6], [F.sub.14.1], [F.sub.14.2] and [F.sub.26] on [L.sup.3] are given in Ohser et al. (2003).

Now following Jernot et al. (2004), we consider a refinement of Eq. 3 which is possible when IF is generated by a tessellation [g.sub.0] = {[P.sub.1], ... ,[P.sub.m]} [subset or equal to] {[F.sub.0], ... ,[F.sub.v]} of the unit cell C. The set [P.sub.i] are ndimensional polytopes with [[union].sup.m.sub.i=1] [P.sub.i] = C and int [P.sub.i] [intersection] int [P.sub.j] = [theta] for [not equal to] j, where intP denotes the interior of P. Then the periodic extension g = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] ([g.sub.0] + x) is a (deterministic) tessellation of [R.sup.n]. We assume that g forms a face-to-face tessellation. As in Ohser et al. (2002), we call a tessellation g having the above properties an admissible tessellation.

Let [[mu].sub.F] be the number of cells of g covering F,

[[mu].sub.F] = #{P [member of] g : F [subset or equal to] P},

for F [member of] [F.sup.i] ([P.sub.i]) and j = 1, ... , n. We follow Jernot et al. (2004) where an alternative version [[chi].sup.n.sub.0] of the local Euler number is defined as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (7)

It follows that [[chi].sup.n.sub.0] = [[chi].sup.n.sub.0] and thus Eq. 6 is valid with [[chi].sup.n.sub.0] instead of [[chi].sup.n.sub.0] .

Finally, we introduce pairs of complementary adjacency systems. In the continuous case the consistency relation [chi](X) = [(-1).sup.n+1] [chi]([X.sup.c]) is fulfilled for all compact, polyconvex and topologically regular sets X [subset] [R.sup.n], see Ohser et al. (2002); Rataj and Zahle (2003), and a similar relationship should hold in the discrete case.

Definition 3 The pair (F, [F.sub.c]) is called a pair of complementary adjacency systems if (X [??] F) [intersection] ([X.sup.c][??] [F.sub.c]) = [theta] and

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (8)

for all compact X [subset] [R.sup.n]. An adjacency system F is called self-complementary if (X [??] F) [intersection] ([X.sup.c] [??] F) = [theta] and [chi] (X [??] F) = [(-1).sup.n+1][chi]([X.sup.c] [??] F) for all compact X.

For a given adjacency system F there does not necessarily exist a complementary adjacency system [F.sub.c], and until now there is not known a constructive way to find [F.sub.c]. Furthermore, the criterion of Definition 3 is not appropriate for checking complementarity. A simpler criterion is given in Schladitz et al. (2006).

It turns out that the 6-adjacency on [L.sup.3] is complementary to the 26-adjacency and there are two self-complementary adjacency systems known on [L.sup.3], the 14.1-adjacency and the 14.2-adjacency. In other words, ([F.sub.6],[F.sub.26]), ([F.sub.14.1],[F.sub.14.1]), ([F.sub.14.2],[F.sub.14.2]) and ([F.sub.26],[F.sub.6]), are pairs of complementary adjacency systems on [L.sup.3], see also Ohser et al. (2002; 2003); Schladitz et al. (2006).

INTRINSIC VOLUMES

The Crofton formulae reduce measurement of the intrinsic volumes to computation of Euler numbers in lower dimensional sections. A discretisation of these formulae combined with an efficient calculation of the Euler numbers in the intersections yield a fast algorithm for simultaneously determining the intrinsic volumes from an [L.sup.n]-sampling of X. The backbone of the Euler number calculation is a thorough investigation of digital connectivity and consistency.

SECTION LATTICES AND TRANSLATION LATTICES

Let X [subset] [R.sup.n] be a compact set (i.e., an object or a particle). We assume that X is polyconvex, i.e., X is a finite union of compact convex sets. The Crofton formulae for computing the intrinsic volumes of X use section profiles of X on affine subspaces of [R.sup.n]. In order to obtain a digitised version, we introduce section lattices of a given homogeneous lattice [L.sup.n] and their translative complements in analogy to linear subspaces and their orthogonal complements.

Definition 4 A pair ([L.sup.k],[sup.T][L.sup.n-k]) , k = 1, ... , n - 1, is called a k-dimensional section lattice [L.sub.k] equipped with the translative complement [sup.T][L.sup.n-k], if there exists a basis [V.sub.1], ... , [V.sub.n] of [L.sup.n] with

(i) [L.sup.k] = ([V.sub.1], ... ,[V.sub.k])[Z.sup.k],

(ii) [sup.T][L.sup.n-k] = ([v.sub.k+1], ... , [v.sub.n])[Z.sup.n-k],

(iii) there is an x [member of][F.sup.0](C) with {[v.sub.1], ... , [v.sub.k]} [subset] [F.sup.0] (C + x) where C is the reflection of the unit cell of [L.sup.n] at the origin.

Condition (iii) ensures that integration over 'local knowledge' on the image data is possible as needed later. The translative complement [sup.T][L.sup.n-k] has properties similar to those of the orthogonal complement of a linear subspace. In particular, the union of shifts [L.sup.k ] + x of the section lattice over all x from the corresponding translation lattice [sup.T][L.sup.n-k] yields the cubic lattice [L.sup.n] = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. However, the translative complement is not necessarily uniquely determined. Nevertheless, choosing one of the translative complements arbitrarily turns out to cover all applications presented in the following.

MEASUREMENT

We denote by [L.sup.k] the set of all k-dimensional linear subspaces of [R.sup.n]; [sup.[perpendicular to]]L is the orthogonal complement of L [member of] [L.sup.k]; [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is the n - k-dimensional Lebesgue measure on [sup.[perpendicular to]]L, and [mu] denotes the rotation invariant measure on [L.sup.k] with ,u([L.sup.k]) = 1. Now the Crofton formulae for the intrinsic volumes [V.sub.n-k](X) of a compact and polyconvex set X can be written in the form

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (9)

This means that the intrinsic volumes can be expressed in terms of the Euler number measured on lowerdimensional subspaces.

The observation of X on the lattice [L.sup.n] implies that the integrand in the Crofton formulae (Eq. 9) is known for only a finite number of elements of [L.sup.k] and the translation L + y is possible for discrete values of y, only. That is, both integrals in Eq. 9 are approximated by sums. Furthermore, the intersection X [intersection] (L + y) must be replaced by its discretisation X [??] ([F.sup.k] + y) with respect to an adjacency system [F.sup.k] in [L.sup.k] where L = span [F.sup.k]. Finally, the translations y are from [sup.T][L.sup.n-k] instead of

[sup.[perpendicular to]L], where [sup.T][L.sup.n-k] is a translative complement according to Definition 4.

DISCRETISATION OF THE TRANSLATIVE INTEGRAL

For simplicity we restrict ourselves to the special case where X is observed on a cubic primitive lattice. Nevertheless, this is not a substantial restriction and the following considerations can be extended to arbitrary homogeneous lattices, too.

Let [C.sup.k] and [F.sup.k] be a lattice cell and an adjacency system of a section lattice [L.sup.k] of a[Z.sup.n], respectively. Denote by [sup.T][C.sup.n-k] a unit cell of the translation lattice [sup.T][L.sup.n-k] of [L.sup.k] (according Definition 4) and by proj [sup.T][C.sup.n-k] the orthogonal projection of [sup.T][C.sup.n-k] onto [sup.[perpendicular to]L] = [sup.[perpendicular to](span [L.sup.k]). Denote its volume by [vp.sub.n-k]/[a.sup.n-k] := Vol proj [sup.T][C.sup.n-k] and note that the ratio [vp.sub.n-k]/[a.sup.n-k] is an unsealed quantity. We have

[Vp.sub.n-k] = volproj [sup.T][C.sup.n-k] = Vol C/Vol [C.sup.k], k = 1, ... ,n - 1. (10)

Now, in analogy to the rectangular quadrature rule, the translative (inner) integral in Eq. 9 can be approximated by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (11)

where the local Euler number [[chi].sup.k.sub.0] is defined as in Eq. 5 but w. r. t. the adjacency system [F.sup.k] on the section lattice [L.sup.k].

The last expression can be considered as an estimator [p.sup.k.sub.X](L) of the translative integral [p.sup.k.sub.X](L). For a fixed section lattice [L.sup.k], the volume of proj [sup.T][C.sup.n-k] and thus [p.sup.k.sub.X](L) do not depend on the particular choice of [sup.T][C.sup.n-k]. This follows directly from Eq. 10 and the definition of the [L.sup.k], see Definition 4.

It can be seen that the right-hand side of Eq. 11 is a scalar product,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (12)

with [v.sub.k] = [2.sup.2k] - 1 and the local pixel configurations [[zeta].sub.l] [subset or equal to] [F.sup.0]([C.sup.k]) on [L.sup.k], where the indexing of the [[zeta].sub.l] is chosen analogously to the one for the [[xi].sub.l]. Notice that the vector [w.sup.(k)] = ([w.sup.(k).sub.l]) depends on the adjacency system IFk and the vector [h.sup.(k)] = ([h.sup.(k).sub.l]) depends on the sample X [intersection] [L.sup.k] of X on [L.sup.k].

The computation of the vectors [h.sup.(k)] involves access to all pixel values of the image. Therefore, this is the most time consuming part in the estimation of the translative integrals in Eq. 9. Thus, from the algorithmic point of view the following question arises: Is it possible to compute all translative integrals from the same h determined just once for a given set X and lattice [L.sup.n]? In order to use this one h for all dimensions k and all section lattices [L.sup.k], the vectors [w.sup.(k)] of weights have to be adapted, such that the scalar product [w.sup.(k)][h.sup.(k)] has a representation as [w.sup.(k)]h. In order to achieve this, we consider the following two cases:

(i) Due to Definition 4(iii), the section lattice [L.sup.k] has the property that there is a translation y [member of] [L.sup.n] such that [C.sup.k] + y [subset] C. Then it follows that [C.sup.k] = (C - y) [intersection] L and

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all x [member of] [L.sup.n]. This yields

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

From Eq. 5 we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all j [member of] {0, ... , [v.sub.k]} and all l [member of] {0, ... ,v} with [[zeta].sub.j] [subset or equal to] [[xi].sub.l] - y and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Furthermore, one gets

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for j = 0, ... , [v.sub.k]. Using this, Eq. 12 can be rewritten as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

defining the vector [w.sup.(k)] = ([w.sup.(k).sub.l]).

(ii) Now we treat those section lattices having the property that there is no translation y [member of] [L.sup.n] with [C.sup.k] + y [subset] C. Then Definition 4(iii) ensures that there are finitely many x [member of] [L.sup.n] such that the intersections [C.sup.k] [intersection] (C - x) generate a face-to-face tessellation of [C.sup.k]. This tessellation can be refined into a tessellation [g.sup.0] = {[P.sub.1], ... ,[P.sub.m]} of [C.sup.k] into k-simplices [P.sup.i] such that for each [P.sup.i] there is a [y.sub.i] [member of] [L.sup.n] with [P.sub.i] + [y.sub.i] [member of] C and [F.sup.0]([P.sup.i] + [y.sup.i]) [subset] [F.sup.0](C).

Then the adjacency system [F.sup.k] is generated by the tessellation [g.sub.0]. Making use of Eq. 7, it can be shown that [p.sup.k.sub.(L)] has the same form as above but with the weights

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for d = 0, ... ,v.

Summarising, we have shown that for all dimensions k and for all section lattices [L.sup.k], the translative integrals [p.sup.k.sub.(L)] in the Crofton formulae (Eq. 9) can be estimated via

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (13)

where L = span [L.sup.k] is the corresponding subspace.

DISCRETISATION OF THE INTEGRAL OVER ALL SUBSPACES

From the [L.sup.n]-sampling of X the estimator [p.sup.k.sub.X]([L.sub.i]) of the translative integral of Eq. 9 is known for finitely many subspaces [L.sup.i] = span [L.sup.k.sub.i] = 1, ... ,[M.sub.k], only. Hence, one has to find an appropriate approximation of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Applying a simple quadrature yields

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (14)

where [[gamma].sub.i.sup.(k)] are suitable weights. The choice of these weights is not trivial since the planes [L.sub.1] , .... , [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] are not uniformly scattered in [L.sup.k]. Moreover, the estimates [p.sup.k.sub.X]([L.sub.i]) of the [p.sup.k.sub.X]([L.sub.i]) are not of the same accuracy for different subspaces. In 2D, the 2[pi]-periodic rectangle rule leads to weights which are proportional to the lengths of the Voronoi arcs corresponding to directions of the straight lines [L.sub.i]. This geometric interpretation can be extended to higher dimensions which leads to a generalisation of the rectangular rule. For the special case of a cubic primitive lattice [L.sup.3] = a[Z.sup.3], a > 0, we have [[gamma].sub.i.sup.(1)] = [[gamma].sub.i.sup.(2)] for all i, and the numerical values are [[gamma].sub.i.sup.(k)] = 0.091556 for i = 1, 2, 3; [[gamma].sub.i.sup.(k)] = 0.073 961 for i = 4, ... ,9; [[gamma].sub.i.sup.(k)] = 0.070 391 for i = 10, ... , 13, see Lang et al. (2001).

Summarising formulae Eqs. 9, 13 and 14, we obtain the approximation [V.sub.n-k] (X) of [V.sub.n-k] (X) as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where the [w.sup.(i,k).sub.l] are the coefficients corresponding to the adjacency systems [F.sup.k.sub.i] on the subspaces [L.sub.i] according to Eq. 13.

The last equation shows that estimates of the intrinsic volumes [V.sub.n-k](X) can also be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (15)

with the scalar products [V.sup.(k)]h of the vectors [V.sup.(k)] = ([V.sup.(k).sub.l]) and h. We complete the above set of estimators by those of the volume [V.sub.n] and the Euler number [V.sub.0] of X:

[V.sub.n](X) = [a.sup.n][V.sup.(O)]h,

with the coefficients [v.sup.(O).sub.l] = vol C/[a.sup.n] for odd l, and [v.sup.(O).sub.l] = 0 otherwise;

[V.sub.O](X) = [V.sup.(n)]h,

with the coefficients [v.sup.(n).sub.l] := [w.sub.l] = [x.sup.n.sub.0] ([[xi].sub.l] [??] F]) where IF is an adjacency system on [L.sup.n].

For n = 3 we get [[alpha].sub.301] = [[alpha].sub.302] = 1/2. The intrinsic volumes [V.sub.2] and [V.sub.1], and thus the surface area S and the integral of the mean curvature M, can be estimated as

S(X) = 2[V.sub.2](X) = 4[a.sup.2][V.sup.(1)]h , M(X) = [pi][V.sub.1](X) = 2[pi][av.sup.(2)]h.

The surface area weights [4v.sup.(1)], also published in Schladitz et al. (2006), the weights 2[pi][v.sup.(2)] for the integral of mean curvature and the weights [V.sup.(3)] for the Euler number are presented in Table 1. The weights for the Euler number were first published in Ohser et al. (2002).

The surface area and the integral of mean curvature are rotation invariant functionals. Thus the weights can be presented for the representatives [[eta].sub.j] of the congruence classes [D.sub.j] of the pixel configurations [[xi].sub.0], ... , [[xi].sub.255]. Notice that for the surface area the weights for complementary representatives [[eta].sup.c.sub.j]] are the same as for [[eta].sub.j] while in the case of the integral of mean curvature the sign switches.

INTRINSIC VOLUME DENSITIES

Instead of deterministic sets we consider now random sets widely used as geometric models for constituents of microstructures. The characterisation of a constituent simplifies considerably in case of macroscopic homogeneity and even further if the microstructure is isotropic, too. In these cases, the intrinsic volume densities are important geometric characteristics of the constituents.

In principle, the intrinsic volume densities of a constituent can be estimated by the intrinsic volumes related to the volume of the observation window, see Chapter 4 in Ohser and Miicklich (2000) and Lang et al. (2001). Alternative approaches Klenk et al. (2006), Mrkvicka and Rataj (2008), Schmidt and Spodarev (2005) are based on solutions of systems of linear equations deduced from the local Steiner formula, see Section 4.4 in Schneider (1993), or the principal kinematic formula. These methods are studied in detail for the 2-dimensional case but work in principle in arbitrary dimensions. Comparisons for Boolean models in 2D in Guderlei et al. (2007) and Mrkvicka and Rataj (2008) show, that the accuracy of the resulting estimators is sometimes higher than of those given in Chapter 4 of Ohser and Mucklich (2000) using the present approach. However, so far none of these algorithms has been proved to work in practice in dimensions n [greater than or equal to] 3.

MACROSCOPIC HOMOGENEITY

Let [XI] be a macroscopically homogeneous random set on [R.sup.n] observed in a compact and convex window W with nonempty interior. Assume now that the realisations of [XI] belong to the extended convex ring almost surely and thus their intersections with W are polyconvex sets. Furthermore, assume that [XI] fulfils the integrability condition [E2#.sup.([XI][intersection]x]) < [infinity] for any compact and convex set K, where #X denotes the minimal number m such that the set X has a representation X = [K.sub.1] [union] ... [union] [K.sub.n] with compact and convex sets [K.sub.1] , ... , [K.sub.m]. Then the intrinsic volume densities [V.sub.V,k] of [XI] exist and can be defined by the limits

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

see, e.g., Schneider and Weil (2008), p. 398.

The random set [XI] may be observed on the homogeneous lattice [L.sup.n] with the unit cell C. By f1 Ln we denote the [L.sup.n]-sampling of [XI] where [L.sup.n] is a equipped with a pair (F, [F.sub.c],) of complementary adjacency systems. Furthermore, as in Section 4.4 the section lattices [L.sup.k.sub.i] of [L.sup.n] are equipped with pairs ([F.sup.k.sub.i],[F.sup.k.sub.c,i]) of complementary adjacency systems, i = 1, ... , [m.sub.k], k = 1, ... , n - 1. Again, for the sake of simplicity we concentrate on samplings on cubic primitive lattices.

Now the method described in Section 4.2 is adapted to the measurement of the volume density. We choose a window W such that [L.sup.n] [intersection] (W [??] C) [not equal to] [theta], where W [??] C is the window W reduced by the reflection of the unit cell C of [L.sup.n]. Furthermore, let h = ([h.sub.l]) be the vector of numbers of local configurations in [XI] [intersection] W [intersection] [L.sup.n],

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for l = 0, ... , v. Then estimators of the intrinsic volumes [V.sub.V,n-k] can be given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (16)

for k = 0, ... ,n. These estimators are usually biased for k > 0. Because of the macroscopic homogeneity of [XI], the expectations of the [V.sub.V,n-k] depend on the probabilities that the local configurations [[xi].sub.l] belong to the foreground [XI] and the complementary configurations 4,,-e are in the background [[XI].sup.c]. From vole = an and Ehel#(Ln n (we c)) = P(4e c [XI], [[xi].sub.v-l] [subset or equal to] [[XI].sup.c]) it follows that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (17)

In order to assess estimation errors in the theoretical considerations below, the above probabilities are expressed in terms of P([[XI].sup.l] [subset or equal to] [[XI].sup.c]). For each local configuration 4e and a point x [member of] [[xi].sub.l] one gets

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (17)

Recursion yields the linear equation system

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (18)

for l = 0, ... ,v, where the [b.sub.jl] are integers. (We remark that Eq. 18 as well as the explicit values of the [b.sub.jl] can be derived from the inclusion-exclusion formula, too.) Plugging (18) into (17) we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (19)

for k = 0, ... , n, where the weights [g.sup.(k).sub.j] are independent of [XI].

MACROSCOPIC HOMOGENEITY AND ISOTROPY

Let now [XI] be macroscopically homogeneous, isotropic and the distribution of [XI] is invariant under reflection at the origin. For cubic primitive lattices it is sufficient to restrict the following considerations to the congruence classes [D.sub.j] of the local pixel configurations. Then the probabilities in Eq. 17 can be rewritten as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all [[xi].sub.l] [member of] [D.sub.j] and the linear equation system (18) takes the form

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for l = 0, ... ,[v.sub.0] and with integer coefficients [b.sub.jl]. Obviously, [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for all l and, thus, the expectations of the intrinsic volumes can be expressed by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (20)

with the coefficients

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for i = 0, ... ,[v.sub.0] and k = 0, ... n.

Now we restrict the considerations to [R.sup.3]. Using the weights in the Table 1, appropriate estimators of the densities [S.sub.V], [M.sub.V] and [[chi].sub.V] of the surface area, the integral of the mean curvature and the Euler number are

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

respectively. Their expectations are

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

respectively. The values of the [g.sup.-(k).sub.j] are listed in Table 2.

INTRINSIC VOLUME DENSITIES OF BOOLEAN MODELS

Now we consider Boolean models sampled on a cubic lattice [L.sup.n] = a[Z.sup.n], a > 0. In this section we present relationships between the expectations of the intrinsic volume densities of sampled Boolean models, the density of the germs and the corresponding expectations of the intrinsic volumes of the grains. Following Serra (1982) p. 492ff and p. 557, we derive formulae for [L.sup.n]-samplings of Boolean models connecting the parameters of the Boolean models with the expectations of the estimators [V.sub.v,k] of the densities of the intrinsic volumes. Comparisons with Miles' formulae yields the asymptotic bias of the estimators.

BOOLEAN MODELS IN [R.sup.n]

Let [PHI] = {[x.sub.1], [x.sub.2], ...} I denote a macroscopically homogeneous Poisson point field in [R.sup.n] (the point field of germs) with point density [lambda], > 0 and [[XI].sub.1], [[XI].sub.2], ... a sequence of independent and identically distributed (i. i. d.) random, compact and convex sets (the grains) with nonempty interior and independent of [PHI]. The corresponding Boolean model is defined as the random closed set

[XI] = [infinity] [union] j = 1 ([XI] + [x.sub.j]).

For more detailed definitions and explanations see Matheron (1975); Schneider and Weil (2008); Molchanov (1997). In the following we assume that the random grains =i are isotropic and invariant w.r.t. reflection at the origin. Then , is isotropic, too, and invariant w. r. t. reflection at the origin. Moreover, assume [EV.sub.k]([[XI].sub.1]) < [infinity] for k = 1, ... n.

With probability one the intersection of two grains is either empty or has nonempty interior. Then from the consistency relation for the Euler number and Crofton's intersection formulae (9) it follows that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

For Boolean models, the probabilities occurring on the right hand side of Eq. 20 can be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The expectations of volumes occurring on the right hand side of this equation can be calculated approximately by the Steiner formula when substituting [[eta].sub.l] with its convex hull [F.sub.l] = conv [[eta].sub.l]. We can assume [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] which follows for particular cases from the following lemmas.

Lemma 1 Let K be a compact and convex set with nonempty interior, then

[V.sub.n](K [??] [0,au]) - [V.sub.n](K [??] {o,au}) = 0(a), u [member of] [S.sup.n-1] as a [down arrow] 0.

Proof For the Minkowski addition of K with the segment [0, au], a > 0, we have

[V.sub.n](K[??] [0, au]) = [V.sub.n](K) + a[V.sub.n-1] ([PI](K, [sup.[perpendicular to] span u])), (21)

where [PI](K,[sup.[perpendicular to] span u]) is the orthogonal projection of K onto the n--1-dimensional subspace [sup.[perpendicular to] span u] orthogonal to the straight line spanned by u. On the other hand

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (22)

where cov(K,an) = [V.sub.n] (K [intersection] (K + au)) denotes the covariogram function of the set K w.r.t.u. Now, since V (K) = cov(K, 0) and

[V.sub.n-1]([PI](K,[sup.[perpendicular to] span u])) = -[[d/dt cov (K,tu)].sub.t = 0+],

see Section 4.3 in Matheron (1975), it follows that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

and thus

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

We remark that Lemma 1 holds more generally for configurations [xi] [subset or equal to] F (C) and F = conv [xi]. This is a consequence of Corollary 2.(2) of Kiderlen and Rataj (2006) as the support function of a general nonempty compact set in [R.sup.n] is defined as the support function of its convex hull.

Lemma 2 For n [greater than or equal to] 3, balls BY with fixed radius r, configurations [xi] [subset or equal to] [F.sup.0] (C) and F = conv [xi] with dim F [less than or equal to] 2 one gets

[V.sub.n]([B.sub.r][??]F) - [V.sub.n]([B.sub.r][??][xi]) = o([a.sup.2]) as a [down arrow] 0.

Proof First we observe that the distance between 4 and F is smaller than the space diagonal of the unit cell, max [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. For all a < r / [square root of] n we can choose t = [square root of] [r.sup.2] - [n.sup.a2]. Then it follows that F [??] [B.sub.t] [subset] [xi] [??] [B.sub.r] [subset] F [??] [B.sub.r].

Now we replace F [??] [B.sub.t] with a non-convex set having enlarged spherical sectors at the vertices of F. Let H(F, u) be a supporting hyperplane of F with normal direction u and let N(F, x) = {u [member of] [R.sup.n] \ {0} : x [member of] H(F, u)} [union] {0} denote the normal cone of F at x [member of] F, see Schneider (1993), p. 70. Then N(F,x) [intersection] [B.sub.r] is the normal cone restricted to the ball [B.sub.r]. The spherical sectors of F at the vertices x are given by [F.sub.r](x) = {u + x : u [member of] N(F x) [intersection] [B.sub.r]}. Using this one obtains

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (23)

for all x,y [member of] [xi] with x [not equal to] y, the Steiner formula implies that dim F

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Notice that since the intrinsic volumes [V.sub.j] are j-homogeneous, [V.sub.j] (F/a) = 1/[a.sup.j] [V.sub.j] (F) for a > 0, where the [V.sub.j] (F/a) are independent of the lattice spacing a. Now from Eq. 23, the k-homogeneity of [V.sub.k] and with the above choice for t we get the estimation

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (24)

Finally, the assertion of the above lemma follows from

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

In order to estimate the error introduced by replacing [[eta].sub.l] with its convex hull [F.sub.l] = conv [[eta].sub.l] we have to derive lemmas similar to 1 and 2 but for the respective expectations.

Lemma 3 Let X be a random compact and convex set whose distribution is isotropic and invariant w.r.t. reflection at the origin and whose interior is a. s. nonempty. Assume that [EV.sub.n](X) < [infinity] and that there is an [epsilon] > 0 such that a. s. [B.sub.[epsilon]] [subset or equal to] X, then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The assumptions [EV.sub.n](X) < [infinity] and [B.sub.[epsilon]] [subset or equal to] X a. s. yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

see Schneider (1993, p. 327), originally due to Wills (1970). Together with the convexity of X this in turn ensures that [EV.sub.n-1] ([PI](X,[sup.[perpendicular to] span u])) < [infinity] for all u [member of] [S.sup.n-1] giving an integrable upper bound for the left hand side. This finally allows to interchange limit and expectation and the assertion follows from Lemma 1.

Lemma 4 For n [greter than or equal to] 3, let [B.sub.r] [subset or equal to] [R.sup.n] be a ball of random diameter with r [greter than or equal to] [epsilon] > 0 a. s. and [Er.sup.n] < [infinity]. Then for all configurations [xi] [subset or equal to] [F.sup.0](C) and F = conv[xi] with dim F [less than or equal to] 2 one gets

E([V.sub.n] ([B.sub.r] [??] F) - [V.sub.n] ([B.sub.r] [??] [xi])) = o([a.sup.2])

Proof Eq. (24) and the assumption [Er.sup.n] < [infinity] yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

and thus E([V.sub.n]([B.sub.r] [??] F) - [V.sub.n]([B.sub.r] [??] [xi])) = o([a.sup.2]) using the same argument as in Lemma 2.

We remark that for every function f : R [right arrow] R with f (a) = o([a.sup.m]) as a [down arrow] 0, m > 0, it follows that 1- [e.sup.f(a)] = o([a.sup.m]).

As [F.sub.l] is convex, an application of the principal kinematic formula to macroscopic homogeneous Boolean models gives

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

see Schneider and Weil (2008), p. 380. From the j-homogeneity of the intrinsic volumes [V.sub.j] it follows that the probability P([F.sub.l] [subset][[XI].sup.c]) can be considered as a function [f.sub.l] of the lattice distance a,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where the [V.sub.j] ([F.sub.l]/a) are independent of a. Note that [f.sub.l](a) = [f.sub.l](0) for [F.sub.l] with dim [F.sub.l] = 0. For [F.sub.l] with dim [F.sub.l] > 0 we now use a Taylor expansion of [f.sub.l],

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (25)

where [f.sup.(i).sub.l] is the ith derivative of [f.sub.l].

From the above approach and Eq. 20, the expectations of the estimators [V.sub.Vn-k]([XI]) can be expressed in terms of the derivatives of the functions [f.sub.l]. Using Lemma 3 and Lemma 4, respectively, we can formulate the following theorems.

Theorem 1 Let [XI] be a homogeneous and isotropic Boolean model with random, compact, convex grains whose distribution is invariant w. r. t. reflection at the origin. If there is an [epsilon] > 0 such that a. s. [B.sub.[epsilon]] [subset or equal to] [[XI].sub.1] and [EV.sub.n]([[XI].sub.1]) < [infininty] then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (26)

Proof We recall that [V.sub.Vn-1]([XI]) is estimated from the data sampled on 1D section lattices. As a consequence, dim [F.sub.1] is 0 or 1.

Now plugging the result of Lemma 3 into Eq. 20 yields

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The assertion of the theorem now follows from the series expansion Eq. 25.

Theorem 2 Let be a Boolean model in I18n, n [greater than or equal to] 3, with balls of random diameter r. If r > [epsilon] > 0 a. s. and [Er.sup.n] < [infinity], then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (27)

as a [down arrow] 0 and for k = 1,2.

Proof We make use of the fact that [V.sub.Vn-1]([XI]) and [V.sub.Vn-2]([XI]) are estimated from 1D and 2D section lattices, respectively, and thus dim [F.sub.l] [less than or equal to] 2 meeting the assumptions of Lemma 4.

Then plugging the result of Lemma 4 into Eq. 20 and using Eq. 25 in the same way as in the proof of Theorem 1 yields Eq. 27.

BOOLEAN MODELS IN [R.sup.3]

We specialise to the 3D case from now on. Let V, S, b denote the expectations of the volume, the expectation of surface area, and the expectation of the mean breadth of the grain [[XI].sub.1], i.e., [EV.sub.3] ([[XI].sub.1]) = V, [2EV.sub.2]([[XI].sub.1]) = S and 1/2 [EV.sub.1]([[XI].sub.1]) = b. Then the surface density [S.sub.V] = [2V.sub.v,2]([XI]), the density of the integral of the mean curvature [M.sub.V] = [pi][V.sub.v,1]([XI]), and the density of the Euler number [chi]v = [V.sub.v,0]([XI]) of a Boolean model can be expressed in terms of [lambda], V, S, and b by Miles' formulae

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (28)

see Miles (1976) and Theorem 9.1.4 in Schneider and Weil (2008). On the other hand the expectations of the corresponding estimators according to Eqs. 26 and 27 have a structure similar to Miles' formulae,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (29)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (30)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (31)

where the constants [c.sub.1], [c.sub.2], and [c.sub.3] depend on the chosen pair of complementary adjacency systems (F,[F.sub.c]), see Table 4. Notice that the values for [c.sub.1], [c.sub.2], and [c.sub.3] correspond to those ones published in Ohser et al. (2003) for a Boolean model with balls of constant diameter.

In order to show that Eqs. 29 and 30 follow directly from Eqs. 26 and 27, respectively, we introduce the volume [v.sub.l], the surface area [s.sub.l], and the mean breadth [b.sub.l] of the set 1/2 [F.sub.l]. Using these notations, the function [f.sub.l] can be rewritten as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The first derivatives of [f.sub.l] at a = 0 are

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

For k = 1, it can be seen from the values in the Tables 2 and 3 that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

which yields Eq. 29. For k = 2 it follows that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

and from Eq. 27 one obtains Eq. 30.

Finally, consider the case k = 3. Independent of the choice of a pair (F, [F.sub.c]) of complementary adjacency systems, it can be seen that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

which yields Eq. 31 where the coefficients cl, c2, c3 are computed via

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

In order to assess the asymptotic behaviour for a [down arrow] 0 of the estimators [S.sub.V], [M.sub.V], and [[chi].sub.V], Eqs. 29, 30, and 31 are compared with Miles' formulae. It can bee seen that [S.sub.V] is asymptotically unbiased for a [down arrow] 0 (multigrid convergent). This is related to the fact that the estimators of the Euler numbers of 1D Boolean models are asymptotically unbiased, see Serra (1982).

For Boolean models with balls of random diameters it can be shown that the asymptotic bias of [M.sub.V] is

lim/a [down arrow] 0 [EM.sub.v] - [M.sub.V] = -0.045872 [[lambda].sup.2][S.sup.-2] [e.sup.-[lambda]V].

This corresponds to a result in Serra (1982), where the estimation of the Euler number of a planar Boolean model was shown to be asymptotically biased. In order to assess the asymptotic bias of [[chi].sub.V], the constants c1, c2, c3 have to be compared with the respective ones in Eq. 28. Obviously, [[chi].sub.V] is always biased. More precisely, the asymptotic bias is even infinite for the pairs ([F.sub.6],[F.sub.26]), ([F.sub.14.1],[F.sub.14.1]) and ([F.sub.14.2],[F.sub.14.2]).

For ([F.sub.26],[F.sub.6]) the coefficient cl in Eq. 31 vanishes and thus the difference of the right-hand sides of Eqs. 28 and 31 is finite. However, the error in Eq. 31 can not be estimated and thus the asymptotic behaviour of [[chi].sub.V] is unknown for ([F.sub.26],[F.sub.6]).

DISCUSSION

The probably most intuitive method for measuring the surface area is based on rendering data, see, e.g., Lindblad and Nystr6m (2002), where the areas of the surface patches serve as weights for computing the surface area from local knowledge, i.e., from the numbers of pixel configurations. However, this type of estimator is not multigrid convergent. There are alternative methods also based on an explicit approximation of the boundary without further assumptions but ensuring multigrid convergence, see Klette and Rosenfeld (2004) for an overview. However, these approximations are expensive since they are not local.

As pointed out in Section 4.2, the surface area can be measured directly from the binary volume image without need to approximate the surface. We are starting from the local knowledge represented by the numbers of 2 x 2 x 2 pixel configurations on cubic primitive lattices and ask for the best choice of surface weights. The weights suggested by Lindblad (2005) minimise the estimation variance of the surface area of a plane with random normal direction uniformly distributed on the unit sphere. This idea goes back to Mullikin and Verbeek (1993), see also the discussion in Windreich et al. (2003). A comprehensive treatment of the subject of surface estimation is due to Ziegel and Kiderlen (2009). Their weights minimise the asymptotic worst case error for surface area estimation for decreasing lattice distances (multigrid convergence). This approach is based on a general asymptotic result proved in Kiderlen and Rataj (2006). It also allows a comparison of the various methods for surface estimation. As shown in Ziegel and Kiderlen (2009), the maximum asymptotic relative error for general sets X is 12.8% for the weights suggested in Lindblad and Nystr6m (2002), 7.3% for the weights given in Lindblad (2005) and Schladitz et al. (2006) and 4.0% for the best choice in Ziegel and Kiderlen (2009).

The approach based on the Crofton formulae has a number of advantages. First, the method of surface area estimation can simply be extended to arbitrary dimensions and to most of the other intrinsic volumes, in particular the integral of the mean curvature which measures e.g. the length of fibres in non-wovens or the total length of edges of open foams. Furthermore, this approach works for arbitrary homogeneous lattices so that we are no longer restricted to cubic primitive lattices, see Chapter 4 in Ohser and Mucklich (2000) and Lang et al. (2001). This is an important fact since many imaging techniques like nano-tomography by electron microscopy combined with focused ion beam slicing produce images on non-cubic lattices.

The diverging bias of the Euler number estimators of Boolean models is due to the huge number of tiny 'tunnels' and single background pixels between just touching grains in discretisations. These tunnels and single pixels can be removed by smoothing the surface, e.g., with a morphological closure before determining the Euler number. On the other hand, when assuming alternative (and even more realistic) sampling models, e.g., suggested in Hall and Molchanov (1999), the bias in [[chi].sub.V] is probably much smaller than for the [L.sup.n]-sampling considered in the present paper.

ACKNOWLEDGEMENTS

The authors very much appreciate fruitful comments by an unknown referee and Markus Kiderlen whose suggestions improved the paper considerably. Katja Schladitz was supported by the Rheinland-Pfalz cluster of excellence "Dependable Adaptive Systems and Mathematical Modelling" (http://www.dasmod.de/). The research of Joachim Ohser was supported by the [FH.sup.3]-programme of the German Federal Ministry of Education and Research under project grant 1711B06.

(Accepted May 12, 2009)

REFERENCES

Blasquez I, Poiraudeau JF (2003). Efficient processing of Minkowski functionals on a 3d binary image using binary decision diagrams. In: Journal of WSCG, vol. 11 (1). WSCG, Plzen, Czech Republic: UNION AgencyScience Press.

Guderlei R, Klenk S, Mayer J, Schmidt V, Spodarev E (2007). Algorithms for the computation of Minkowski functionals of deterministic and random polyconvex sets. Image Vision Comput 25:464-74.

Hadwiger H (1957). Vorlesungen uber Inhalt, Oberflache and Isoperimetrie. Berlin: Springer-Verlag.

Hall P, Molchanov IS (1999). Corrections for systematic boundary effects in pixel-based area counts. Pattern Recogn 32:1519-28.

Jernot J, Jouannot-Chesney P, Lantuejoul C (2004). Local contributions to the Euler-Poincare characteristic of a set. J Microsc 215:40-9.

Kiderlen M, Rataj J (2006). On infinitesimal increase of volumes of morphological transforms. Mathematica 53:103-27.

Klenk S, Schmidt V, Spodarev E (2006). A new algorithmic approach to the computation of Minkiwski functionals of germ-grain models. Comp Geom Th Appl 34:127-48.

Klette R, Rosenfeld A (2004). Digital Geometry. Amsterdam: Morgan & Kaufman Publ.

Lachaud JO, Montanvert A (2000). Continuous analogs of digital boundaries: A topological approach to isosurfaces. Graph Models 62:129-64.

Lang C, Ohser J, Hilfer R (2001). On the analysis of spatial binary images. J Microsc 203:303-13.

Lindblad J (2005). Surface area estimation of digitized 3D objects using weighted local computations. Image Vision Comput 23:111-22.

Lindblad J, Nystr6m I (2002). Surface area estimation of digitized 3D objects using local computations. In: 10th International Conference on Discrete Geometry for Computer Imagery, vol. 2301 of LNCS. DGCI, Bordeaux, France, Berlin, Heidelberg, New York: Springer.

Matheron G (1975). Random Sets and Integral Geometry. New York, London: John Wiley & Sons.

Miles RE (1976). Estimating aggregate and overall characteristics from thick selections by transmission microscopy. J Microsc 107:227-33.

Molchanov IS (1997). Statistics of the Boolean Model for Practitioners and Mathematicans. New York: J Wiley & Sons.

Mrkvicka T, Rataj J (2008). On the estimation of intrinsic volume densities of stationary random closed sets. Stoch Proc Appl 118:213-31.

Mullikin J, Verbeek P (1993). Surface estimation of digital planes. Bioimaging 1:6-16.

Nagel W Ohser J, Pischang K (2000). An integralgeometric approach for the Euler-Poincare characteristic of spatial images. J Microsc 198:54-62.

Ohser J, Mucklich F (2000). Statistical Analysis of Microstructures in Materials Science. Chichester, New York: J Wiley & Sons.

Ohser J, Nagel W Schladitz K (2002). The Enter number of discretized sets--on the choice of adjacency in homogeneous lattices. In: Mecke KR, Stoyan D, eds., Morphology of Condensed Matter, Lecture Notes in Physics. Berlin: Springer.

Ohser J, Nagel W Schladitz K (2003). The Enter number of discretised sets--surprising results in three dimensions. Image Anal Stereo122:11-9.

Rataj J, Zahle M (2003). Normal cycles of Lipschitz manifolds by approximation with parallel sets. Differ Geom Appl 19:113-26.

Schladitz K, Ohser J, Nagel W (2006). Measurement of intrinsic volumes of sets observed on lattices. In: Kuba A, Nyul LG, Palagyi K, eds., 13th Int Conf Discrete Geom Computer Imagery, LNCS. DGCI, Szeged, Hungary, Berlin, Heidelberg, New York: Springer.

Schmidt V, Spodarev E (2005). Joint estimators for the specific intrinsic volumes of stationary random sets. Stoch Proc Appl 115:959-81.

SchneiderR (1993). Convex Bodies: The Brunn-Minkowski Theory. Cambridge: Encyclopedia of Mathematics and Its Application Vol. 44, Cambridge University Press.

Schneider R, Weil W (2008). Stochastic and Integral Geometry. Probability and Its Application. Heidelberg: Springer.

Serra J (1982). Image Analysis and Mathematical Morphology, Vol. 1. London: Academic Press.

Wills JM (1970). Zum Verhaltnis von Volumen zu OberMche bei konvexen Korpern. Arch Math 21:557-60.

Windreich G, Kiryati N, Lohmann G (2003). Surface area estimation in practice. In: Nystrom I, di Baja GS, Svensson S, eds., 11th Int Conf Discrete Geom Computer Imagery, vol. 2886 of LNCS. DGCI, Naples, Italy, Berlin, Heidelberg, New York: Springer.

Ziegel J, Kiderlen M (2009). Estimation of the surface area and surface area measure of three-dimensional sets from digitizations. Image Vision Comput, in press.

JOACHIM OHSER (1), WERNER NAGEL (2) AND KATJA SCHLADITZ (3)

(1) Hochschule Darmstadt, Fachbereich Mathematik and Naturwissenschaften, Schofferstrasse 3, D-64295 Darmstadt, Germany; (2) Friedrich-Schiller-Universitat Jena, Institut fur Stochastik, D-07737 Jena, Germany; (3) fsFraunhofer-Institut fur Techno-and Wirtschaftsmathematik, Abteilung BildverarbeiLung, Fraunhofer-Platz 1, D-67663 Kaiserslautern, Germany e-mail: jo@h-da.de, nagel@minet.uni-jena.de, katja.schladitz@itwm.fraunhofer.de

With the fast development of new materials like foams or fibre reinforced composites there is a growing need for non-destructive testing and structure characterisation. Often, geometric characteristics of the whole structure have to be estimated from the given 2D or 3D image of a small sample. A very attractive set of geometric characteristics are the intrinsic volumes (or quermassintegrals or Minkowski functionals). On the one hand, they include the widely used volume V, surface area S, and Euler number [chi]. On the other hand, they are in some sense complete, see Hadwiger (1957). The fourth intrinsic volume in 3D--the integral of mean curvature M--has nice interpretations for various structures, too. In particular for random fibre systems, it is proportional to the total fibre length.

Throughout this paper, we assume that the structure of interest is observed in an n-dimensional binary digital image. That is, the structure is given by its intersection with a lattice and a cuboidal window and values associated the lattice points indicating structure (1) or background (0).

The well known integral geometric Crofton formulae provides a method for determining the intrinsic volumes from lower dimensional sections of the structure. A discretisation of this formula is the basis of our method, see also Chapter 4 in Ohser and Mucklich (2000) and Lang et al. (2001). The Crofton formulae reduce the estimation of intrinsic volumes to the estimation of the Euler number in lower dimensional sections. Therefore, the present paper is based on thorough investigations of digital connectivity and consistent estimation of the Euler number, see Nagel et al. (2000); Ohser et al. (2002; 2003); Schladitz et al. (2006). The consistency results for the Euler number estimates of foreground and background established in Ohser et al. (2002) carry over to all intrinsic volumes. In order to give the reader a comprehensive description of our approach making the latter as self-contained as possible, we recall some facts addressed in the papers mentioned above. In the present paper it is shown that this approach can be extended on all intrinsic volumes in arbitrary dimensions.

In order to check the accuracy of the proposed method, the bias of the estimators is computed for macroscopically homogeneous (stationary) and isotropic Boolean models. Using ideas of Serra (1982), we show that our surface area estimator is multigrid convergent for this very rich class of sets. However, the bias of the estimators for the integral of mean curvature and for the Euler number does not necessarily vanish with decreasing lattice distance. Even worse, for three out of the four adjacency systems examined, the bias of the Euler number estimator diverges. Nevertheless, for lattice distances in the range of 1% to 10% of the mean grain size of the Boolean model, the estimation is sufficiently accurate for practical applications. The explicit formulae for the bias of the estimators lead to formulae connecting the estimated intrinsic volumes with the parameters of the Boolean model. The structure of these formulae resembles the original Miles' formulae (Miles, 1976) in the Euclidean space with additional terms correcting for the discretisation effects.

The presented method yields a fast algorithm for simultaneously determining the intrinsic volumes and their densities. The core of the algorithm consists in a convolution of the binary image with a suitably chosen [2.sup.n] mask resulting in a grey value image, see Lang et al. (2001); Ohser and Mucklich (2000). All further steps are based solely on the grey value histogram whose size does not depend on image size or content. Thus the advantage over other methods for estimating the intrinsic volumes, see Blasquez and Poiraudeau (2003); Schmidt and Spodarev (2005) are simplicity and speed of the algorithm. The surface area in 31) is measured directly from the binary volume image without need to approximate the surface. Moreover, compared to empirical marching cubes methods like in Windreich et al. (2003), only a small number of pixel configurations has to be taken into account. In Schladitz et al. (2006) the weights for the surface are compared with those of Lindblad and Nystrom (2002), see also Ziegel and Kiderlen (2009) for a sound investigation of surface area estimation.

This paper is organised as follows: First we repeat some facts about homogeneous lattices and summarise results on adjacency systems and Euler number estimation from Nagel et al. (2000); Ohser et al. (2002; 2003); Schladitz et al. (2006). Based on concepts of section lattices and their translative complements, we derive discrete versions of the Crofton formulae for polyconvex sets and from these, estimators for the densities of the intrinsic volumes of random sets. In particular, we compute weights for the estimation of the density of the integral of the mean curvature in [R.sup.3]. Finally, we present Miles' formulae for Boolean models in [R.sup.n] sampled on homogeneous lattices. In principle, we follow Ohser et al. (2003) where formulae are given for the density of the Euler number of Boolean models in [R.sup.3] with balls of constant diameter. These results are generalised as follows: We derive formulae for the expectations of the densities of the intrinsic volumes for Boolean models with convex grains. Advantages and drawbacks of the presented method are discussed in the last section.

POINT LATTICES AND PIXEL CONFIGURATIONS

Image data are usually given on homogeneous point lattices, e.g., the cubic primitive lattice [L.sup.n] = a[Z.sup.n], a > 0, where Z denotes the set of integers and a is the lattice distance. Of course, most images are given on orthogonal lattices. However, we will consider lower dimensional section lattices of cubic or orthorhombic lattices, too, which are not necessarily orthogonal. Hence we introduce homogeneous lattices in a more general setting.

Let [u.sub.1], ... , [u.sub.n] [member of] [R.sup.n] form a basis of [R.sup.n] and let U = ([u.sub.1], ... , [u.sub.n]) be the matrix of column vectors. Then [L.sup.n] = U[Z.sup.n] is called an n-dimensional homogeneous lattice. The closed unit cell of [L.sup.n] w. r. t. the basis [u.sub.1], ... , [u.sub.n] is the Minkowski sum C = [0, [u.sub.1]] [symmetry] ... [symmetry] [0, [u.sub.n]] of the segments [0, [u.sub.i]] between the origin 0 and the lattice points [u.sub.i]. Its volume is vo1C = [parallel] det U > 0, and the value of [parallel] det U does not depend on the choice of the lattice basis.

The intersection X [intersection] [L.sup.n] of a compact set X [subset] [R.sup.n] and a homogeneous lattice [L.sup.n] is called a [L.sup.n]-sampling of X. In the language of image processing, X [intersection] [L.sup.n] is the set of foreground pixels and [X.sup.c] [intersection] [L.sup.n] is the background.

Locally, an [L.sup.n]-sampling of X can be described by pixel configurations which are specified as follows: The vertices of the unit cell C are indexed, and we write [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] with the index [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Clearly, the unit cell C has 2n vertices, [x.sub.j] [member of] [F.sup.0] (C), j = 0, ... , [2.sup.n]-1, where [F.sup.0] (C) denotes the set of vertices of C. In a similar way we introduce the indices for all subsets [xi] [subset or equal to] [F.sup.0] (C). Let 1 denote the indicator function, i.e., 1(x [member of] [xi]) = 1 if [member of] [xi] and 1(x [member of] [xi]) = 0 otherwise. An index f is assigned to a [xi], and we write [[xi].sub.l] if

l = [[2.sup.n]-1 summation over (j=0)] [2.sup.j] * 1([x.sub.j] [member of] [xi]), (1)

for all [xi] [subset or equal to][F.sup.0](C). We have l [member of] {0, ... ,v} with v = [2.sup.2n] - 1. That means, the powers of 2 are used for encoding the vertices. Notice that [[xi].sub.0] = [empty set], [[xi].sub.v], = [F.sup.0](C), and [[xi].sub.v-l] = [[xi].sub.v] [[xi].sub.l]. The set [[xi].sub.l] can be considered as a local pixel configuration of the foreground.

We use pictograms to illustrate configurations where full discs mark foreground pixels and empty discs mark background pixels, see Table 1 for examples. Sets of pixel configurations are denoted by pictograms with vertices not marked with a disc, which can be either foreground or background pixels, see Table 2.

In the case of a cubic primitive lattice which is highly symmetric, the pixel configurations [[xi].sub.l] [subset or equal to] [F.sup.0] (C) are commonly grouped in equivalence classes. Let M be the set of all linear isometrics (rigid motions and reflections) leaving [L.sup.n] unchanged, i.e., [theta][L.sup.n] = Ln for all [theta] [member of] M. The configuration [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is equivalent to [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] if there is a [theta] [member of] M and a y [member of] [L.sup.n] such that [theta] [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] + y = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. By [D.sub.0], ... , [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] we denote the congruence classes of {[[xi].sub.0], ... ,[[xi].sub.v]} under M. Furthermore, we choose a system {[[eta].sub.0], ... , [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]} of representatives [[eta].sub.j] [member of] [D.sub.j]. We write [[eta].sup.c.sub.j] for a representative of the equivalence class of [F.sup.0](C) \ [[eta].sub.j].

Since the intrinsic volumes are motion invariant characteristics, their weights can be presented in terms of the congruence classes instead for the complete set of pixel configurations. The [v.sub.0] + 1 = 22 congruence classes in the 3D case are given in Table 1 with our choice of representatives [[eta].sub.0], ... , [[eta].sub.21].

ADJACENCY AND EULER NUMBER

In the literature the adjacency relation of lattice points (or pixels) is usually characterised by a neighbourhood graph and the complementarity of adjacencies is defined via the Jordan surface theorem (Jordan-Brouwer theorem), see, e.g., Lachaud and Montanvert (2000). Here we follow Ohser et al. (2003); Schladitz et al. (2006) where the definition of adjacency is based on a consistency relation for the Euler number.

We first consider the convex hulls [F.sub.l] = conv [[xi].sub.l] of a configuration [[xi].sub.l] forming convex polytopes with [F.sub.l] [subset or equal to] C and [F.sup.0]([F.sub.l]) [subset or equal to] [F.sup.0](C), l = 1, ... , v. We set [F.sub.0] = [theta]. Let [F.sup.j] (F) denote the set of all j-dimensional faces of a convex polytope F. For a set F of convex polytopes write [F.sup.j](F) = [union] {[F.sup.j](F) : F [member of] F} using the convention [union] {[F.sup.j](F) : F [member of] F} = [[union].sub.F[member of]F][F.sup.j](F). Furthermore, by A we denote the topological closure of a set A [subset] [R.sup.n] and #N denotes the number of elements of a finite set N.

Definition 1 Let [F.sub.loc] [subset or equal to] {[F.sub.0], ... ,[F.sub.v]} be a set of convex polytopes [F.sub.l] = conv [[xi].sub.l] fulfilling the conditions

(i) [theta] [member of] [F.sub.loc], C [member of] [F.sub.loc],

(ii) if F [member of] [F.sub.loc] then [F.sup.i](F) [subset] [F.sub.loc] for i = 0, ... , dim F,

(iii) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

(iv) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Then [F.sub.loc] is called a local adjacency system and F = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]([F.sub.loc] + x) is said to be an adjacency system of the lattice [L.sup.n].

From (i) it immediately follows that [F.sup.0] (F) = [L.sup.n]. The conditions (ii) and (iii) ensure that the Euler number of the unions [union]{F [member of] F : [F.sup.0](F) [subset] [[xi].sub.l]}, l = 0, ... , v, can be computed via the Euler-Poincare formula and the inclusion-exclusion principle, see Schneider (1993). Condition (iv) prevents the existence of many different local adjacency systems generated from the same 'basic bricks'.

The pair [GAMMA] = ([F.sup.0](F), [F.sup.1](F)) is said to be the neighbourhood graph of F; it consists of the set [F.sup.0] (F) of vertices and the set [F.sup.1](F) of edges. All vertices are of the same order since [GAMMA] is homogeneous, [GAMMA] + x = [GAMMA], x [member of] [L.sup.k]. The order of the vertices is called the connectivity of [L.sup.n]. We write [F.sub.m] if the corresponding neighbourhood graph is m-connected.

For n = 3 we recall the adjacency systems [F.sub.6], [F.sub.14.1], [F.sub.14.2], and [F.sub.26] considered in detail in Ohser et al. (2002; 2003).

-- [F.sub.6] is generated by the singleton containing the unit cell C, i.e., [F.sub.6] = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] [[union].sup.3].sub.j=0][F.sup.j] (C + x).

-- [F.sub.14.1] is generated by the tessellation of C into the 6 tetrahedra [F.sub.139], [F.sub.141], [F.sub.163], [F.sub.177], [F.sub.197], [F.sub.209], i.e., [F.sub.14.1] is the smallest adjacency system containing these tetrahedra.

-- [F.sub.14.2] is generated by the family of tetrahedra [F.sub.43], [F.sub.41], [F.sub.49], [F.sub.69], [F.sub.77], and [F.sub.212]

-- The maximum adjacency system [F.sub.26] on [L.sup.3] is generated by [F.sub.loc] = {[F.sub.0], ... , [F.sub.255]} .

Now we introduce a discretisation of a set w.r.t. a given adjacency system.

Definition 2 The discretisation X [??] F of a compact subset X [subset] [R.sup.n] w.r.t. a given adjacency system F is defined as the union of all elements of F that have all their vertices in X, i.e.,

X [??] F = [union]{F [member of] F : [F.sup.0](F) [subset or equal to] X}. (2)

An adjacency system F can be seen as a set of 'bricks' of the discretisation where a 'brick' F [member of] F is a subset of the discretisation of X if and only if all vertices of F belong to X. Notice that X [??] F = (X [intersection] [L.sup.n]) [??] F, i.e., the discretisation X [??] F is determined by the [L.sup.n]-sampling of X alone.

As in Ohser et al. (2002; 2003); Schladitz et al. (2006) we approximate X by a discretisation X [??] F w. r. t. an adjacency system F. Since the set X [??] F forms a (not necessarily convex) polyhedron, the number #[F.sup.j] (X [??] F) of elements of [F.sup.j] (X [??] F) is finite and, therefore, the Euler number [chi] (X [??] F) can be computed via the Euler-Poincare formula,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (3)

In order to apply a "local method" for measuring the Euler number we consider a local version of the Euler-Poincare formula (Eq. 3). The conditions (ii) and (iii) in Definition 1 ensure that the Euler number of a discretisation X [??] IF can be computed from local knowledge. We observe that for the local configuration [xi] = X [intersection] C [intersection] [L.sup.n] we have [xi] [??] F = (X [??] F) [intersection] C. Now we define the weights

[[mu].sub.F] = min {j : there is a G [member of] [F.sup.j] (C) with F [subset or equal to] G}, (4)

for correcting effects occurring at the cells' edges. The expression [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is the number of lattice cells covering F, i.e., the face F belongs to totally [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] neighbouring cells. Thus, the reciprocal weight [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] should be used when counting F locally. Now the number [[chi].sup.n.sub.0] can be introduced as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (5)

for l = 0, ... , v. We have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for all x [member of][L.siup.n], cf. also Jernot et al. (2004). In fact, [[chi].sup.n.sub.0] can be considered as an edge-corrected localisation of [chi]. One observes that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all [[xi].sub.l] [subset or equal to] [F.sup.0] (C). Now, the additivity and translation invariance of the Euler number and the fact that X [??] F = (X [intersection] [L.sup.n]) [??] F yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (6)

with the convention 0 *[infinity] = 0. The last equation shows that the Euler number can be written as a scalar product of the vectors w = ([w.sub.l]) and h = ([h.sub.l]). The components [w.sub.l] = [X.sup.n.sub.0] ([[xi].sub.l] [??] F) of the vector w = ([w.sub.l]) serve as weights for computing the Euler number. It is important to realise that these weights depend on F, but they are independent of X. On the other hand, the vector h = ([h.sub.l]) is independent of IF. The components of w for the adjacency systems [F.sub.6], [F.sub.14.1], [F.sub.14.2] and [F.sub.26] on [L.sup.3] are given in Ohser et al. (2003).

Now following Jernot et al. (2004), we consider a refinement of Eq. 3 which is possible when IF is generated by a tessellation [g.sub.0] = {[P.sub.1], ... ,[P.sub.m]} [subset or equal to] {[F.sub.0], ... ,[F.sub.v]} of the unit cell C. The set [P.sub.i] are ndimensional polytopes with [[union].sup.m.sub.i=1] [P.sub.i] = C and int [P.sub.i] [intersection] int [P.sub.j] = [theta] for [not equal to] j, where intP denotes the interior of P. Then the periodic extension g = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] ([g.sub.0] + x) is a (deterministic) tessellation of [R.sup.n]. We assume that g forms a face-to-face tessellation. As in Ohser et al. (2002), we call a tessellation g having the above properties an admissible tessellation.

Let [[mu].sub.F] be the number of cells of g covering F,

[[mu].sub.F] = #{P [member of] g : F [subset or equal to] P},

for F [member of] [F.sup.i] ([P.sub.i]) and j = 1, ... , n. We follow Jernot et al. (2004) where an alternative version [[chi].sup.n.sub.0] of the local Euler number is defined as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (7)

It follows that [[chi].sup.n.sub.0] = [[chi].sup.n.sub.0] and thus Eq. 6 is valid with [[chi].sup.n.sub.0] instead of [[chi].sup.n.sub.0] .

Finally, we introduce pairs of complementary adjacency systems. In the continuous case the consistency relation [chi](X) = [(-1).sup.n+1] [chi]([X.sup.c]) is fulfilled for all compact, polyconvex and topologically regular sets X [subset] [R.sup.n], see Ohser et al. (2002); Rataj and Zahle (2003), and a similar relationship should hold in the discrete case.

Definition 3 The pair (F, [F.sub.c]) is called a pair of complementary adjacency systems if (X [??] F) [intersection] ([X.sup.c][??] [F.sub.c]) = [theta] and

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (8)

for all compact X [subset] [R.sup.n]. An adjacency system F is called self-complementary if (X [??] F) [intersection] ([X.sup.c] [??] F) = [theta] and [chi] (X [??] F) = [(-1).sup.n+1][chi]([X.sup.c] [??] F) for all compact X.

For a given adjacency system F there does not necessarily exist a complementary adjacency system [F.sub.c], and until now there is not known a constructive way to find [F.sub.c]. Furthermore, the criterion of Definition 3 is not appropriate for checking complementarity. A simpler criterion is given in Schladitz et al. (2006).

It turns out that the 6-adjacency on [L.sup.3] is complementary to the 26-adjacency and there are two self-complementary adjacency systems known on [L.sup.3], the 14.1-adjacency and the 14.2-adjacency. In other words, ([F.sub.6],[F.sub.26]), ([F.sub.14.1],[F.sub.14.1]), ([F.sub.14.2],[F.sub.14.2]) and ([F.sub.26],[F.sub.6]), are pairs of complementary adjacency systems on [L.sup.3], see also Ohser et al. (2002; 2003); Schladitz et al. (2006).

INTRINSIC VOLUMES

The Crofton formulae reduce measurement of the intrinsic volumes to computation of Euler numbers in lower dimensional sections. A discretisation of these formulae combined with an efficient calculation of the Euler numbers in the intersections yield a fast algorithm for simultaneously determining the intrinsic volumes from an [L.sup.n]-sampling of X. The backbone of the Euler number calculation is a thorough investigation of digital connectivity and consistency.

SECTION LATTICES AND TRANSLATION LATTICES

Let X [subset] [R.sup.n] be a compact set (i.e., an object or a particle). We assume that X is polyconvex, i.e., X is a finite union of compact convex sets. The Crofton formulae for computing the intrinsic volumes of X use section profiles of X on affine subspaces of [R.sup.n]. In order to obtain a digitised version, we introduce section lattices of a given homogeneous lattice [L.sup.n] and their translative complements in analogy to linear subspaces and their orthogonal complements.

Definition 4 A pair ([L.sup.k],[sup.T][L.sup.n-k]) , k = 1, ... , n - 1, is called a k-dimensional section lattice [L.sub.k] equipped with the translative complement [sup.T][L.sup.n-k], if there exists a basis [V.sub.1], ... , [V.sub.n] of [L.sup.n] with

(i) [L.sup.k] = ([V.sub.1], ... ,[V.sub.k])[Z.sup.k],

(ii) [sup.T][L.sup.n-k] = ([v.sub.k+1], ... , [v.sub.n])[Z.sup.n-k],

(iii) there is an x [member of][F.sup.0](C) with {[v.sub.1], ... , [v.sub.k]} [subset] [F.sup.0] (C + x) where C is the reflection of the unit cell of [L.sup.n] at the origin.

Condition (iii) ensures that integration over 'local knowledge' on the image data is possible as needed later. The translative complement [sup.T][L.sup.n-k] has properties similar to those of the orthogonal complement of a linear subspace. In particular, the union of shifts [L.sup.k ] + x of the section lattice over all x from the corresponding translation lattice [sup.T][L.sup.n-k] yields the cubic lattice [L.sup.n] = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. However, the translative complement is not necessarily uniquely determined. Nevertheless, choosing one of the translative complements arbitrarily turns out to cover all applications presented in the following.

MEASUREMENT

We denote by [L.sup.k] the set of all k-dimensional linear subspaces of [R.sup.n]; [sup.[perpendicular to]]L is the orthogonal complement of L [member of] [L.sup.k]; [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is the n - k-dimensional Lebesgue measure on [sup.[perpendicular to]]L, and [mu] denotes the rotation invariant measure on [L.sup.k] with ,u([L.sup.k]) = 1. Now the Crofton formulae for the intrinsic volumes [V.sub.n-k](X) of a compact and polyconvex set X can be written in the form

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (9)

This means that the intrinsic volumes can be expressed in terms of the Euler number measured on lowerdimensional subspaces.

The observation of X on the lattice [L.sup.n] implies that the integrand in the Crofton formulae (Eq. 9) is known for only a finite number of elements of [L.sup.k] and the translation L + y is possible for discrete values of y, only. That is, both integrals in Eq. 9 are approximated by sums. Furthermore, the intersection X [intersection] (L + y) must be replaced by its discretisation X [??] ([F.sup.k] + y) with respect to an adjacency system [F.sup.k] in [L.sup.k] where L = span [F.sup.k]. Finally, the translations y are from [sup.T][L.sup.n-k] instead of

[sup.[perpendicular to]L], where [sup.T][L.sup.n-k] is a translative complement according to Definition 4.

DISCRETISATION OF THE TRANSLATIVE INTEGRAL

For simplicity we restrict ourselves to the special case where X is observed on a cubic primitive lattice. Nevertheless, this is not a substantial restriction and the following considerations can be extended to arbitrary homogeneous lattices, too.

Let [C.sup.k] and [F.sup.k] be a lattice cell and an adjacency system of a section lattice [L.sup.k] of a[Z.sup.n], respectively. Denote by [sup.T][C.sup.n-k] a unit cell of the translation lattice [sup.T][L.sup.n-k] of [L.sup.k] (according Definition 4) and by proj [sup.T][C.sup.n-k] the orthogonal projection of [sup.T][C.sup.n-k] onto [sup.[perpendicular to]L] = [sup.[perpendicular to](span [L.sup.k]). Denote its volume by [vp.sub.n-k]/[a.sup.n-k] := Vol proj [sup.T][C.sup.n-k] and note that the ratio [vp.sub.n-k]/[a.sup.n-k] is an unsealed quantity. We have

[Vp.sub.n-k] = volproj [sup.T][C.sup.n-k] = Vol C/Vol [C.sup.k], k = 1, ... ,n - 1. (10)

Now, in analogy to the rectangular quadrature rule, the translative (inner) integral in Eq. 9 can be approximated by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (11)

where the local Euler number [[chi].sup.k.sub.0] is defined as in Eq. 5 but w. r. t. the adjacency system [F.sup.k] on the section lattice [L.sup.k].

The last expression can be considered as an estimator [p.sup.k.sub.X](L) of the translative integral [p.sup.k.sub.X](L). For a fixed section lattice [L.sup.k], the volume of proj [sup.T][C.sup.n-k] and thus [p.sup.k.sub.X](L) do not depend on the particular choice of [sup.T][C.sup.n-k]. This follows directly from Eq. 10 and the definition of the [L.sup.k], see Definition 4.

It can be seen that the right-hand side of Eq. 11 is a scalar product,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (12)

with [v.sub.k] = [2.sup.2k] - 1 and the local pixel configurations [[zeta].sub.l] [subset or equal to] [F.sup.0]([C.sup.k]) on [L.sup.k], where the indexing of the [[zeta].sub.l] is chosen analogously to the one for the [[xi].sub.l]. Notice that the vector [w.sup.(k)] = ([w.sup.(k).sub.l]) depends on the adjacency system IFk and the vector [h.sup.(k)] = ([h.sup.(k).sub.l]) depends on the sample X [intersection] [L.sup.k] of X on [L.sup.k].

The computation of the vectors [h.sup.(k)] involves access to all pixel values of the image. Therefore, this is the most time consuming part in the estimation of the translative integrals in Eq. 9. Thus, from the algorithmic point of view the following question arises: Is it possible to compute all translative integrals from the same h determined just once for a given set X and lattice [L.sup.n]? In order to use this one h for all dimensions k and all section lattices [L.sup.k], the vectors [w.sup.(k)] of weights have to be adapted, such that the scalar product [w.sup.(k)][h.sup.(k)] has a representation as [w.sup.(k)]h. In order to achieve this, we consider the following two cases:

(i) Due to Definition 4(iii), the section lattice [L.sup.k] has the property that there is a translation y [member of] [L.sup.n] such that [C.sup.k] + y [subset] C. Then it follows that [C.sup.k] = (C - y) [intersection] L and

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all x [member of] [L.sup.n]. This yields

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

From Eq. 5 we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all j [member of] {0, ... , [v.sub.k]} and all l [member of] {0, ... ,v} with [[zeta].sub.j] [subset or equal to] [[xi].sub.l] - y and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Furthermore, one gets

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for j = 0, ... , [v.sub.k]. Using this, Eq. 12 can be rewritten as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

defining the vector [w.sup.(k)] = ([w.sup.(k).sub.l]).

(ii) Now we treat those section lattices having the property that there is no translation y [member of] [L.sup.n] with [C.sup.k] + y [subset] C. Then Definition 4(iii) ensures that there are finitely many x [member of] [L.sup.n] such that the intersections [C.sup.k] [intersection] (C - x) generate a face-to-face tessellation of [C.sup.k]. This tessellation can be refined into a tessellation [g.sup.0] = {[P.sub.1], ... ,[P.sub.m]} of [C.sup.k] into k-simplices [P.sup.i] such that for each [P.sup.i] there is a [y.sub.i] [member of] [L.sup.n] with [P.sub.i] + [y.sub.i] [member of] C and [F.sup.0]([P.sup.i] + [y.sup.i]) [subset] [F.sup.0](C).

Then the adjacency system [F.sup.k] is generated by the tessellation [g.sub.0]. Making use of Eq. 7, it can be shown that [p.sup.k.sub.(L)] has the same form as above but with the weights

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for d = 0, ... ,v.

Summarising, we have shown that for all dimensions k and for all section lattices [L.sup.k], the translative integrals [p.sup.k.sub.(L)] in the Crofton formulae (Eq. 9) can be estimated via

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (13)

where L = span [L.sup.k] is the corresponding subspace.

DISCRETISATION OF THE INTEGRAL OVER ALL SUBSPACES

From the [L.sup.n]-sampling of X the estimator [p.sup.k.sub.X]([L.sub.i]) of the translative integral of Eq. 9 is known for finitely many subspaces [L.sup.i] = span [L.sup.k.sub.i] = 1, ... ,[M.sub.k], only. Hence, one has to find an appropriate approximation of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Applying a simple quadrature yields

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (14)

where [[gamma].sub.i.sup.(k)] are suitable weights. The choice of these weights is not trivial since the planes [L.sub.1] , .... , [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] are not uniformly scattered in [L.sup.k]. Moreover, the estimates [p.sup.k.sub.X]([L.sub.i]) of the [p.sup.k.sub.X]([L.sub.i]) are not of the same accuracy for different subspaces. In 2D, the 2[pi]-periodic rectangle rule leads to weights which are proportional to the lengths of the Voronoi arcs corresponding to directions of the straight lines [L.sub.i]. This geometric interpretation can be extended to higher dimensions which leads to a generalisation of the rectangular rule. For the special case of a cubic primitive lattice [L.sup.3] = a[Z.sup.3], a > 0, we have [[gamma].sub.i.sup.(1)] = [[gamma].sub.i.sup.(2)] for all i, and the numerical values are [[gamma].sub.i.sup.(k)] = 0.091556 for i = 1, 2, 3; [[gamma].sub.i.sup.(k)] = 0.073 961 for i = 4, ... ,9; [[gamma].sub.i.sup.(k)] = 0.070 391 for i = 10, ... , 13, see Lang et al. (2001).

Summarising formulae Eqs. 9, 13 and 14, we obtain the approximation [V.sub.n-k] (X) of [V.sub.n-k] (X) as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where the [w.sup.(i,k).sub.l] are the coefficients corresponding to the adjacency systems [F.sup.k.sub.i] on the subspaces [L.sub.i] according to Eq. 13.

The last equation shows that estimates of the intrinsic volumes [V.sub.n-k](X) can also be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (15)

with the scalar products [V.sup.(k)]h of the vectors [V.sup.(k)] = ([V.sup.(k).sub.l]) and h. We complete the above set of estimators by those of the volume [V.sub.n] and the Euler number [V.sub.0] of X:

[V.sub.n](X) = [a.sup.n][V.sup.(O)]h,

with the coefficients [v.sup.(O).sub.l] = vol C/[a.sup.n] for odd l, and [v.sup.(O).sub.l] = 0 otherwise;

[V.sub.O](X) = [V.sup.(n)]h,

with the coefficients [v.sup.(n).sub.l] := [w.sub.l] = [x.sup.n.sub.0] ([[xi].sub.l] [??] F]) where IF is an adjacency system on [L.sup.n].

For n = 3 we get [[alpha].sub.301] = [[alpha].sub.302] = 1/2. The intrinsic volumes [V.sub.2] and [V.sub.1], and thus the surface area S and the integral of the mean curvature M, can be estimated as

S(X) = 2[V.sub.2](X) = 4[a.sup.2][V.sup.(1)]h , M(X) = [pi][V.sub.1](X) = 2[pi][av.sup.(2)]h.

The surface area weights [4v.sup.(1)], also published in Schladitz et al. (2006), the weights 2[pi][v.sup.(2)] for the integral of mean curvature and the weights [V.sup.(3)] for the Euler number are presented in Table 1. The weights for the Euler number were first published in Ohser et al. (2002).

The surface area and the integral of mean curvature are rotation invariant functionals. Thus the weights can be presented for the representatives [[eta].sub.j] of the congruence classes [D.sub.j] of the pixel configurations [[xi].sub.0], ... , [[xi].sub.255]. Notice that for the surface area the weights for complementary representatives [[eta].sup.c.sub.j]] are the same as for [[eta].sub.j] while in the case of the integral of mean curvature the sign switches.

INTRINSIC VOLUME DENSITIES

Instead of deterministic sets we consider now random sets widely used as geometric models for constituents of microstructures. The characterisation of a constituent simplifies considerably in case of macroscopic homogeneity and even further if the microstructure is isotropic, too. In these cases, the intrinsic volume densities are important geometric characteristics of the constituents.

In principle, the intrinsic volume densities of a constituent can be estimated by the intrinsic volumes related to the volume of the observation window, see Chapter 4 in Ohser and Miicklich (2000) and Lang et al. (2001). Alternative approaches Klenk et al. (2006), Mrkvicka and Rataj (2008), Schmidt and Spodarev (2005) are based on solutions of systems of linear equations deduced from the local Steiner formula, see Section 4.4 in Schneider (1993), or the principal kinematic formula. These methods are studied in detail for the 2-dimensional case but work in principle in arbitrary dimensions. Comparisons for Boolean models in 2D in Guderlei et al. (2007) and Mrkvicka and Rataj (2008) show, that the accuracy of the resulting estimators is sometimes higher than of those given in Chapter 4 of Ohser and Mucklich (2000) using the present approach. However, so far none of these algorithms has been proved to work in practice in dimensions n [greater than or equal to] 3.

MACROSCOPIC HOMOGENEITY

Let [XI] be a macroscopically homogeneous random set on [R.sup.n] observed in a compact and convex window W with nonempty interior. Assume now that the realisations of [XI] belong to the extended convex ring almost surely and thus their intersections with W are polyconvex sets. Furthermore, assume that [XI] fulfils the integrability condition [E2#.sup.([XI][intersection]x]) < [infinity] for any compact and convex set K, where #X denotes the minimal number m such that the set X has a representation X = [K.sub.1] [union] ... [union] [K.sub.n] with compact and convex sets [K.sub.1] , ... , [K.sub.m]. Then the intrinsic volume densities [V.sub.V,k] of [XI] exist and can be defined by the limits

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

see, e.g., Schneider and Weil (2008), p. 398.

The random set [XI] may be observed on the homogeneous lattice [L.sup.n] with the unit cell C. By f1 Ln we denote the [L.sup.n]-sampling of [XI] where [L.sup.n] is a equipped with a pair (F, [F.sub.c],) of complementary adjacency systems. Furthermore, as in Section 4.4 the section lattices [L.sup.k.sub.i] of [L.sup.n] are equipped with pairs ([F.sup.k.sub.i],[F.sup.k.sub.c,i]) of complementary adjacency systems, i = 1, ... , [m.sub.k], k = 1, ... , n - 1. Again, for the sake of simplicity we concentrate on samplings on cubic primitive lattices.

Now the method described in Section 4.2 is adapted to the measurement of the volume density. We choose a window W such that [L.sup.n] [intersection] (W [??] C) [not equal to] [theta], where W [??] C is the window W reduced by the reflection of the unit cell C of [L.sup.n]. Furthermore, let h = ([h.sub.l]) be the vector of numbers of local configurations in [XI] [intersection] W [intersection] [L.sup.n],

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for l = 0, ... , v. Then estimators of the intrinsic volumes [V.sub.V,n-k] can be given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (16)

for k = 0, ... ,n. These estimators are usually biased for k > 0. Because of the macroscopic homogeneity of [XI], the expectations of the [V.sub.V,n-k] depend on the probabilities that the local configurations [[xi].sub.l] belong to the foreground [XI] and the complementary configurations 4,,-e are in the background [[XI].sup.c]. From vole = an and Ehel#(Ln n (we c)) = P(4e c [XI], [[xi].sub.v-l] [subset or equal to] [[XI].sup.c]) it follows that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (17)

In order to assess estimation errors in the theoretical considerations below, the above probabilities are expressed in terms of P([[XI].sup.l] [subset or equal to] [[XI].sup.c]). For each local configuration 4e and a point x [member of] [[xi].sub.l] one gets

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (17)

Recursion yields the linear equation system

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (18)

for l = 0, ... ,v, where the [b.sub.jl] are integers. (We remark that Eq. 18 as well as the explicit values of the [b.sub.jl] can be derived from the inclusion-exclusion formula, too.) Plugging (18) into (17) we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (19)

for k = 0, ... , n, where the weights [g.sup.(k).sub.j] are independent of [XI].

MACROSCOPIC HOMOGENEITY AND ISOTROPY

Let now [XI] be macroscopically homogeneous, isotropic and the distribution of [XI] is invariant under reflection at the origin. For cubic primitive lattices it is sufficient to restrict the following considerations to the congruence classes [D.sub.j] of the local pixel configurations. Then the probabilities in Eq. 17 can be rewritten as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for all [[xi].sub.l] [member of] [D.sub.j] and the linear equation system (18) takes the form

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for l = 0, ... ,[v.sub.0] and with integer coefficients [b.sub.jl]. Obviously, [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for all l and, thus, the expectations of the intrinsic volumes can be expressed by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (20)

with the coefficients

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for i = 0, ... ,[v.sub.0] and k = 0, ... n.

Now we restrict the considerations to [R.sup.3]. Using the weights in the Table 1, appropriate estimators of the densities [S.sub.V], [M.sub.V] and [[chi].sub.V] of the surface area, the integral of the mean curvature and the Euler number are

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

respectively. Their expectations are

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

respectively. The values of the [g.sup.-(k).sub.j] are listed in Table 2.

INTRINSIC VOLUME DENSITIES OF BOOLEAN MODELS

Now we consider Boolean models sampled on a cubic lattice [L.sup.n] = a[Z.sup.n], a > 0. In this section we present relationships between the expectations of the intrinsic volume densities of sampled Boolean models, the density of the germs and the corresponding expectations of the intrinsic volumes of the grains. Following Serra (1982) p. 492ff and p. 557, we derive formulae for [L.sup.n]-samplings of Boolean models connecting the parameters of the Boolean models with the expectations of the estimators [V.sub.v,k] of the densities of the intrinsic volumes. Comparisons with Miles' formulae yields the asymptotic bias of the estimators.

BOOLEAN MODELS IN [R.sup.n]

Let [PHI] = {[x.sub.1], [x.sub.2], ...} I denote a macroscopically homogeneous Poisson point field in [R.sup.n] (the point field of germs) with point density [lambda], > 0 and [[XI].sub.1], [[XI].sub.2], ... a sequence of independent and identically distributed (i. i. d.) random, compact and convex sets (the grains) with nonempty interior and independent of [PHI]. The corresponding Boolean model is defined as the random closed set

[XI] = [infinity] [union] j = 1 ([XI] + [x.sub.j]).

For more detailed definitions and explanations see Matheron (1975); Schneider and Weil (2008); Molchanov (1997). In the following we assume that the random grains =i are isotropic and invariant w.r.t. reflection at the origin. Then , is isotropic, too, and invariant w. r. t. reflection at the origin. Moreover, assume [EV.sub.k]([[XI].sub.1]) < [infinity] for k = 1, ... n.

With probability one the intersection of two grains is either empty or has nonempty interior. Then from the consistency relation for the Euler number and Crofton's intersection formulae (9) it follows that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

For Boolean models, the probabilities occurring on the right hand side of Eq. 20 can be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The expectations of volumes occurring on the right hand side of this equation can be calculated approximately by the Steiner formula when substituting [[eta].sub.l] with its convex hull [F.sub.l] = conv [[eta].sub.l]. We can assume [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] which follows for particular cases from the following lemmas.

Lemma 1 Let K be a compact and convex set with nonempty interior, then

[V.sub.n](K [??] [0,au]) - [V.sub.n](K [??] {o,au}) = 0(a), u [member of] [S.sup.n-1] as a [down arrow] 0.

Proof For the Minkowski addition of K with the segment [0, au], a > 0, we have

[V.sub.n](K[??] [0, au]) = [V.sub.n](K) + a[V.sub.n-1] ([PI](K, [sup.[perpendicular to] span u])), (21)

where [PI](K,[sup.[perpendicular to] span u]) is the orthogonal projection of K onto the n--1-dimensional subspace [sup.[perpendicular to] span u] orthogonal to the straight line spanned by u. On the other hand

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (22)

where cov(K,an) = [V.sub.n] (K [intersection] (K + au)) denotes the covariogram function of the set K w.r.t.u. Now, since V (K) = cov(K, 0) and

[V.sub.n-1]([PI](K,[sup.[perpendicular to] span u])) = -[[d/dt cov (K,tu)].sub.t = 0+],

see Section 4.3 in Matheron (1975), it follows that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

and thus

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

We remark that Lemma 1 holds more generally for configurations [xi] [subset or equal to] F (C) and F = conv [xi]. This is a consequence of Corollary 2.(2) of Kiderlen and Rataj (2006) as the support function of a general nonempty compact set in [R.sup.n] is defined as the support function of its convex hull.

Lemma 2 For n [greater than or equal to] 3, balls BY with fixed radius r, configurations [xi] [subset or equal to] [F.sup.0] (C) and F = conv [xi] with dim F [less than or equal to] 2 one gets

[V.sub.n]([B.sub.r][??]F) - [V.sub.n]([B.sub.r][??][xi]) = o([a.sup.2]) as a [down arrow] 0.

Proof First we observe that the distance between 4 and F is smaller than the space diagonal of the unit cell, max [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. For all a < r / [square root of] n we can choose t = [square root of] [r.sup.2] - [n.sup.a2]. Then it follows that F [??] [B.sub.t] [subset] [xi] [??] [B.sub.r] [subset] F [??] [B.sub.r].

Now we replace F [??] [B.sub.t] with a non-convex set having enlarged spherical sectors at the vertices of F. Let H(F, u) be a supporting hyperplane of F with normal direction u and let N(F, x) = {u [member of] [R.sup.n] \ {0} : x [member of] H(F, u)} [union] {0} denote the normal cone of F at x [member of] F, see Schneider (1993), p. 70. Then N(F,x) [intersection] [B.sub.r] is the normal cone restricted to the ball [B.sub.r]. The spherical sectors of F at the vertices x are given by [F.sub.r](x) = {u + x : u [member of] N(F x) [intersection] [B.sub.r]}. Using this one obtains

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (23)

for all x,y [member of] [xi] with x [not equal to] y, the Steiner formula implies that dim F

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Notice that since the intrinsic volumes [V.sub.j] are j-homogeneous, [V.sub.j] (F/a) = 1/[a.sup.j] [V.sub.j] (F) for a > 0, where the [V.sub.j] (F/a) are independent of the lattice spacing a. Now from Eq. 23, the k-homogeneity of [V.sub.k] and with the above choice for t we get the estimation

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (24)

Finally, the assertion of the above lemma follows from

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

In order to estimate the error introduced by replacing [[eta].sub.l] with its convex hull [F.sub.l] = conv [[eta].sub.l] we have to derive lemmas similar to 1 and 2 but for the respective expectations.

Lemma 3 Let X be a random compact and convex set whose distribution is isotropic and invariant w.r.t. reflection at the origin and whose interior is a. s. nonempty. Assume that [EV.sub.n](X) < [infinity] and that there is an [epsilon] > 0 such that a. s. [B.sub.[epsilon]] [subset or equal to] X, then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The assumptions [EV.sub.n](X) < [infinity] and [B.sub.[epsilon]] [subset or equal to] X a. s. yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

see Schneider (1993, p. 327), originally due to Wills (1970). Together with the convexity of X this in turn ensures that [EV.sub.n-1] ([PI](X,[sup.[perpendicular to] span u])) < [infinity] for all u [member of] [S.sup.n-1] giving an integrable upper bound for the left hand side. This finally allows to interchange limit and expectation and the assertion follows from Lemma 1.

Lemma 4 For n [greter than or equal to] 3, let [B.sub.r] [subset or equal to] [R.sup.n] be a ball of random diameter with r [greter than or equal to] [epsilon] > 0 a. s. and [Er.sup.n] < [infinity]. Then for all configurations [xi] [subset or equal to] [F.sup.0](C) and F = conv[xi] with dim F [less than or equal to] 2 one gets

E([V.sub.n] ([B.sub.r] [??] F) - [V.sub.n] ([B.sub.r] [??] [xi])) = o([a.sup.2])

Proof Eq. (24) and the assumption [Er.sup.n] < [infinity] yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

and thus E([V.sub.n]([B.sub.r] [??] F) - [V.sub.n]([B.sub.r] [??] [xi])) = o([a.sup.2]) using the same argument as in Lemma 2.

We remark that for every function f : R [right arrow] R with f (a) = o([a.sup.m]) as a [down arrow] 0, m > 0, it follows that 1- [e.sup.f(a)] = o([a.sup.m]).

As [F.sub.l] is convex, an application of the principal kinematic formula to macroscopic homogeneous Boolean models gives

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

see Schneider and Weil (2008), p. 380. From the j-homogeneity of the intrinsic volumes [V.sub.j] it follows that the probability P([F.sub.l] [subset][[XI].sup.c]) can be considered as a function [f.sub.l] of the lattice distance a,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where the [V.sub.j] ([F.sub.l]/a) are independent of a. Note that [f.sub.l](a) = [f.sub.l](0) for [F.sub.l] with dim [F.sub.l] = 0. For [F.sub.l] with dim [F.sub.l] > 0 we now use a Taylor expansion of [f.sub.l],

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (25)

where [f.sup.(i).sub.l] is the ith derivative of [f.sub.l].

From the above approach and Eq. 20, the expectations of the estimators [V.sub.Vn-k]([XI]) can be expressed in terms of the derivatives of the functions [f.sub.l]. Using Lemma 3 and Lemma 4, respectively, we can formulate the following theorems.

Theorem 1 Let [XI] be a homogeneous and isotropic Boolean model with random, compact, convex grains whose distribution is invariant w. r. t. reflection at the origin. If there is an [epsilon] > 0 such that a. s. [B.sub.[epsilon]] [subset or equal to] [[XI].sub.1] and [EV.sub.n]([[XI].sub.1]) < [infininty] then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (26)

Proof We recall that [V.sub.Vn-1]([XI]) is estimated from the data sampled on 1D section lattices. As a consequence, dim [F.sub.1] is 0 or 1.

Now plugging the result of Lemma 3 into Eq. 20 yields

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The assertion of the theorem now follows from the series expansion Eq. 25.

Theorem 2 Let be a Boolean model in I18n, n [greater than or equal to] 3, with balls of random diameter r. If r > [epsilon] > 0 a. s. and [Er.sup.n] < [infinity], then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (27)

as a [down arrow] 0 and for k = 1,2.

Proof We make use of the fact that [V.sub.Vn-1]([XI]) and [V.sub.Vn-2]([XI]) are estimated from 1D and 2D section lattices, respectively, and thus dim [F.sub.l] [less than or equal to] 2 meeting the assumptions of Lemma 4.

Then plugging the result of Lemma 4 into Eq. 20 and using Eq. 25 in the same way as in the proof of Theorem 1 yields Eq. 27.

BOOLEAN MODELS IN [R.sup.3]

We specialise to the 3D case from now on. Let V, S, b denote the expectations of the volume, the expectation of surface area, and the expectation of the mean breadth of the grain [[XI].sub.1], i.e., [EV.sub.3] ([[XI].sub.1]) = V, [2EV.sub.2]([[XI].sub.1]) = S and 1/2 [EV.sub.1]([[XI].sub.1]) = b. Then the surface density [S.sub.V] = [2V.sub.v,2]([XI]), the density of the integral of the mean curvature [M.sub.V] = [pi][V.sub.v,1]([XI]), and the density of the Euler number [chi]v = [V.sub.v,0]([XI]) of a Boolean model can be expressed in terms of [lambda], V, S, and b by Miles' formulae

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (28)

see Miles (1976) and Theorem 9.1.4 in Schneider and Weil (2008). On the other hand the expectations of the corresponding estimators according to Eqs. 26 and 27 have a structure similar to Miles' formulae,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (29)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (30)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (31)

where the constants [c.sub.1], [c.sub.2], and [c.sub.3] depend on the chosen pair of complementary adjacency systems (F,[F.sub.c]), see Table 4. Notice that the values for [c.sub.1], [c.sub.2], and [c.sub.3] correspond to those ones published in Ohser et al. (2003) for a Boolean model with balls of constant diameter.

In order to show that Eqs. 29 and 30 follow directly from Eqs. 26 and 27, respectively, we introduce the volume [v.sub.l], the surface area [s.sub.l], and the mean breadth [b.sub.l] of the set 1/2 [F.sub.l]. Using these notations, the function [f.sub.l] can be rewritten as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The first derivatives of [f.sub.l] at a = 0 are

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

For k = 1, it can be seen from the values in the Tables 2 and 3 that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

which yields Eq. 29. For k = 2 it follows that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

and from Eq. 27 one obtains Eq. 30.

Finally, consider the case k = 3. Independent of the choice of a pair (F, [F.sub.c]) of complementary adjacency systems, it can be seen that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

which yields Eq. 31 where the coefficients cl, c2, c3 are computed via

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

In order to assess the asymptotic behaviour for a [down arrow] 0 of the estimators [S.sub.V], [M.sub.V], and [[chi].sub.V], Eqs. 29, 30, and 31 are compared with Miles' formulae. It can bee seen that [S.sub.V] is asymptotically unbiased for a [down arrow] 0 (multigrid convergent). This is related to the fact that the estimators of the Euler numbers of 1D Boolean models are asymptotically unbiased, see Serra (1982).

For Boolean models with balls of random diameters it can be shown that the asymptotic bias of [M.sub.V] is

lim/a [down arrow] 0 [EM.sub.v] - [M.sub.V] = -0.045872 [[lambda].sup.2][S.sup.-2] [e.sup.-[lambda]V].

This corresponds to a result in Serra (1982), where the estimation of the Euler number of a planar Boolean model was shown to be asymptotically biased. In order to assess the asymptotic bias of [[chi].sub.V], the constants c1, c2, c3 have to be compared with the respective ones in Eq. 28. Obviously, [[chi].sub.V] is always biased. More precisely, the asymptotic bias is even infinite for the pairs ([F.sub.6],[F.sub.26]), ([F.sub.14.1],[F.sub.14.1]) and ([F.sub.14.2],[F.sub.14.2]).

For ([F.sub.26],[F.sub.6]) the coefficient cl in Eq. 31 vanishes and thus the difference of the right-hand sides of Eqs. 28 and 31 is finite. However, the error in Eq. 31 can not be estimated and thus the asymptotic behaviour of [[chi].sub.V] is unknown for ([F.sub.26],[F.sub.6]).

DISCUSSION

The probably most intuitive method for measuring the surface area is based on rendering data, see, e.g., Lindblad and Nystr6m (2002), where the areas of the surface patches serve as weights for computing the surface area from local knowledge, i.e., from the numbers of pixel configurations. However, this type of estimator is not multigrid convergent. There are alternative methods also based on an explicit approximation of the boundary without further assumptions but ensuring multigrid convergence, see Klette and Rosenfeld (2004) for an overview. However, these approximations are expensive since they are not local.

As pointed out in Section 4.2, the surface area can be measured directly from the binary volume image without need to approximate the surface. We are starting from the local knowledge represented by the numbers of 2 x 2 x 2 pixel configurations on cubic primitive lattices and ask for the best choice of surface weights. The weights suggested by Lindblad (2005) minimise the estimation variance of the surface area of a plane with random normal direction uniformly distributed on the unit sphere. This idea goes back to Mullikin and Verbeek (1993), see also the discussion in Windreich et al. (2003). A comprehensive treatment of the subject of surface estimation is due to Ziegel and Kiderlen (2009). Their weights minimise the asymptotic worst case error for surface area estimation for decreasing lattice distances (multigrid convergence). This approach is based on a general asymptotic result proved in Kiderlen and Rataj (2006). It also allows a comparison of the various methods for surface estimation. As shown in Ziegel and Kiderlen (2009), the maximum asymptotic relative error for general sets X is 12.8% for the weights suggested in Lindblad and Nystr6m (2002), 7.3% for the weights given in Lindblad (2005) and Schladitz et al. (2006) and 4.0% for the best choice in Ziegel and Kiderlen (2009).

The approach based on the Crofton formulae has a number of advantages. First, the method of surface area estimation can simply be extended to arbitrary dimensions and to most of the other intrinsic volumes, in particular the integral of the mean curvature which measures e.g. the length of fibres in non-wovens or the total length of edges of open foams. Furthermore, this approach works for arbitrary homogeneous lattices so that we are no longer restricted to cubic primitive lattices, see Chapter 4 in Ohser and Mucklich (2000) and Lang et al. (2001). This is an important fact since many imaging techniques like nano-tomography by electron microscopy combined with focused ion beam slicing produce images on non-cubic lattices.

The diverging bias of the Euler number estimators of Boolean models is due to the huge number of tiny 'tunnels' and single background pixels between just touching grains in discretisations. These tunnels and single pixels can be removed by smoothing the surface, e.g., with a morphological closure before determining the Euler number. On the other hand, when assuming alternative (and even more realistic) sampling models, e.g., suggested in Hall and Molchanov (1999), the bias in [[chi].sub.V] is probably much smaller than for the [L.sup.n]-sampling considered in the present paper.

ACKNOWLEDGEMENTS

The authors very much appreciate fruitful comments by an unknown referee and Markus Kiderlen whose suggestions improved the paper considerably. Katja Schladitz was supported by the Rheinland-Pfalz cluster of excellence "Dependable Adaptive Systems and Mathematical Modelling" (http://www.dasmod.de/). The research of Joachim Ohser was supported by the [FH.sup.3]-programme of the German Federal Ministry of Education and Research under project grant 1711B06.

(Accepted May 12, 2009)

REFERENCES

Blasquez I, Poiraudeau JF (2003). Efficient processing of Minkowski functionals on a 3d binary image using binary decision diagrams. In: Journal of WSCG, vol. 11 (1). WSCG, Plzen, Czech Republic: UNION AgencyScience Press.

Guderlei R, Klenk S, Mayer J, Schmidt V, Spodarev E (2007). Algorithms for the computation of Minkowski functionals of deterministic and random polyconvex sets. Image Vision Comput 25:464-74.

Hadwiger H (1957). Vorlesungen uber Inhalt, Oberflache and Isoperimetrie. Berlin: Springer-Verlag.

Hall P, Molchanov IS (1999). Corrections for systematic boundary effects in pixel-based area counts. Pattern Recogn 32:1519-28.

Jernot J, Jouannot-Chesney P, Lantuejoul C (2004). Local contributions to the Euler-Poincare characteristic of a set. J Microsc 215:40-9.

Kiderlen M, Rataj J (2006). On infinitesimal increase of volumes of morphological transforms. Mathematica 53:103-27.

Klenk S, Schmidt V, Spodarev E (2006). A new algorithmic approach to the computation of Minkiwski functionals of germ-grain models. Comp Geom Th Appl 34:127-48.

Klette R, Rosenfeld A (2004). Digital Geometry. Amsterdam: Morgan & Kaufman Publ.

Lachaud JO, Montanvert A (2000). Continuous analogs of digital boundaries: A topological approach to isosurfaces. Graph Models 62:129-64.

Lang C, Ohser J, Hilfer R (2001). On the analysis of spatial binary images. J Microsc 203:303-13.

Lindblad J (2005). Surface area estimation of digitized 3D objects using weighted local computations. Image Vision Comput 23:111-22.

Lindblad J, Nystr6m I (2002). Surface area estimation of digitized 3D objects using local computations. In: 10th International Conference on Discrete Geometry for Computer Imagery, vol. 2301 of LNCS. DGCI, Bordeaux, France, Berlin, Heidelberg, New York: Springer.

Matheron G (1975). Random Sets and Integral Geometry. New York, London: John Wiley & Sons.

Miles RE (1976). Estimating aggregate and overall characteristics from thick selections by transmission microscopy. J Microsc 107:227-33.

Molchanov IS (1997). Statistics of the Boolean Model for Practitioners and Mathematicans. New York: J Wiley & Sons.

Mrkvicka T, Rataj J (2008). On the estimation of intrinsic volume densities of stationary random closed sets. Stoch Proc Appl 118:213-31.

Mullikin J, Verbeek P (1993). Surface estimation of digital planes. Bioimaging 1:6-16.

Nagel W Ohser J, Pischang K (2000). An integralgeometric approach for the Euler-Poincare characteristic of spatial images. J Microsc 198:54-62.

Ohser J, Mucklich F (2000). Statistical Analysis of Microstructures in Materials Science. Chichester, New York: J Wiley & Sons.

Ohser J, Nagel W Schladitz K (2002). The Enter number of discretized sets--on the choice of adjacency in homogeneous lattices. In: Mecke KR, Stoyan D, eds., Morphology of Condensed Matter, Lecture Notes in Physics. Berlin: Springer.

Ohser J, Nagel W Schladitz K (2003). The Enter number of discretised sets--surprising results in three dimensions. Image Anal Stereo122:11-9.

Rataj J, Zahle M (2003). Normal cycles of Lipschitz manifolds by approximation with parallel sets. Differ Geom Appl 19:113-26.

Schladitz K, Ohser J, Nagel W (2006). Measurement of intrinsic volumes of sets observed on lattices. In: Kuba A, Nyul LG, Palagyi K, eds., 13th Int Conf Discrete Geom Computer Imagery, LNCS. DGCI, Szeged, Hungary, Berlin, Heidelberg, New York: Springer.

Schmidt V, Spodarev E (2005). Joint estimators for the specific intrinsic volumes of stationary random sets. Stoch Proc Appl 115:959-81.

SchneiderR (1993). Convex Bodies: The Brunn-Minkowski Theory. Cambridge: Encyclopedia of Mathematics and Its Application Vol. 44, Cambridge University Press.

Schneider R, Weil W (2008). Stochastic and Integral Geometry. Probability and Its Application. Heidelberg: Springer.

Serra J (1982). Image Analysis and Mathematical Morphology, Vol. 1. London: Academic Press.

Wills JM (1970). Zum Verhaltnis von Volumen zu OberMche bei konvexen Korpern. Arch Math 21:557-60.

Windreich G, Kiryati N, Lohmann G (2003). Surface area estimation in practice. In: Nystrom I, di Baja GS, Svensson S, eds., 11th Int Conf Discrete Geom Computer Imagery, vol. 2886 of LNCS. DGCI, Naples, Italy, Berlin, Heidelberg, New York: Springer.

Ziegel J, Kiderlen M (2009). Estimation of the surface area and surface area measure of three-dimensional sets from digitizations. Image Vision Comput, in press.

JOACHIM OHSER (1), WERNER NAGEL (2) AND KATJA SCHLADITZ (3)

(1) Hochschule Darmstadt, Fachbereich Mathematik and Naturwissenschaften, Schofferstrasse 3, D-64295 Darmstadt, Germany; (2) Friedrich-Schiller-Universitat Jena, Institut fur Stochastik, D-07737 Jena, Germany; (3) fsFraunhofer-Institut fur Techno-and Wirtschaftsmathematik, Abteilung BildverarbeiLung, Fraunhofer-Platz 1, D-67663 Kaiserslautern, Germany e-mail: jo@h-da.de, nagel@minet.uni-jena.de, katja.schladitz@itwm.fraunhofer.de

Table 1. Surface area weights [4v.sup.(1).sub.l], weights [2[pi]v.sup.(2).sub.l] for computing the integral of the mean curvature and the weights [v.sup.(3)] for the Euler number. The weights for the Euler number are given for the pairs ([F.sub.6], [F.sub.26]), ([F.sub.14.1], [F.sub.14.1]), ([F.sub.14.2], [F.sub.14.2]) and ([F.sub.26], [F.sub.6]) (from left to right). The table shows the values for [8v.sup.(3)] for ease of reading. The weights for ([F.sub.14.1], [F.sub.14.1]) and ([F.sub.14.2], [F.sub.14.2]) are averages over the transforms in M as the adjacency systems [F.sub.14.1] and [F.sub.14.1] are not isotropic (i.e., invariant w.r.t. the linear transforms in M). [4v.sup. [2[pi]v.sup. [8v.sup.(3). j [[eta].sub.j] (1).sub.l] (2).sub.l] sub.l] 0 [[xi].sub.0] 0 0 0 0 0 0 1 [[xi].sub.1] 0.376 0.590 1 1 1 1 2 [[xi].sub.3] 0.659 0.728 0 0 0 0 3 [[xi].sub.9] 0.646 0.616 2 0 0 -2 4 [[xi].sub.129] 0.588 0.687 2 0 0 -6 5 [[xi].sub.7] 0.839 0.446 -1 -1 -1 -1 6 [[xi].sub.131] 0.768 0.426 1 -1 -1 -3 7 [[xi].sub.41] 0.813 0.334 3 -3 -1 -1 8 [[xi].sub.15] 0.927 0 0 0 0 0 9 [[xi].sub.43] 0.914 0 -2 -2 -2 -2 10 [[xi].sub.139] 0.856 0 -2 -2 -2 -2 11 [[xi].sub.153] 0.785 0 0 0 -2 0 12 [[xi].sub.105] 0.874 0 4 -8 0 4 13 [[xi].sub.99] 0.843 0 0 -2 -2 0 14 [[xi].sub.214] 0.813 -0.334 -1 -3 -1 3 15 [[xi].sub.124] 0.768 -0.426 -3 -1 -1 1 16 [[xi].sub.248] 0.839 -0.446 -1 -1 -1 -1 17 [[xi].sub.126] 0.588 -0.687 -6 0 0 2 18 [[xi].sub.246] 0.646 -0.616 -2 0 0 2 19 [[xi].sub.252] 0.659 -0.728 0 0 0 0 20 [[xi].sub.254] 0.376 -0.590 1 1 1 1 21 [[xi].sub.255] 0 0 0 0 0 0 Table 2. The weights [g.sup.-(k).sub.j] for the 22 congruence classes of the local pixel configurations in 3D-images. The first, second, third, fourth column of [g.sup.-(0).sub.i] correspond to the pairs ([F.sub.26], [F.sub.6]), ([F.sub.14.1], [F.sub.14.1]), ([F.sub.14.2], [F.sub.14.2], and ([F.sub.6], [F.sub.26]), respectively. [g.sup.-(1). [g.sup.-(2). [8g.sup.-(3). j [[eta].sub.j] sub.j] sub.j] sub.j] 0 [[xi].sub.0] 0 0 0 0 0 0 1 [[xi].sub.1] 0.751 0.751 1 1 1 1 2 [[xi].sub.3] -0.275 -0.861 -3 -3 -3 -3 3 [[xi].sub.9] -0.314 -1.076 0 -3 -3 -6 4 [[xi].sub.129] -0.163 -0.314 0 -1 -1 -4 5 [[xi].sub.11] 0 0.549 0 6 6 12 6 [[xi].sub.131] 0 0.628 0 6 4 24 7 [[xi].sub.41] 0 0.325 0 0 2 8 8 [[xi].sub.15] 0 0 3 0 0 -3 9 [[xi].sub.43] 0 0 0 0 -2 -8 10 [[xi].sub.139] 0 0 0 -6 -2 -24 11 [[xi].sub.159] 0 0 0 0 0 -6 12 [[xi].sub.10] 0 0 0 0 0 -2 13 [[xi].sub.99] 0 0 0 0 -2 -24 14 [[xi].sub.214] 0 0 0 0 0 8 15 [[xi].sub.124] 0 0 0 0 0 24 16 [[xi].sub.248] 0 0 0 0 0 24 17 [[xi].sub.126] 0 0 0 0 0 -4 18 [[xi].sub.246] 0 0 0 0 0 -12 19 [[xi].sub.252] 0 0 0 0 0 -12 20 [[xi].sub.254] 0 0 0 0 0 8 21 [[xi].sub.255] 0 0 -1 0 0 -1 Table 3. The mean width [b.sub.l], the surface area [s.sub.l] and the volume [v.sub.l] for the convex hulls of the representatives [[eta].sub.l] of the 22 congruence classes. The constant c is given by c = 1/[pi] arctan [square root of (2)] l [[eta].sub.l] [b.sub.l] 0 [[xi].sub.0] 0 1 [[xi].sub.1] 0 2 [[xi].sub.3] 1/2 3 [[xi].sub.9] 1/[square root of (2)] 4 [[xi].sub.129] [square root of (3)]/2 5 [[xi].sub.11] 1/2 + 1/2 [square root of (2)] 6 [[xi].sub.131] 1 + [square root of (3)]/4 + 1/2 [square root of (2)] 7 [[xi].sub.41] 3/2 [square root of (2)] 8 [[xi].sub.15] 1 9 [[xi].sub.43] 3/8 + 3(1 - c)/2 [square root of (2)] 10 [[xi].sub.139] 1/2 + 1/2 [square root of (2)] + 1/2 [square root of (3)] 11 [[xi].sub.153] 1/2 + 1/[square root of (2)] 12 [[xi].sub.105] 3 [square root of (2c)] 13 [[xi].sub.99] 3/8 + 1+3c/2 [square root of (2)] + 1/4 [square root of (3)] 14 [[xi].sub.214] 3/8 + 9c/2 [square root of (2)] 15 [[xi].sub.124] 5/8 + 1+3c/2 [square root of (2)] 16 [[xi].sub.248] 3/4 + 1/2 [square root of (2)] + 1/4 [square root of (3)] 17 [[xi].sub.126] 3/4 + 3c/[square root of (2)] 18 [[xi].sub.246] 3/4 + 3c/[square root of (2)] 19 [[xi].sub.252] 1 + 1/2 [square root of (2)] 20 [[xi].sub.254] 9/8 + 3c/2 [square root of (2)] 21 [[xi].sub.255] 3/2 l [[eta].sub.l] [s.sub.l] [v.sub.l] 0 [[xi].sub.0] 0 0 1 [[xi].sub.1] 0 0 2 [[xi].sub.3] 0 0 3 [[xi].sub.9] 0 0 4 [[xi].sub.129] 0 0 5 [[xi].sub.11] 1 0 6 [[xi].sub.131] [square root of (2)] 0 7 [[xi].sub.41] [square root of (3)] 0 8 [[xi].sub.15] 2 0 9 [[xi].sub.43] 3 + [square root of (3)]/2 1/6 10 [[xi].sub.139] 1 + [square root of (2)] 1/6 11 [[xi].sub.153] 2 [square root of (2)] 0 12 [[xi].sub.105] 2 [square root of (3)] 1/3 13 [[xi].sub.99] 1/2 + [square root of (2)] + 1/6 [square root of (3)]/2 14 [[xi].sub.214] 3 (1 + [square root of (3)])/2 1/2 15 [[xi].sub.124] 3 + [square root of (3)]/2 + 1/3 [square root of (2)] 16 [[xi].sub.248] 2 + [square root of (2)] 1/3 17 [[xi].sub.126] 3 + [square root of (3)] 2/3 18 [[xi].sub.246] 3 + [square root of (3)] 2/3 19 [[xi].sub.252] 3 + [square root of (2)] 1/2 20 [[xi].sub.254] 9/2 + [square root of (3)]/2 5/6 21 [[xi].sub.255] 6 1 Table 4. The values of the constants [c.sub.1], [c.sub.2], [c.sub.3] for the continuous case, cf. Eq. 28, and the four considered pairs of complementary adjacency systems. [10.sup.3] [c.sub.2] [10.sup.3] [c.sub.1] [c.sub.3] continuous 0 -0.5 8.181 ... ([F.sub.26], [F.sub.6]) 0 -0.75 15.625 ([F.sub.14.1], [F.sub.14.1]) -1.248 ... -0.105 ... 12.770 ... ([F.sub.14.2], [F.sub.14.2]) -3.294 ... -0.110 ... 13.918 ... ([F.sub.6], [F.sub.26]) -0.409 ... -0.547 ... -9.449 ...

Printer friendly Cite/link Email Feedback | |

Author: | Ohser, Joachim; Nagel, Werner; Schladitz, Katja |
---|---|

Publication: | Image Analysis and Stereology |

Article Type: | Technical report |

Geographic Code: | 1USA |

Date: | Jun 1, 2009 |

Words: | 11892 |

Previous Article: | Moments of the length of line segments in homogeneous planar STIT tessellations. |

Next Article: | Image segmentation: a watershed transformation algorithm. |

Topics: |

## Reader Opinion