arXiv subjects

Tomas Sauer

Publications and source records attributed to Tomas Sauer.

At least 19 recordsLinked to original sources

arXiv2026

A regularization method for planar offset curves and bi-offset recognition

Offset curves for planar trajectories are interesting in the generation of tool paths for numerically controlled industrial machines and in trajectory planning methods for autonomous driving systems. Theoretical offset curves may exhibit peculiar singularities, including self-intersections, which limit their use in practical applications. Existing approaches address these issue through geometric filtering techniques to detect and remove undesirable features but the computation of accurate and well-behaved offset curves remains a challenging task. We assume a first stage of functional approximation of trajectories by penalized Hermite spline regression enabling the simultaneous fitting of positions and tangents. The regularization is imposed on the second derivatives, effectively mitigating the jerk effect, which is particularly relevant in motion planning and path smoothing applications. Then, taking into account the geometrical pointwise properties of the resulting curve, we design two offset curves through the simultaneous approximation of function values and derivatives. Then, a mathematical model to obtain the so-called bi-offset as most fitting as with the original generator curve is proposed, also relating the offset range and pointwise curvature values. The adaptive reconstruction of the center line from the external boundaries is a topic of interest and is the main focus of our work. Numerical experiments confirm the reliability of our approach at every stage of the resolution process.

math.NA↗

arXiv2023

Continued fractions and orthogonal polynomials in several variables

We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition for the characterization is the commutativity of the multiplication operators on finite polynomial subspaces modulo an ideal. Moreover, starting from the orthogonal polynomials or the three-term recurrence, our method constructs a sequence of moment sequences that provides an approximation of the maximal order for recovering the moment sequence that defines the orthogonality.

math.CA↗

arXiv2022

Geometric Active Learning for Segmentation of Large 3D Volumes

Segmentation, i.e., the partitioning of volumetric data into components, is a crucial task in many image processing applications ever since such data could be generated. Most existing applications nowadays, specifically CNNs, make use of voxelwise classification systems which need to be trained on a large number of annotated training volumes. However, in many practical applications such data sets are seldom available and the generation of annotations is time-consuming and cumbersome. In this paper, we introduce a novel voxelwise segmentation method based on active learning on geometric features. Our method uses interactively provided seed points to train a voxelwise classifier based entirely on local information. The combination of an ad hoc incorporation of domain knowledge and local processing results in a flexible yet efficient segmentation method that is applicable to three-dimensional volumes without size restrictions. We illustrate the potential and flexibility of our approach by applying it to selected computed tomography scans where we perform different segmentation tasks to scans from different domains and of different sizes.

cs.CV↗

arXiv2022

Feature-Adaptive Interactive Thresholding of Large 3D Volumes

Thresholding is the most widely used segmentation method in volumetric image processing, and its pointwise nature makes it attractive for the fast handling of large three-dimensional samples. However, global thresholds often do not properly extract components in the presence of artifacts, measurement noise or grayscale value fluctuations. This paper introduces Feature-Adaptive Interactive Thresholding (FAITH), a thresholding technique that incorporates (geometric) features, local processing and interactive user input to overcome these limitations. Given a global threshold suitable for most regions, FAITH uses interactively selected seed voxels to identify critical regions in which that threshold will be adapted locally on the basis of features computed from local environments around these voxels. The combination of domain expert knowledge and a rigorous mathematical model thus enables a very exible way of local thresholding with intuitive user interaction. A qualitative analysis shows that the proposed model is able to overcome limitations typically occuring in plain thresholding while staying efficient enough to also allow the segmentation of big volumes.

cs.CV↗

arXiv2022

Haar Wavelets, Gradients and Approximate TV Regularization

We show how total variation regularization of images in arbitrary dimensions can be approximately performed by applying appropriate shrinkage to some Haar wavelets coefficients. The approach works directly on the wavelet coefficients and is therefore suited for the application on large volumes from computed tomography.

math.NA↗

arXiv2021

Hermite multiwavelets for manifold-valued data

In this paper we present a construction of interpolatory Hermite multiwavelets for functions that take values in nonlinear geometries such as Riemannian manifolds or Lie groups. We rely on the strong connection between wavelets and subdivision schemes to define a prediction-correction approach based on Hermite subdivision schemes that operate on manifold-valued data. The main result concerns the decay of the wavelet coefficients: We show that our manifold-valued construction essentially admits the same coefficient decay as linear Hermite wavelets, which also generalizes results on manifold-valued scalar wavelets.

math.NA↗

arXiv2019

Background Subtraction using Adaptive Singular Value Decomposition

An important task when processing sensor data is to distinguish relevant from irrelevant data. This paper describes a method for an iterative singular value decomposition that maintains a model of the background via singular vectors spanning a subspace of the image space, thus providing a way to determine the amount of new information contained in an incoming frame. We update the singular vectors spanning the background space in a computationally efficient manner and provide the ability to perform block-wise updates, leading to a fast and robust adaptive SVD computation. The effects of those two properties and the success of the overall method to perform a state of the art background subtraction are shown in both qualitative and quantitative evaluations.

cs.CV↗

arXiv2019

Polynomial overreproduction by Hermite subdivision operators, and $p$-Cauchy numbers

We study the case of Hermite subdivision operators satisfying a spectral condition of order greater than their size. We show that this can be characterized by operator factorizations involving Taylor operators and difference factorizations of a rank one vector scheme. Giving explicit expressions for the factorization operators, we put into evidence that the factorization only depends on the order of the spectral condition but not on the polynomials that define it. We further show that the derivation of these operators is based on an interplay between Stirling numbers and $p$-Cauchy numbers (or generalized Gregory coefficients).

