SearcharxivSearch

arXiv subjects

Georg Muntingh

Publications and source records attributed to Georg Muntingh.

At least 19 recordsLinked to original sources

Decoupling Composition and Band Gap in $κ$-Ga$_2$O$_3$ Heterostructures via STEM-EELS

High-resolution mapping of electronic properties at oxide heterointerfaces remains challenging due to probe delocalization and overlapping signals. In this work, we employ monochromated, probe-corrected scanning transmission electron microscopy combined with electron energy-loss spectroscopy (STEM-EELS) to resolve band gap variations across $κ$-Ga$_2$O$_3$-based multilayers with nanometer-scale precision. A custom automated quantitative-based EELS analysis framework enabled automated band gap fitting and visualization, ensuring reproducibility and high spatial resolution. By optimizing acquisition parameters and quantifying inelastic delocalization, we demonstrate reliable extraction of band gap excitations from layers only a few nanometers thick. For heterostructures grown on ITO templates, strain at defect-free interfaces induces a gradual band gap transition from $5.08~\mathrm{eV}$ to $4.28~\mathrm{eV}$ over $\sim 10~\mathrm{nm}$, despite an abrupt compositional change. In contrast, ZnO-based templates introduce structural defects that relieve strain, yielding band gaps consistent with composition. These results establish STEM-EELS as a powerful tool for nanoscale electronic characterization and highlight the dominant role of interfacial strain over composition in governing local band structure.

cond-mat.mtrl-sci

On the injectivity of mean value mappings between quadrilaterals

Mean value coordinates can be used to map one polygon into another, with application to computer graphics and curve and surface modelling. In this paper we show that if the polygons are quadrilaterals, and if the target quadrilateral is convex, then the mapping is injective.

math.NA

Affine equivalences of surfaces of translation and minimal surfaces, and applications to symmetry detection and design

We introduce a characterization for affine equivalence of two surfaces of translation defined by either rational or meromorphic generators. In turn, this induces a similar characterization for minimal surfaces. In the rational case, our results provide algorithms for detecting affine equivalence of these surfaces, and therefore, in particular, the symmetries of a surface of translation or a minimal surface of the considered types. Additionally, we apply our results to designing surfaces of translation and minimal surfaces with symmetries, and to computing the symmetries of the higher-order Enneper surfaces.

math.AG

Binary segmentation of medical images using implicit spline representations and deep learning

We propose a novel approach to image segmentation based on combining implicit spline representations with deep convolutional neural networks. This is done by predicting the control points of a bivariate spline function whose zero-set represents the segmentation boundary. We adapt several existing neural network architectures and design novel loss functions that are tailored towards providing implicit spline curve approximations. The method is evaluated on a congenital heart disease computed tomography medical imaging dataset. Experiments are carried out by measuring performance in various standard metrics for different networks and loss functions. We determine that splines of bidegree $(1,1)$ with $128\times128$ coefficient resolution performed optimally for $512\times 512$ resolution CT images. For our best network, we achieve an average volumetric test Dice score of almost 92%, which reaches the state of the art for this congenital heart disease dataset.

eess.IV

Reverse engineering of CAD models via clustering and approximate implicitization

In applications like computer aided design, geometric models are often represented numerically as polynomial splines or NURBS, even when they originate from primitive geometry. For purposes such as redesign and isogeometric analysis, it is of interest to extract information about the underlying geometry through reverse engineering. In this work we develop a novel method to determine these primitive shapes by combining clustering analysis with approximate implicitization. The proposed method is automatic and can recover algebraic hypersurfaces of any degree in any dimension. In exact arithmetic, the algorithm returns exact results. All the required parameters, such as the implicit degree of the patches and the number of clusters of the model, are inferred using numerical approaches in order to obtain an algorithm that requires as little manual input as possible. The effectiveness, efficiency and robustness of the method are shown both in a theoretical analysis and in numerical examples implemented in Python.

