Saved in:
Bibliographic Details
Main Authors: Hug, Daniel, Klatt, Michael A., Pabst, Dominik
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.00092
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908933882380288
author Hug, Daniel
Klatt, Michael A.
Pabst, Dominik
author_facet Hug, Daniel
Klatt, Michael A.
Pabst, Dominik
contents Minkowski tensors, also known as tensor valuations, provide robust $n$-point information for a wide range of random spatial structures. Local estimators for point clouds, e.g., representing voxelized data, however, are unavoidably biased even in the limit of infinitely high resolution. Here, we substantially improve a recently proposed, asymptotically unbiased algorithm to estimate Minkowski tensors from point clouds. Our improved algorithm is more robust and efficient. Moreover we generalize the theoretical foundations for an asymptotically bias-free estimation of the interfacial tensors, among others, to the case of finite unions of compact sets with positive reach, which is relevant for many applications like rough surfaces or composite materials. As a realistic test case of random spatial structures, we consider random (beta) polytopes. We first derive explicit expressions of the expected Minkowski tensors, which we then compare to our simulation results. We obtain precise estimates with relative errors of a few percent for practically relevant resolutions. Finally, we apply our methods to real data of metallic grains and nanorough surfaces, and we provide an open-source python package, which works in any dimension.
format Preprint
id arxiv_https___arxiv_org_abs_2502_00092
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Minkowski tensors for point clouds and voxelized data: robust, asymptotically unbiased estimators
Hug, Daniel
Klatt, Michael A.
Pabst, Dominik
Statistics Theory
Disordered Systems and Neural Networks
Metric Geometry
Probability
94A08, 68U10, 60D05, 53C65, 28A75, 62H35, 52A22
Minkowski tensors, also known as tensor valuations, provide robust $n$-point information for a wide range of random spatial structures. Local estimators for point clouds, e.g., representing voxelized data, however, are unavoidably biased even in the limit of infinitely high resolution. Here, we substantially improve a recently proposed, asymptotically unbiased algorithm to estimate Minkowski tensors from point clouds. Our improved algorithm is more robust and efficient. Moreover we generalize the theoretical foundations for an asymptotically bias-free estimation of the interfacial tensors, among others, to the case of finite unions of compact sets with positive reach, which is relevant for many applications like rough surfaces or composite materials. As a realistic test case of random spatial structures, we consider random (beta) polytopes. We first derive explicit expressions of the expected Minkowski tensors, which we then compare to our simulation results. We obtain precise estimates with relative errors of a few percent for practically relevant resolutions. Finally, we apply our methods to real data of metallic grains and nanorough surfaces, and we provide an open-source python package, which works in any dimension.
title Minkowski tensors for point clouds and voxelized data: robust, asymptotically unbiased estimators
topic Statistics Theory
Disordered Systems and Neural Networks
Metric Geometry
Probability
94A08, 68U10, 60D05, 53C65, 28A75, 62H35, 52A22
url https://arxiv.org/abs/2502.00092