math.NA↗

arXiv2018

SVD update methods for large matrices and applications

We consider the problem of updating the SVD when augmenting a "tall thin" matrix, i.e., a rectangular matrix $A \in \RR^{m \times n}$ with $m \gg n$. Supposing that an SVD of $A$ is already known, and given a matrix $B \in \RR^{m \times n'}$, we derive an efficient method to compute and efficiently store the SVD of the augmented matrix $[ A B ] \in \RR^{m \times (n+n')}$. This is an important tool for two types of applications: in the context of principal component analysis, the dominant left singular vectors provided by this decomposition form an orthonormal basis for the best linear subspace of a given dimension, while from the right singular vectors one can extract an orthonormal basis of the kernel of the matrix. We also describe two concrete applications of these concepts which motivated the development of our method and to which it is very well adapted.

math.NA↗

arXiv2018

Hankel and Toeplitz operators of finite rank and Prony's problem in several variables

Prony's problem in several variables has attracted some attention recently and provides an interesting combination of polynomial ideal theory with analytic and numeric computations. This note points out further connections to Hankel operators of finite rank as they appear in multidimensional moment problems, shift invariance signal spaces, annihilating ideals of filters and factorization of the Hankel matrices and operators by means of Vandermonde matrices. In fact, it turns out that these concepts are essentially equivalent.

math.NA↗

arXiv2018

Filters for anisotropic wavelet decompositions

Like the continous shearlet transform and their relatives, discrete transformations based on the interplay between several filterbanks with anisotropic dilations provide a high potential to recover directed features in two and more dimensions. Due to simplicity, most of the directional systems constructed so far were using prediction--correction methods based on interpolatory subdivision schemes. In this paper, we give a simple but effective construction for QMF (quadrature mirror filter) filterbanks which are the discrete object between orthogonal wavelet analysis. We also characterize when the filterbank gives rise to the existence of refinable functions and hence wavelets and give a generalized shearlet construction for arbitrary dimensions and arbitrary scalings for which the filterbank construction ensures the existence of an orthogonal wavelet analysis.

math.NA↗

arXiv2018

Numerical computation of H-bases

This paper gives a numerically stable method to compute H-basis which is based on the computing a minimal basis for the module of syzygies using singular value decomposition. We illustrate the performance of this method by means of various examples.

math.AC↗

arXiv2018

Generalized Taylor operators and Hermite subdivision schemes

Hermite subdivision schemes act on vector valued data that is not only considered as functions values in $\mathbb{R}^r$, but as consecutive derivatives, which leads to a mild form of level dependence of the scheme. Previously, we have proved that a property called spectral condition or sum rule implies a factorization in terms of a generalized difference operator that gives rise to a "difference scheme" whose contractivity governs the convergence of the scheme. But many convergent Hermite schemes, for example, those based on cardinal splines, do not satisfy the spectral condition. In this paper, we generalize the property in a way that preserves all the above advantages: the associated factorizations and convergence theory. Based on these results, we can include the case of cardinal splines and also enables us to construct new types of convergent Hermite subdivision schemes.

math.NA↗

arXiv2018

Level-dependent interpolatory Hermite subdivision schemes and wavelets

We study many properties of level-dependent Hermite subdivision, focusing on schemes preserving polynomial and exponential data. We specifically consider interpolatory schemes, which give rise to level-dependent multiresolution analyses through a prediction-correction approach. A result on the decay of the associated multiwavelet coefficients, corresponding to a uniformly continuous and differentiable function, is derived. It makes use of the approximation of any such function with a generalized Taylor formula expressed in terms of polynomials and exponentials.

math.NA↗

arXiv2017

Numerically robust computation of circular visibility

We address the question of whether a point inside a domain bounded by a simple closed arc spline is circularly visible from a specified arc from the boundary. We provide a simple and numerically stable linear time algorithm that solves this problem. In particular, we present an easy-to-check criterion that implies that a point is not visible from a specified boundary arc.

cs.CG↗

arXiv2017

Modeling variational inpainting methods with splines

Mathematical methods of image inpainting involve the discretization of given continuous models. We present a method that avoids the standard pointwise discretization by modeling known variational approaches, in particular total variation (TV), using a finite dimensional spline space. Besides the analysis of the resulting model, we present a numerical implementation based on the alternating method of multipliers. We compare the results numerically with classical TV inpainting and give examples of applications.

math.NA↗

arXiv2016

Reconstructing sparse exponential polynomials from samples: Stirling numbers and Hermite interpolation

Prony's method, in its various concrete algorithmic realizations, is concerned with the reconstruction of a sparse exponential sum from integer samples. In several variables, the reconstruction is based on finding the variety for a zero dimensional radical ideal. If one replaces the coefficients in the representation by polynomials, i.e., tries to recover sparse exponential polynomials, the zeros associated to the ideal have multiplicities attached to them . The precise relationship between the coefficients in the exponential polynomial and the multiplicity spaces are pointed out in this paper.

math.NA↗

arXiv2016

Observations on interpolation by total degree polynomials in two variables

In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for interpolation sets have been devised, the most popular ones being based on intersections of lines. In this paper, we study algebraic properties of some such interpolation configurations, namely the approaches by Radon-Berzolari and Chung-Yao. By means of proper H-bases for the vanishing ideal of the configuration, we derive properties of the matrix of first syzygies of this ideal which allow us to draw conclusions on the geometry of the point configuration.

math.NA↗