arXiv subjects

Thomas Hotz

Publications and source records attributed to Thomas Hotz.

16 recordsLinked to original sources

arXiv2024

Benedetti's constructions of ovals

Giovanni Battista Benedetti (1530--1590) derived two constructions of ovals given their minor and major axes. These were published in 1585 and seem to be the first solution to this problem. Therefore, the generally accepted view that ``the geometrical construction for drawing an oval for any given proportion was not known in the sixteenth century'' (Ana L\'opez-Mozo, 2011; Nexus Network Journal, p. 571) has to be revised. We provide a transcription of Benedetti's Latin text as well as a translation into English and analyze his mathematical reasoning in detail. This is the first main focus of the present note. The second focus is the impact of Benedetti's contributions to ovals. In particular, it is observed that they were rarely mentioned in the mathematical and architectural literature.

math.HO↗

arXiv2024

Quantifying the Resolution of a Template after Image Registration

In many image processing applications (e.g. computational anatomy) a groupwise registration is performed on a sample of images and a template image is simultaneously generated. From the template alone it is in general unclear to which extent the registered images are still spatially misaligned. The local spatial variation left after registration may be seen as the resolution of the resulting template. In this sense we develop the first template resolution measure (TRM) quantifying the misalignment at each location of the template. The TRM is based on the key insight that the size of such misalignments can be determined as the amount of smoothing required to bring the registered images in agreement. This relationship is mathematically derived from characteristic examples in one dimension. This way, the TRM quantifies the remaining spatial variation in the template's units of length. Furthermore we propose to enhance the template by an effective visualization of its resolution measure. Finally we demonstrate the TRM's applicability and validate its interpretability for example datasets in two and three dimensions. The corresponding code is publicly available on GitHub.

eess.IV↗

arXiv2022

Central limit theorem for intrinsic Frechet means in smooth compact Riemannian manifolds

We prove a central limit theorem (CLT) for the Frechet mean of independent and identically distributed observations in a compact Riemannian manifold assuming that the population Frechet mean is unique. Previous general CLT results in this setting have assumed that the cut locus of the Frechet mean lies outside the support of the population distribution. So far as we are aware, the CLT in the present paper is the first which allows the cut locus to have co-dimension one or two when it is included in the support of the distribution. A key part of the proof is establishing an asymptotic approximation for the parallel transport of a certain vector field. Whether or not a non-standard term arises in the CLT depends on whether the co-dimension of the cut locus is one or greater than one: in the former case a non-standard term appears but not in the latter case. This is the first paper to give a general and explicit expression for the non-standard term which arises when the co-dimension of the cut locus is one.

math.PR↗

arXiv2021

Regional estimates of reproduction numbers with application to COVID-19

In the last year many public health decisions were based on real-time monitoring the spread of the ongoing COVID-19 pandemic. For this one often considers the reproduction number which measures the amount of secondary cases produced by a single infectious individual. While estimates of this quantity are readily available on the national level, subnational estimates, e.g. on the county level, pose more difficulties since only few incidences occur there. However, as countermeasures to the pandemic are usually enforced on the subnational level, such estimates are of great interest to assess the efficacy of the measures taken, and to guide future policy. We present a novel extension of the well established estimator of the country level reproduction number to the county level by applying techniques from small-area estimation. This new estimator yields sensible estimates of reproduction numbers both on the country and county level. It can handle low and highly variable case counts on the county level, and may be used to distinguish local outbreaks from more widespread ones. We demonstrate the capabilities of our novel estimator by a simulation study and by applying the estimator to German case data.

stat.AP↗

arXiv2021

How to coordinate vaccination and social distancing to mitigate SARS-CoV-2 outbreaks

Most countries have started vaccinating people against COVID-19. However, due to limited production capacities and logistical challenges it will take months/years until herd immunity is achieved. Therefore, vaccination and social distancing have to be coordinated. In this paper, we provide some insight on this topic using optimization-based control on an age-differentiated compartmental model. For real-life decision making, we investigate the impact of the planning horizon on the optimal vaccination/social distancing strategy. We find that in order to reduce social distancing in the long run, without overburdening the healthcare system, it is essential to vaccinate the people with the highest contact rates first. That is also the case if the objective is to minimize fatalities provided that the social distancing measures are sufficiently strict. However, for short-term planning it is optimal to focus on the high-risk group.

physics.soc-ph↗

arXiv2020

How much testing and social distancing is required to control COVID-19? Some insight based on an age-differentiated compartmental model

In this paper, we provide insights on how much testing and social distancing is required to control COVID-19. To this end, we develop a compartmental model that accounts for key aspects of the disease: 1) incubation time, 2) age-dependent symptom severity, and 3) testing and hospitalization delays; the model's parameters are chosen based on medical evidence, and, for concreteness, adapted to the German situation. Then, optimal mass-testing and age-dependent social-distancing policies are determined by solving optimal control problems both in open loop and within a model predictive control framework. We aim to minimize testing and/or social distancing until herd immunity sets in under a constraint on the number of available intensive care units. We find that an early and short lockdown is inevitable but can be slowly relaxed over the following months.

