FG Angewandte Mathematik
Refine
Year of publication
Document Type
Way of publication
- Open Access (9)
Keywords
- Laplace interpolation (4)
- Color image (3)
- Matrix field (3)
- partial differential equations (3)
- Inpainting (2)
- M-smoother (2)
- Median filter (2)
- Partial differential equations (2)
- Shape from Shading (2)
- Shape from shading (2)
- Trial solution (2)
- Variational methods (2)
- clustering (2)
- 3D printing (1)
- Acoustic source characterisation (1)
- Adam (1)
- Adaptive neural refinement (1)
- Additive manufacturing (1)
- Additive manufacturing Laser beam trajectory optimization Powder bed fusion printing Heat simulation Linear-quadratic control (1)
- Additive manufacturing Multiphase alloys Trajectory optimization Powder bed fusion printing Heat simulation Linear-quadratic control (1)
- Additive manufacturing Centroidal, Voronoi tessellation, Energy minimisation, Geometric optimisation, Eikonal equation, Fast marching (1)
- Albedo estimation (1)
- Ambiguity (1)
- Amoeba filter (1)
- Amoeba filter Matrix field (1)
- Amoebas (1)
- Backpropagation (1)
- Biharmonic (1)
- Cameras (1)
- Centroidal Voronoi tesselation (1)
- Chebyshev nodes (1)
- Clustering (1)
- Collocation neural forms (1)
- Color morphology (1)
- Compression (1)
- Computer vision (1)
- Configuration graph (1)
- Conservation laws (1)
- Convex optimisation (1)
- Cycle basis (1)
- Differential equations (1)
- Differentialgeometrie (1)
- Dilation (1)
- Dilation Erosion Matrix valued images Extremum principle (1)
- Domain decomposition (1)
- Domain fragmentation (1)
- Eikonal equation (1)
- Entropy solution (1)
- FCT scheme (1)
- Feature descriptor (1)
- Feedforward neural networks (1)
- Feedforward neural networks / Initial value problem / Trial solution /Differential equations (1)
- Finite difference methods (1)
- Finite difference schemes (1)
- Fourier transform (1)
- Geometric optimization (1)
- Gjerk-based feature (1)
- Hamilton-Jacobi skeletonization (1)
- Heat transmission (1)
- Homogeneous (1)
- Illumination estimation (1)
- Image compression (1)
- Implicit methods (1)
- Implicit shape representation Superquadrics Deep learning 3D shape description (1)
- Initial value problems (1)
- Joint reasoning (1)
- Krylov subspace methods (1)
- Krylov subspace model order reduction (1)
- Laplace equation (1)
- Laplace interpolation Helmholtz equation Image inpainting Finite difference scheme (1)
- Laplacian pyramids Vessel segmentation High-resolution fundus images Real-time retinal imaging (1)
- Laplnumerical methods (1)
- Leja ordering (1)
- Linear diffusion inpainting (1)
- Machine learning (1)
- Mathematical morphology (1)
- Mathematical morphology Fourier transform Fast algorithms (1)
- Mathematical morphology / Fast Fourier Transform / Dilation / Erosion / Efficient algorithms (1)
- Mathematical morphology Dilation Erosion Loewner order Leveling (1)
- Matrix differentiation (1)
- Matrix fields (1)
- Max-plus algebra (1)
- Median filter Convex hull stripping Partial differential equations Curve evolution (1)
- Microphone array (1)
- Mixed-integer linear programming (1)
- Monotone methods (1)
- Morphological dilation Morphological erosion Number theoretic transform (1)
- Neural forms (1)
- Newton interpolation (1)
- Non-convex minimisation (1)
- Non-flat morphology/ Sampling theorem/ Mathematical morphology / Opening / Closing (1)
- Nonsmooth minimization Line search method Goldstein quotient Compressed sensing Global convergence R-linear convergence (1)
- Optic flow (1)
- Optical flow Variational methods Warping Interpolation B-splines (1)
- Ordinary differential equations (1)
- PDE-based morphology (1)
- PS data (1)
- Partial differential equations Inpainting Laplace interpolation Optic flow Video reconstruction (1)
- Partial differential equations Laplace equation Mixed boundary conditions Image reconstruction Image inpainting (1)
- Perspective camera model (1)
- Photometric stereo (1)
- Photometric stereo Shape from shading Hayakawa procedure Lighting estimation Oren-Nayar model Lambertian reflector (1)
- Physics-informed neural networks (1)
- Poisson integration (1)
- Polynomial neural forms (1)
- Probabilistic tree-densification (1)
- Pseudo infimum (1)
- Pseudo supremum (1)
- Quantile (1)
- Quantisation (1)
- Rank-order filter (1)
- Reflection (1)
- Reflectivity (1)
- Scale spaces (1)
- Shape analysis (1)
- Shape from Shading Perspective projection Hamilton Jacobi equations Numerical methods Fast marching method (1)
- Shape matching Point descriptor Shape analysis Heat equation Schrödinger equation (1)
- Skeletonization (1)
- Slope transform (1)
- Source term (1)
- Sparse recovery (1)
- Specular reflections (1)
- Split Bregman (1)
- Statistical Shape Analysis; Shape Classification; Shape Similarity; Kolmogorov-Smirnov; Hypothesis Testing; Sampling Methods (1)
- Stereo reconstruction (1)
- Underwater digit recognition / Sequence models / Connectionist Temporal Classification (1)
- Video reconstruction (1)
- Wave equation (1)
- ace–Beltrami operator (1)
- additive manufacturing (1)
- amoebas (1)
- cognitive systems (1)
- colour image (1)
- complete Blinn–Phong model (1)
- compression (1)
- damped wave equation (1)
- deep learning (1)
- diffuse reflection (1)
- driving style analysis (1)
- efficient long-term evolution (1)
- energy efficiency (1)
- fast Leja points (1)
- fast explicit diffusion (1)
- fast marching methods (1)
- geothermal energy storage (1)
- heat equation (1)
- image inpainting (1)
- image reconstruction (1)
- inpainting (1)
- internal boundary conditions (1)
- interpolation nodes (1)
- jerk-based feature (1)
- matrix field (1)
- mixed boundary condition (1)
- morphological dilation, morphological erosion, fast Fourier transform (1)
- numerical methods (1)
- partial differential equation (1)
- perception (1)
- perspective projection (1)
- photometric stereo (PS) (1)
- polynomial interpolation (1)
- quantile (1)
- quantisation (1)
- rank-order filter (1)
- shape analysis (1)
- specular reflection (1)
- stiffness enhancement (1)
- surface normal integration (1)
- time discretisation (1)
- weighted Sobolev space (1)
Institute
- FG Angewandte Mathematik (87)
- FG Numerische Mathematik und Wissenschaftliches Rechnen (4)
- FG Hybride Fertigung (2)
- FG Ingenieurmathematik und Numerik der Optimierung (2)
- FG Praktische Informatik / Graphische Systeme (2)
- FG Diskrete Mathematik und Grundlagen der Informatik (1)
- Zentrale Analytik der BTU Cottbus-Senftenberg (ZA-BTU) / Zentrales Analytisches Labor (1)
In many realistic scenarios, the use of highly detailed photometric 3D reconstruction techniques is hindered by several challenges in given imagery. Especially, the light sources are often unknown and need to be estimated, and the light reflectance is often non-Lambertian. In addition, when approaching the problem to apply photometric techniques at real-world imagery, several parameters appear that need to be fixed in order to obtain high-quality reconstructions. In this chapter, we attempt to tackle these issues by combining photometric stereo with non-Lambertian preprocessing and Hayakawa lighting estimation. At hand of a dedicated study, we discuss the applicability of these techniques for their use in automated 3D geometry recovery for 3D printing.
In this paper we extensively explore the suitability of YOLO architectures to monitor the process flow across a Fischertechnik industry 4.0 application. Specifically, different YOLO architectures in terms of size and complexity design along with different prior-shapes assignment strategies are adopted. To simulate the real world factory environment, we prepared a rich dataset augmented with different distortions that highly enhance and in some cases degrade our image qualities. The degradation is performed to account for environmental variations and enhancements opt to compensate the color correlations that we face while preparing our dataset. The analysis of our conducted experiments shows the effectiveness of the presented approach evaluated using different measures along with the training and validation strategies that we tailored to tackle the unavoidable color correlations that the problem at hand inherits by nature.
A line search strategy is an iterative approach to finding a local minimizer of a nonlinear objective function. First, it finds a sensible direction and then an acceptable step size is computed that determines how far to move along that direction.
This paper introduces an efficient line search method for convex nonsmooth optimization problems. Like the Goldstein and Armijo conditions, the presented line search scheme uses only function values, apart from one gradient evaluation at each current iteration. For the novel line search method, we prove global convergence to a stationary point and R-linear convergence rate under some standard assumptions. Based on that, we propose an algorithm for the
-minimization problem we call the iterative Shrinkage-Goldstein algorithm (ISGA). In numerical results, we report experiments that demonstrate the competitive performance of the ISGA approach for compressed sensing problems in comparison with some state-of-the-art algorithms.
In many existing AI methods, the reasons behind the decisions made by a trained model are not easy to explain. This often leads to a black-box design that is not interpretable, which makes it a delicate issue to adopt such methods in an application related to safety. We consider generative adversarial networks that are often used to generate data for further use in deep learning applications where not much data is available. In particular, we deal with the StyleGAN approach for generating synthetic observations of swimmers. This paper provides a pipeline that can clearly explain the synthesized images after projecting them to a lower dimensional space. These understood images can later be chosen to train a swimmer safety observation framework. The main goal of our paper is to achieve a higher level of abstraction by which one can explain the variation of synthesized swimmer images in low dimension space. A standard similarity measure is used to evaluate our pipeline and validate a low intra-class variation of established swimmer clusters representing similar swimming style within a low dimensional space.
In laser powder bed fusion, it is known that the quality of printing results crucially depends on the temperature distribution and its gradient over the manufacturing plate. We propose a computational model for the motion of the laser beam and the simulation of the time-dependent heat evolution over the plate. For the optimization of the laser beam trajectory, we propose a cost function that minimizes the average thermal gradient and allows to steer the laser beam. The optimization is performed in an unsupervised way. Specifically, we propose an optimization heuristic that is inspired by the well-known traveling salesman problem and that employs simulated annealing to determine a nearly optimal pathway. By comparison of the heat transfer simulations of the derived trajectories with trajectory patterns from standard printing protocols we show that the method gives superior results in terms of the given cost functional.
n context of laser powder bed fusion (L-PBF), it is known that the properties of the final fabricated product highly depend on the temperature distribution and its gradient over the manufacturing plate. In this paper, we propose a novel means to predict the temperature gradient distributions during the printing process by making use of neural networks. This is realized by employing heat maps produced by an optimized printing protocol simulation and used for training a specifically tailored recurrent neural network in terms of a long short-term memory architecture. The aim of this is to avoid extreme and inhomogeneous temperature distribution that may occur across the plate in the course of the printing process. In order to train the neural network, we adopt a well-engineered simulation and unsupervised learning framework. To maintain a minimized average thermal gradient across the plate, a cost function is introduced as the core criteria, which is inspired and optimized by considering the well-known traveling salesman problem (TSP). As time evolves the unsupervised printing process governed by TSP produces a history of temperature heat maps that maintain minimized average thermal gradient. All in one, we propose an intelligent printing tool that provides control over the substantial printing process components for L-PBF, i.e. optimal nozzle trajectory deployment as well as online temperature prediction for controlling printing quality.
The decomposition of 3D shapes into simple yet representative components is a very intriguing topic in computer vision as it is very useful for many possible applications. Superquadrics may be used with benefit to obtain an implicit representation of the 3D shapes, as they allow to represent a wide range of possible forms by few parameters. However, in the computation of the shape representation, there is often an intricate trade-off between the variation of the represented geometric forms and the accuracy in such implicit approaches. In this paper, we propose an improved loss function, and we introduce beneficial computational techniques. By comparing results obtained by our new technique to the baseline method, we demonstrate that our results are more reliable and accurate, as well as much faster to obtain.
The basic filters in mathematical morphology are dilation and erosion. They are defined by a structuring element that is usually shifted pixel-wise over an image, together with a comparison process that takes place within the corresponding mask. This comparison is made in the grey value case by means of maximum or minimum formation. Hence, there is easy access to max-plus algebra and, by means of an algebra change, also to the theory of linear algebra. We show that an approximation of the maximum function forms a commutative semifield (with respect to multiplication) and corresponds to the maximum again in the limit case. In this way, we demonstrate a novel access to the logarithmic connection between the Fourier transform and the slope transformation. In addition, we prove that the dilation by means of a fast Fourier transform depends only on the size of the structuring element used. Moreover, we derive a bound above which the Fourier approximation yields results that are exact in terms of grey value quantisation.
Sampling is a basic operation in image processing. In classic literature, a morphological sampling theorem has been established, which shows how sampling interacts by morphological operations with image reconstruction. Many aspects of morphological sampling have been investigated for binary images, but only some of them have been explored for grey-value imagery. With this paper, we make a step towards completion of this open matter. By relying on the umbra notion, we show how to transfer classic theorems in binary morphology about the interaction of sampling with the fundamental morphological operations dilation, erosion, opening and closing, to the grey-value setting. In doing this we also extend the theory relating the morphological operations and corresponding reconstructions to use of non-flat structuring elements. We illustrate the theoretical developments at hand of examples.
A classic approach for solving differential equations with neural networks builds upon neural forms, which employ the differential equation with a discretisation of the solution domain. Making use of neural forms for time-dependent differential equations, one can apply the recently developed method of domain segmentation. That is, the domain may be split into several subdomains, on which the optimisation problem is solved.
In classic adaptive numerical methods, the mesh as well as the domain may be refined or decomposed, in order to improve the accuracy. Also, the degree of approximation accuracy may be adapted. Therefore, it is desirable to transfer such important and successful strategies to the field of neural-network-based solutions. In the presented work, we propose a novel adaptive neural approach to meet this aim for solving time-dependent problems.
To this end, each subdomain is reduced in size until the optimisation is resolved up to a predefined training accuracy. In addition, while the neural networks employed are by default small, we propose a means to adjust also the number of neurons in an adaptive way. We introduce conditions to automatically confirm the solution reliability and optimise computational parameters whenever it is necessary. Results are provided for several initial-value problems that illustrate important computational properties of the method.