Search arXivSearch

arXiv subjects

Stephan Schmidt

Publications and source records attributed to Stephan Schmidt.

At least 19 recordsLinked to original sources

Geometry Denoising with Preferred Normal Vectors

We introduce a new paradigm for geometry denoising using prior knowledge about the surface normal vector. This prior knowledge comes in the form of a set of preferred normal vectors, which we refer to as label vectors. A segmentation problem is naturally embedded in the denoising process. The segmentation is based on the similarity of the normal vector to the elements of the set of label vectors. Regularization is achieved by a total variation term. We formulate a split Bregman (ADMM) approach to solve the resulting optimization problem. The vertex update step is based on second-order shape calculus. We present various examples including the denoising of an eroded medieval gravestone inscription.

cs.CV

Towards a data-scale independent regulariser for robust sparse identification of non-linear dynamics

Data normalisation, a common and often necessary preprocessing step in engineering and scientific applications, can severely distort the discovery of governing equations by magnitudebased sparse regression methods. This issue is particularly acute for the Sparse Identification of Nonlinear Dynamics (SINDy) framework, where the core assumption of sparsity is undermined by the interaction between data scaling and measurement noise. The resulting discovered models can be dense, uninterpretable, and physically incorrect. To address this critical vulnerability, we introduce the Sequential Thresholding of Coefficient of Variation (STCV), a novel, computationally efficient sparse regression algorithm that is inherently robust to data scaling. STCV replaces conventional magnitude-based thresholding with a dimensionless statistical metric, the Coefficient Presence (CP), which assesses the statistical validity and consistency of candidate terms in the model library. This shift from magnitude to statistical significance makes the discovery process invariant to arbitrary data scaling. Through comprehensive benchmarking on canonical dynamical systems and practical engineering problems, including a physical mass-spring-damper experiment, we demonstrate that STCV consistently and significantly outperforms standard Sequential Thresholding Least Squares (STLSQ) and Ensemble-SINDy (E-SINDy) on normalised, noisy datasets. The results show that STCV-based methods can successfully identify the correct, sparse physical laws even when other methods fail. By mitigating the distorting effects of normalisation, STCV makes sparse system identification a more reliable and automated tool for real-world applications, thereby enhancing model interpretability and trustworthiness.

cs.LG

A First Step Towards Mesh-Free Probabilistic Shape Optimization

We present an initial implementation of a probabilistic PDE-constrained shape optimization algorithm. Our method is based on a novel probabilistic representation of the shape derivative, which is evaluated using Monte Carlo sampling; and does not rely on a mesh. The underlying state is represented with a neural network-based PDE solver on point clouds. The methodology is applied throughout to a benchmark tracking problem.

math.OC

Two Models for Surface Segmentation using the Total Variation of the Normal Vector

We consider the problem of surface segmentation, where the goal is to partition a surface represented by a triangular mesh. The segmentation is based on the similarity of the normal vector field to a given set of label vectors. We propose a variational approach and compare two different regularizers, both based on a total variation measure. The first regularizer penalizes the total variation of the assignment function directly, while the second regularizer penalizes the total variation in the label space. In order to solve the resulting optimization problems, we use variations of the split Bregman (ADMM) iteration adapted to the problem at hand. While computationally more expensive, the second regularizer yields better results in our experiments. In particular it removes noise more reliably in regions of constant curvature. In order to mitigate the computational cost, we present a manifold Newton scheme for the most expensive subproblem, which is related to the Riemannian center of mass on a sphere. This significantly improves the computational cost.

cs.CV

Total Generalized Variation of the Normal Vector Field and Applications to Mesh Denoising

We propose a novel formulation for the second-order total generalized variation (TGV) of the normal vector on an oriented, triangular mesh embedded in $\R^3$. The normal vector is considered as a manifold-valued function, taking values on the unit sphere. Our formulation extends previous discrete TGV models for piecewise constant scalar data that utilize a Raviart-Thomas function space. To extend this formulation to the manifold setting, a tailor-made tangential Raviart-Thomas type finite element space is constructed in this work. The new regularizer is compared to existing methods in mesh denoising experiments.

cs.CV

Generalised envelope spectrum-based signal-to-noise objectives: Formulation, optimisation and application for gear fault detection under time-varying speed conditions