math.OC↗

arXiv2020

Monitoring the spread of COVID-19 by estimating reproduction numbers over time

To control the current outbreak of the Coronavirus Disease 2019, constant monitoring of the epidemic is required since, as of today, no vaccines or antiviral drugs against it are known. We provide daily updated estimates of the reproduction number over time at https://stochastik-tu-ilmenau.github.io/COVID-19/. In this document, we describe the estimator we are using which was developed in (Fraser 2007), derive its asymptotic properties, and we give details on its implementation. Furthermore, we validate the estimator on simulated data, demonstrate that estimates on real data lead to plausible results, and perform a sensitivity analysis. Finally, we discuss why the estimates obtained need to be interpreted with care.

q-bio.PE↗

arXiv2018

Manifolds of Projective Shapes

The projective shape of a configuration of k points or "landmarks" in RP(d) consists of the information that is invariant under projective transformations and hence is reconstructable from uncalibrated camera views. Mathematically, the space of projective shapes for these k landmarks can be described as the quotient space of k copies of RP(d) modulo the action of the projective linear group PGL(d). Using homogeneous coordinates, such configurations can be described as real k-times-(d+1)-dimensional matrices given up to left-multiplication of non-singular diagonal matrices, while the group PGL(d) acts as GL(d+1) from the right. The main purpose of this paper is to give a detailed examination of the topology of projective shape space, and, using matrix notation, it is shown how to derive subsets that are in a certain sense maximal, differentiable Hausdorff manifolds which can be provided with a Riemannian metric. A special subclass of the projective shapes consists of the Tyler regular shapes, for which geometrically motivated pre-shapes can be defined, thus allowing for the construction of a natural Riemannian metric.

math.ST↗

arXiv2018

An algorithm for computing Fréchet means on the sphere

For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special global problem over the sphere, namely the determination of Fréchet means, which are points minimising the mean distance to a given set of points. The Branch and Bound method derived needs no further assumptions on the input data, but is able to cope with this objective function which is neither convex nor differentiable. The algorithm's performance is tested on simulated and real data.

stat.CO↗

arXiv2017

Sparsity Order Estimation from a Single Compressed Observation Vector

We investigate the problem of estimating the unknown degree of sparsity from compressive measurements without the need to carry out a sparse recovery step. While the sparsity order can be directly inferred from the effective rank of the observation matrix in the multiple snapshot case, this appears to be impossible in the more challenging single snapshot case. We show that specially designed measurement matrices allow to rearrange the measurement vector into a matrix such that its effective rank coincides with the effective sparsity order. In fact, we prove that matrices which are composed of a Khatri-Rao product of smaller matrices generate measurements that allow to infer the sparsity order. Moreover, if some samples are used more than once, one of the matrices needs to be Vandermonde. These structural constraints reduce the degrees of freedom in choosing the measurement matrix which may incur in a degradation in the achievable coherence. We thus also address suitable choices of the measurement matrices. In particular, we analyze Khatri-Rao and Vandermonde matrices in terms of their coherence and provide a new design for Vandermonde matrices that achieves a low coherence.

cs.IT↗

arXiv2016

Non-asymptotic Confidence Sets for Extrinsic Means on Spheres and Projective Spaces