math.NA

Real-time processing of high-resolution video and 3D model-based tracking for remote towers

High quality video data is a core component in emerging remote tower operations as it inherently contains a huge amount of information on which an air traffic controller can base decisions. Various digital technologies also have the potential to exploit this data to bring enhancements, including tracking ground movements by relating events in the video view to their positions in 3D space. The total resolution of remote tower setups with multiple cameras often exceeds 25 million RGB pixels and is captured at 30 frames per second or more. It is thus a challenge to efficiently process all the data in such a way as to provide relevant real-time enhancements to the controller. In this paper we discuss how a number of improvements can be implemented efficiently on a single workstation by decoupling processes and utilizing hardware for parallel computing. We also highlight how decoupling the processes in this way increases resilience of the software solution in the sense that failure of a single component does not impair the function of the other components.

cs.CV

B-spline-like bases for $C^2$ cubics on the Powell-Sabin 12-split

For spaces of constant, linear, and quadratic splines of maximal smoothness on the Powell-Sabin 12-split of a triangle, the so-called S-bases were recently introduced. These are simplex spline bases with B-spline-like properties on the 12-split of a single triangle, which are tied together across triangles in a Bézier-like manner. In this paper we give a formal definition of an S-basis in terms of certain basic properties. We proceed to investigate the existence of S-bases for the aforementioned spaces and additionally the cubic case, resulting in an exhaustive list. From their nature as simplex splines, we derive simple differentiation and recurrence formulas to other S-bases. We establish a Marsden identity that gives rise to various quasi-interpolants and domain points forming an intuitive control net, in terms of which conditions for $C^0$-, $C^1$-, and $C^2$-smoothness are derived.

math.NA

Void Filling of Digital Elevation Models with Deep Generative Models

In recent years, advances in machine learning algorithms, cheap computational resources, and the availability of big data have spurred the deep learning revolution in various application domains. In particular, supervised learning techniques in image analysis have led to superhuman performance in various tasks, such as classification, localization, and segmentation, while unsupervised learning techniques based on increasingly advanced generative models have been applied to generate high-resolution synthetic images indistinguishable from real images. In this paper we consider a state-of-the-art machine learning model for image inpainting, namely a Wasserstein Generative Adversarial Network based on a fully convolutional architecture with a contextual attention mechanism. We show that this model can successfully be transferred to the setting of digital elevation models (DEMs) for the purpose of generating semantically plausible data for filling voids. Training, testing and experimentation is done on GeoTIFF data from various regions in Norway, made openly available by the Norwegian Mapping Authority.

cs.LG

Symmetries of Canal Surfaces and Dupin Cyclides

We develop a characterization for the existence of symmetries of canal surfaces defined by a rational spine curve and rational radius function. In turn, this characterization inspires an algorithm for computing the symmetries of such canal surfaces. For Dupin cyclides in canonical form, we apply the characterization to derive an intrinsic description of their symmetries and symmetry groups, which gives rise to a method for computing the symmetries of a Dupin cyclide not necessarily in canonical form. As a final application, we discuss the construction of patches and blends of rational canal surfaces with a prescribed symmetry.

math.AG

Similarity detection of rational space curves

We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra setting. Helical curves, where curvature and torsion are proportional, need to be distinguished as a special case. The algorithm is easy to implement, as it involves only standard computer algebra techniques, such as greatest common divisors and resultants, and Gröbner basis for the special case of helical curves. Details on the implementation and experimentation carried out using the computer algebra system Maple 18 are provided.

math.AG

Symbols and exact regularity of symmetric pseudo-splines of any arity

Pseudo-splines form a family of subdivision schemes that provide a natural blend between interpolating schemes and approximating schemes, including the Dubuc-Deslauriers schemes and B-spline schemes. Using a generating function approach, we derive expressions for the symbols of the symmetric $m$-ary pseudo-spline subdivision schemes. We show that their masks have positive Fourier transform, making it possible to compute the exact Hölder regularity algebraically as a logarithm of the spectral radius of a matrix. We apply this method to compute the regularity explicitly in some special cases, including the symmetric binary, ternary, and quarternary pseudo-spline schemes.