In vibration-based condition monitoring, optimal filter design improves fault detection by enhancing weak fault signatures within vibration signals. This process involves optimising a derived objective function from a defined objective. The objectives are often based on proxy health indicators to determine the filter's parameters. However, these indicators can be compromised by irrelevant extraneous signal components and fluctuating operational conditions, affecting the filter's efficacy. Fault detection primarily uses the fault component's prominence in the squared envelope spectrum, quantified by a squared envelope spectrum-based signal-to-noise ratio. New optimal filter objective functions are derived from the proposed generalised envelope spectrum-based signal-to-noise objective for machines operating under variable speed conditions. Instead of optimising proxy health indicators, the optimal filter coefficients of the formulation directly maximise the squared envelope spectrum-based signal-to-noise ratio over targeted frequency bands using standard gradient-based optimisers. Four derived objective functions from the proposed objective effectively outperform five prominent methods in tests on three experimental datasets.

eess.SP

Medical Image Registration using optimal control of a linear hyperbolic transport equation with a DG discretization

Patient specific brain mesh generation from MRI can be a time consuming task and require manual corrections, e.g., for meshing the ventricular system or defining subdomains. To address this issue, we consider an image registration approach. The idea is to use the registration of an input magnetic resonance image (MRI) to a respective target in order to obtain a new mesh from a template mesh. To obtain the transformation, we solve an optimization problem that is constrained by a linear hyperbolic transport equation. We use a higher-order discontinuous Galerkin finite element method for discretization and motivate the numerical upwind scheme and its limitations from the continuous weak space--time formulation of the transport equation. We present a numerical implementation that builds on the finite element packages FEniCS and dolfin-adjoint. To demonstrate the efficacy of the proposed approach, numerical results for the registration of an input to a target MRI of two distinct individuals are presented. Moreover, it is shown that the registration transforms a manually crafted input mesh into a new mesh for the target subject whilst preserving mesh quality. Challenges of the algorithm are discussed.

math.NA

Mesh Denoising and Inpainting using the Total Variation of the Normal and a Shape Newton Approach

We present a novel approach to denoising and inpainting problems for surface meshes. The purpose of these problems is to remove noise or fill in missing parts while preserving important features such as sharp edges. A discrete variant of the total variation of the unit normal vector field serves as a regularizing functional to achieve these goals. In order to solve the resulting problem, we use a version of the split Bregman (ADMM) iteration adapted to the problem. A new formulation of the total variation regularizer, as well as the use of an inexact Newton method for the shape optimization step, bring significant speed-up compared to earlier methods. Numerical examples are included, demonstrating the performance of our algorithm with some complex 3D geometries.

math.NA

A spectral regularisation framework for latent variable models designed for single channel applications

Latent variable models (LVMs) are commonly used to capture the underlying dependencies, patterns, and hidden structure in observed data. Source duplication is a by-product of the data hankelisation pre-processing step common to single channel LVM applications, which hinders practical LVM utilisation. In this article, a Python package titled spectrally-regularised-LVMs is presented. The proposed package addresses the source duplication issue via the addition of a novel spectral regularisation term. This package provides a framework for spectral regularisation in single channel LVM applications, thereby making it easier to investigate and utilise LVMs with spectral regularisation. This is achieved via the use of symbolic or explicit representations of potential LVM objective functions which are incorporated into a framework that uses spectral regularisation during the LVM parameter estimation process. The objective of this package is to provide a consistent linear LVM optimisation framework which incorporates spectral regularisation and caters to single channel time-series applications.

stat.ML

The Proximal Map of the Weighted Mean Absolute Error

We investigate the proximal map for the weighted mean absolute error function. An algorithm for its efficient and vectorized evaluation is presented. As a demonstration, this algorithm is applied as part of a checkerboard algorithm to solve a total-variation image denoising (ROF) problem as well as a non-smooth energy minimization problem.

math.OC

Total Generalized Variation for Piecewise Constant Functions on Triangular Meshes with Applications in Imaging

We propose a novel discrete concept for the total generalized variation (TGV), which has originally been derived to reduce the staircasing effect in classical total variation (TV) regularization, in image denoising problems. We describe discrete, second-order TGV for piecewise constant functions on triangular meshes, thus allowing the TGV functional to be applied to more general data structures than pixel images, and in particular in the context of finite element discretizations. Particular attention is given to the description of the kernel of the TGV functional, which, in the continuous setting, consists of linear polynomials. We discuss how to take advantage of this kernel structure using piecewise constant functions on triangular meshes. Numerical experiments include denoising and inpainting problems for images defined on non-standard grids, including data from a 3D scanner.

math.NA

Combining Sobolev Smoothing with Parameterized Shape Optimization

