×

Local digital estimators of intrinsic volumes for Boolean models and in the design-based setting. (English) Zbl 1350.94014

Summary: In order to estimate the specific intrinsic volumes of a planar Boolean model from a binary image, we consider local digital algorithms based on weighted sums of \(2\times 2\) configuration counts. For Boolean models with balls as grains, explicit formulas for the bias of such algorithms are derived, resulting in a set of linear equations that the weights must satisfy in order to minimize the bias in high resolution. These results generalize to larger classes of random sets, as well as to the design-based situation, where a fixed set is observed on a stationary isotropic lattice. Finally, the formulas for the bias obtained for Boolean models are applied to existing algorithms in order to compare their accuracy.

MSC:

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
60D05 Geometric probability and stochastic geometry
62M40 Random fields; image analysis

References:

[1] Bieri, H. and Nef, W. (1984). Algorithms for the Euler characteristic and related additive functionals of digital objects. Comput. Vision Graphics Image Process. 28 , 166-175. · Zbl 0599.68052 · doi:10.1016/S0734-189X(84)80019-5
[2] Dorst, L. and Smeulders, A. W. M. (1987). Length estimators for digitized contours. Comput. Vision Graphics Image Process. 40 , 311-333.
[3] Freeman, H. (1970). Boundary encoding and processing. In Picture Processing and Psychopictorics , eds B. S. Lipkin and A. Rosenfeld, Academic Press, New York, pp. 241-266.
[4] Hug, D., Last, G. and Weil, W. (2004). A local Steiner-type formula for general closed sets and applications. Math. Z. 246 , 237-272. · Zbl 1059.53061 · doi:10.1007/s00209-003-0597-9
[5] Kampf, J. (2012) A limitation of the estimation of intrinsic volumes via pixel configuration counts. WiMa Rep. 144, University of Kaiserslautern. · Zbl 1302.65057
[6] Kampf, J. and Kiderlen, M. (2013). Large parallel volumes of finite and compact sets in \(d\)-dimensional Euclidean space. Documenta Math. 18 , 275-295. · Zbl 1266.51034
[7] Kiderlen, M. and Rataj, J. (2006). On infinitesimal increase of volumes of morphological transforms. Mathematika 53 , 103-127. · Zbl 1117.28002 · doi:10.1112/S002557930000005X
[8] Kiderlen, M. and Vedel Jensen, E. B. (2003). Estimation of the directional measure of planar random sets by digitization. Adv. Appl. Prob. 35 , 583-602. · Zbl 1040.60008 · doi:10.1239/aap/1059486819
[9] Klette, R. and Rosenfeld, A. (2004). Digital Geometry . Morgan Kaufmann, San Fransisco, CA. · Zbl 1064.68090
[10] Ohser, J. and Mücklich, F. (2000). Statistical Analysis of Microstructures in Materials Science . John Wiley, New York. · Zbl 0960.62129
[11] Ohser, J., Nagel, W. and Schladitz, K. (2003). The Euler number of discretised sets–surprising results in three dimensions. Image Anal. Stereol. 22 , 11-19. · Zbl 1398.94045
[12] Ohser, J., Nagel, W. and Schladitz, K. (2009). Miles formulae for Boolean models observed on lattices. Image Anal. Stereol. 28 , 77-92. · Zbl 1183.65022 · doi:10.5566/ias.v28.p77-92
[13] Schneider, R. (1993). Convex Bodies: The Brunn-Minkowski Theory (Encyclopedia Math. Appl. 44 ). Cambridge University Press. · Zbl 0798.52001
[14] Schneider, R. and Weil, W. (2008). Stochastic and Integral Geometry . Springer, Berlin. · Zbl 1175.60003
[15] Stelldinger, P. and Köthe, U. (2005). Shape preserving digitization of binary images after blurring. In Discrete Geometry for Computer Iimagery (Lecture Notes Comput. Sci. 3429 ), Springer, Berlin, pp. 383-391. · Zbl 1118.68742 · doi:10.1007/b135490
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.