Confidence sets from i.i.d. data are constructed for the extrinsic mean of a probabilty measure P on spheres, real projective spaces, and complex projective spaces, as well as Grassmann manifolds, with the latter three embedded by the Veronese-Whitney embedding. When the data are sufficiently concentrated, these are projections of a ball around the corresponding Euclidean sample mean. Furthermore, these confidence sets are rate-optimal. The usefulness of this approach is illustrated for projective shape data.

math.ST↗

arXiv2013

Sticky central limit theorems on open books

Given a probability distribution on an open book (a metric space obtained by gluing a disjoint union of copies of a half-space along their boundary hyperplanes), we define a precise concept of when the Fréchet mean (barycenter) is sticky. This nonclassical phenomenon is quantified by a law of large numbers (LLN) stating that the empirical mean eventually almost surely lies on the (codimension $1$ and hence measure $0$) spine that is the glued hyperplane, and a central limit theorem (CLT) stating that the limiting distribution is Gaussian and supported on the spine. We also state versions of the LLN and CLT for the cases where the mean is nonsticky (i.e., not lying on the spine) and partly sticky (i.e., is, on the spine but not sticky).

math.PR↗

arXiv2012

Representation by Integrating Reproducing Kernels

Based on direct integrals, a framework allowing to integrate a parametrised family of reproducing kernels with respect to some measure on the parameter space is developed. By pointwise integration, one obtains again a reproducing kernel whose corresponding Hilbert space is given as the image of the direct integral of the individual Hilbert spaces under the summation operator. This generalises the well-known results for finite sums of reproducing kernels; however, many more special cases are subsumed under this approach: so-called Mercer kernels obtained through series expansions; kernels generated by integral transforms; mixtures of positive definite functions; and in particular scale-mixtures of radial basis functions. This opens new vistas into known results, e.g. generalising the Kramer sampling theorem; it also offers interesting connections between measurements and integral transforms, e.g. allowing to apply the representer theorem in certain inverse problems, or bounding the pointwise error in the image domain when observing the pre-image under an integral transform.

math.FA↗

arXiv2011

Intrinsic Means on the Circle: Uniqueness, Locus and Asymptotics

This paper gives a comprehensive treatment of local uniqueness, asymptotics and numerics for intrinsic means on the circle. It turns out that local uniqueness as well as rates of convergence are governed by the distribution near the antipode. In a nutshell, if the distribution there is locally less than uniform, we have local uniqueness and asymptotic normality with a rate of 1 / \surdn. With increased proximity to the uniform distribution the rate can be arbitrarly slow, and in the limit, local uniqueness is lost. Further, we give general distributional conditions, e.g. unimodality, that ensure global uniqueness. Along the way, we discover that sample means can occur only at the vertices of a regular polygon which allows to compute intrinsic sample means in linear time from sorted data. This algorithm is finally applied in a simulation study demonstrating the dependence of the convergence rates on the behavior of the density at the antipode.

stat.ME↗

arXiv2010

Modeling the growth of fingerprints improves matching for adolescents

We study the effect of growth on the fingerprints of adolescents, based on which we suggest a simple method to adjust for growth when trying to recover a juvenile's fingerprint in a database years later. Based on longitudinal data sets in juveniles' criminal records, we show that growth essentially leads to an isotropic rescaling, so that we can use the strong correlation between growth in stature and limbs to model the growth of fingerprints proportional to stature growth as documented in growth charts. The proposed rescaling leads to a 72% reduction of the distances between corresponding minutiae for the data set analyzed. These findings were corroborated by several verification tests. In an identification test on a database containing 3.25 million right index fingers at the Federal Criminal Police Office of Germany, the identification error rate of 20.8% was reduced to 2.1% by rescaling. The presented method is of striking simplicity and can easily be integrated into existing automated fingerprint identification systems.

cs.CV↗

arXiv2010

Locally adaptive image denoising by a statistical multiresolution criterion

We demonstrate how one can choose the smoothing parameter in image denoising by a statistical multiresolution criterion, both globally and locally. Using inhomogeneous diffusion and total variation regularization as examples for localized regularization schemes, we present an efficient method for locally adaptive image denoising. As expected, the smoothing parameter serves as an edge detector in this framework. Numerical examples illustrate the usefulness of our approach. We also present an application in confocal microscopy.

stat.ME↗