Evgueni Spodarev

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)
  • 1