On the one hand, Sobolev gradient smoothing can considerably improve the performance of aerodynamic shape optimization and prevent issues with regularity. On the other hand, Sobolev smoothing can also be interpreted as an approximation for the shape Hessian. This paper demonstrates, how Sobolev smoothing, interpreted as a shape Hessian approximation, offers considerable benefits, although the parameterization is smooth in itself already. Such an approach is especially beneficial in the context of simultaneous analysis and design, where we deal with inexact flow and adjoint solutions, also called One Shot optimization. Furthermore, the incorporation of the parameterization allows for direct application to engineering test cases, where shapes are always described by a CAD model. The new methodology presented in this paper is used for reference test cases from aerodynamic shape optimization and performance improvements in comparison to a classical Quasi-Newton scheme are shown.

math.OC

A Linear View on Shape Optimization

Shapes do not define a linear space. This paper explores the linear structure of deformations as a representation of shapes. This transforms shape optimization to a variant of optimal control. The numerical challenges of this point of view are highlighted and a novel linear version of the second shape derivative is proposed leading to particular algorithms of shape Newton type.

math.OC

A Shape Newton Scheme for Deforming Shells with Application to Capillary Bridges

We present a second order numerical scheme to compute capillary bridges between arbitrary solids by minimizing the total energy of all interfaces. From a theoretical point of view, this approach can be interpreted as the computation of generalized minimal surfaces using a Newton-scheme utilizing the shape Hessian. In particular, we give an explicit representation of the shape Hessian for functionals on shells involving the normal vector without reverting back to a volume formulation or approximating curvature. From an algorithmic perspective, we combine a resolved interface via a triangulated surface for the liquid with a level set description for the constraints stemming from the arbitrary geometry. The actual shape of the capillary bridge is then computed via finite elements provided by the FEniCS environment, minimizing the shape derivative of the total interface energy.

math.NA

Total Variation of the Normal Vector Field as Shape Prior

An analogue of the total variation prior for the normal vector field along the boundary of smooth shapes in 3D is introduced. The analysis of the total variation of the normal vector field is based on a differential geometric setting in which the unit normal vector is viewed as an element of the two-dimensional sphere manifold. It is shown that spheres are stationary points when the total variation of the normal is minimized under an area constraint. Shape calculus is used to characterize the relevant derivatives. Since the total variation functional is non-differentiable whenever the boundary contains flat regions, an extension of the split Bregman method to manifold valued functions is proposed.

math.NA

Discrete Total Variation of the Normal Vector Field as Shape Prior with Applications in Geometric Inverse Problems

An analogue of the total variation prior for the normal vector field along the boundary of piecewise flat shapes in 3D is introduced. A major class of examples are triangulated surfaces as they occur for instance in finite element computations. The analysis of the functional is based on a differential geometric setting in which the unit normal vector is viewed as an element of the two-dimensional sphere manifold. It is found to agree with the discrete total mean curvature known in discrete differential geometry. A split Bregman iteration is proposed for the solution of discretized shape optimization problems, in which the total variation of the normal appears as a regularizer. Unlike most other priors, such as surface area, the new functional allows for piecewise flat shapes. As two applications, a mesh denoising and a geometric inverse problem of inclusion detection type involving a partial differential equation are considered. Numerical experiments confirm that polyhedral shapes can be identified quite accurately.

math.NA

Discrete Total Variation with Finite Elements and Applications to Imaging

The total variation (TV)-seminorm is considered for piecewise polynomial, globally discontinuous (DG) and continuous (CG) finite element functions on simplicial meshes. A novel, discrete variant (DTV) based on a nodal quadrature formula is defined. DTV has favorable properties, compared to the original TV-seminorm for finite element functions. These include a convenient dual representation in terms of the supremum over the space of Raviart--Thomas finite element functions, subject to a set of simple constraints. It can therefore be shown that a variety of algorithms for classical image reconstruction problems, including TV-$L^2$ and TV-$L^1$, can be implemented in low and higher-order finite element spaces with the same efficiency as their counterparts originally developed for images on Cartesian grids.

math.NA

An Approximate Newton Smoothing Method for Shape Optimization

A novel methodology to efficiently approximate the Hessian for numerical shape optimization is considered. The method enhances operator symbol approximations by including body fitted coordinates and spatially changing symbols in a semi automated framework based on local Fourier analysis. Contrary to classical operator symbol methods, the proposed strategy will identify areas in which a non-smooth design is physically meaningful and will automatically turn off smoothing in these regions. A new strategy to also numerically identify the analytic symbol is derived, extending the procedure to a wide variety of problems. The effectiveness is demonstrated by using drag minimization in Stokes and Navier-Stokes flows.

math.OC