A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets

DOI10.1016/J.COMGEO.2006.02.002MaRDI QIDQ2495945zbMATH OpenOpenAlexFDO

Authors Simone Klenk, Evgeny Spodarev, Volker Schmidt

Publication date 30 June 2006

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2006.02.002

zbMATH Keywords

algorithmdiscretizationfinite convex setsMinkowski functionalsnumerical experimentsplanar case

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Review text

A new approach to the computation of Minkowski functionals for finite unions of convex sets in \(\mathbb{R}^d\), \(d\geq 2\), is presented. The proposed algorithm allows the simultaneous computation of all Minkowski functionals, except for the volume, and is quite flexible since it depends on an \(d\)-ple of free parameters which have the meaning of dilation radii. The computations can be arranged in such a way that one single scan of the image is required. Some suggestions for an appropriate choice of dilation radii and an upper bound on the computational error are given. In particular, the case \(d= 2\) is widely studied and the results of numerical experiments are presented, discussed and compared to those of conventional computation methods.

Recommendations

• COMPUTATION OF MINKOWSKI MEASURES ON 2D AND 3D BINARY IMAGES
• Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
• Minkowski tensors of anisotropic spatial structure
• scientific article; zbMATH DE number 1728309
• Improvements on surface Minkowsky functionals calculus

Cites work

• scientific article; zbMATH DE number 446693 (Why is no real title available?)
• scientific article; zbMATH DE number 3902440 (Why is no real title available?)
• scientific article; zbMATH DE number 1455129 (Why is no real title available?)
• scientific article; zbMATH DE number 1903408 (Why is no real title available?)
• scientific article; zbMATH DE number 236540 (Why is no real title available?)
• Joint estimators for the specific intrinsic volumes of stationary random sets

Cited in

(15)

• On a new algorithm for the computation of enclosures for the Titchmarsh-Weyl \(m\)-function
• A new geometric approach to data analysis using the Minkowski polytope.
• The effect of discretization on the mean geometry of a 2D random field
• On the estimation of intrinsic volume densities of stationary random closed sets
• Improvements on surface Minkowsky functionals calculus
• Asymptotic properties of estimators for the volume fractions of jointly stationary random sets
• Pixelations of planar semialgebraic sets and shape recognition
• Single scan granulometry estimation from an asymmetric distance map
• Voronoi-based estimation of Minkowski tensors from finite point samples
• Valuations in Image Analysis
• Local digital algorithms applied to Boolean models
• Characterizing digital microstructures by the Minkowski‐based quadratic normal tensor
• Simulating stochastic geometries: Morphology of overlapping grains
• Estimation of fractal dimension and fractal curvatures from digital images
• Approximations of the Wiener sausage and its curvature measures

Describes a project that uses

Uses Software

• GeoStoch

This page was built for publication: A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495945)