math.NA

Stable simplex spline bases for $C^3$ quintics on the Powell-Sabin 12-split

For the space of $C^3$ quintics on the Powell-Sabin 12-split of a triangle, we determine explicitly the six symmetric simplex spline bases that reduce to a B-spline basis on each edge, have a positive partition of unity, a Marsden identity that splits into real linear factors, and an intuitive domain mesh. The bases are stable in the $L_\infty$ norm with a condition number independent of the geometry, have a well-conditioned Lagrange interpolant at the domain points, and a quasi-interpolant with local approximation order 6. We show an $h^2$ bound for the distance between the control points and the values of a spline at the corresponding domain points. For one of these bases we derive $C^0$, $C^1$, $C^2$ and $C^3$ conditions on the control points of two splines on adjacent macrotriangles.

math.NA

Implicit Divided Differences, Little Schröder Numbers, and Catalan Numbers

Under general conditions, the equation $g(x,y) = 0$ implicitly defines $y$ locally as a function of $x$. In this short note we study the combinatorial structure underlying a recently discovered formula for the divided differences of $y$ expressed in terms of bivariate divided differences of $g$, by analyzing the number of terms $a_n$ in this formula. The main result describes six equivalent characterizations of the sequence $\{a_n\}$.

math.CO

Symmetry Detection of Rational Space Curves from their Curvature and Torsion

We present a novel, deterministic, and efficient method to detect whether a given rational space curve is symmetric. By using well-known differential invariants of space curves, namely the curvature and torsion, the method is significantly faster, simpler, and more general than an earlier method addressing a similar problem. To support this claim, we present an analysis of the arithmetic complexity of the algorithm and timings from an implementation in Sage.

math.AG

A Hermite interpolatory subdivision scheme for $C^2$-quintics on the Powell-Sabin 12-split

In order to construct a $C^1$-quadratic spline over an arbitrary triangulation, one can split each triangle into 12 subtriangles, resulting in a finer triangulation known as the Powell-Sabin 12-split. It has been shown previously that the corresponding spline surface can be plotted quickly by means of a Hermite subdivision scheme. In this paper we introduce a nodal macro-element on the 12-split for the space of quintic splines that are locally $C^3$ and globally $C^2$. For quickly evaluating any such spline, a Hermite subdivision scheme is derived, implemented, and tested in the computer algebra system Sage. Using the available first derivatives for Phong shading, visually appealing plots can be generated after just a couple of refinements.

math.NA

Detecting Similarity of Rational Plane Curves

A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and the particular case of equal curves yields all symmetries. A complete theoretical description of the method is provided, and the method has been implemented and tested in the Sage system for curves of moderate degrees.

math.AG

A Chi Distribution Model of Hail Storm Damage

This paper addresses the pattern of damage, and investigates its properties, of a theoretical hail storm which gathers in intensity before subsiding, and which travels linearly across the landscape at constant velocity. We start by assuming a simpler model, that of a storm which does not move, restricted to having an uncorrelated binormal distribution of damage. This model, expressed in the natural polar coordinates, leads to a 1-dimensional pattern of damage as a function of the marginal radial distance conforming to the $χ$-distribution with two degrees of freedom. The model is then extended to the traveling form, allowing further for a correlation of the variables, extending, as well, to the multidimensional case. In its full florescence the model produces hyperellipsoidal hypersurfaces of equal intensity for the correlated multinormal assumption. We provide closed-form solutions for the totality of damages upon these hypersurfaces as proxies for the insurance claims to follow. Finally the model is applied to extensive datasets of hail events, as detected by the NEXRAD network of weather radars.

math.PR