#### Filter Results:

#### Publication Year

2005

2007

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in R d discretized with respect to a given regular lattice. For this purpose, a polyhedral approximation is used to reconstruct their boundary structure. In the planar case d = 2, the performance and precision of the… (More)

We give algorithms for the simultaneous computation of the area, boundary length and connectivity (the so–called Minkowski functionals) of binary images. It is assumed that a binary image is a discretization of a two–dimensional polyconvex set which is a union of convex components. Edge–corrected versions of these algorithms are used for the estimation of… (More)

Random closed sets (RACS) in the d–dimensional Euclidean space are considered , whose realizations belong to the extended convex ring. A family of non-parametric estimators is investigated for the simultaneous estimation of the vector of all specific Minkowski functionals (or, equivalently, the specific intrinsic volumes) of stationary RACS. The… (More)

- ‹
- 1
- ›