Wolfgang Erb
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wolfgang Erb has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Ludovico Bruni Bruno
Dipartimento di Scienze Matematiche “Giuseppe Luigi Lagrange”, Politecnico di Torino, Torino, Italia
8 shared publications - Federico Nudo
Department of Mathematics and Computer Science, University of Calabria, Rende, Italy
3 shared publications - Francesco Dell’aCcio
Department of Mathematics and Computer Science, University of Calabria, Rende, Italy
3 shared publications - Francesco Marchetti
Department of Mathematics "Tullio Levi-Civita" University of Padova Padova Italy
3 shared publications - Peter Dencker
Institut für Mathematik Universität zu Lübeck
3 shared publications - Thorsten M. Buzug
Fraunhofer IMTE, Fraunhofer Research Institution for Individualized Medical Technology and Engineering, Lübeck, Germany
3 shared publications
Latest Publications
- 4 November 2026
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- p. 1-26
L p -Convergence of Kantorovich-Type Max-Min Neural Network Operators
- 4 November 2026
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- p. 1-26
L p -Convergence of Kantorovich-Type Max-Min Neural Network Operators
- 21 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (4) , 2282-2305
Multivariate Max-Min Sampling Operators in Mathematical Morphology
We build a conceptual bridge between mathematical morphology and max-min sampling operators, offering new insights into the convergence behavior of discrete morphological transformations on multivariate grids as the spatial resolution of the data increases. To this end, we introduce and analyze nonlinear sampling operators rooted in the arithmetic operations of the max-min algebra. These new sampling operators can be interpreted as approximate morphological operations relying on the function values on the sampling grid and a specific kernel. We investigate the convergence behavior of these operators, alongside with the respective properties of their morphological operations as dilation, erosion, opening, and closing. In the two-dimensional setting, we show how these morphological sampling operators can be effectively applied to various image processing tasks, as upscaling, denoising, or segmentation.
- 21 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (4) , 2282-2305
Multivariate Max-Min Sampling Operators in Mathematical Morphology
We build a conceptual bridge between mathematical morphology and max-min sampling operators, offering new insights into the convergence behavior of discrete morphological transformations on multivariate grids as the spatial resolution of the data increases. To this end, we introduce and analyze nonlinear sampling operators rooted in the arithmetic operations of the max-min algebra. These new sampling operators can be interpreted as approximate morphological operations relying on the function values on the sampling grid and a specific kernel. We investigate the convergence behavior of these operators, alongside with the respective properties of their morphological operations as dilation, erosion, opening, and closing. In the two-dimensional setting, we show how these morphological sampling operators can be effectively applied to various image processing tasks, as upscaling, denoising, or segmentation.
- Open Access
Scattered Data Histopolation in Averaging Kernel Hilbert Spaces
Kernel-based methods offer a powerful and flexible mathematical framework for addressing histopolation problems. In histopolation, the available input data does not consist of pointwise function samples but of averages taken over intervals or higher-dimensional regions, and these mean values serve as a basis for reconstructing or approximating the target function. While classical interpolation requires continuity of the underlying function, histopolation can be performed in larger function spaces. In the framework of kernel methods, we will introduce and study the so-called averaging kernel Hilbert spaces (AKHS's) for this purpose. Within this setting, we develop systematic construction principles for averaging kernels and provide characterizations based on the Fourier-Plancherel transform. In addition, we analyze several representative histopolation scenarios in order to highlight properties of this approximation method, including conditions for unisolvence and possible error estimates. Finally, we present numerical experiments that shed some light on the convergence behavior of the presented approach and demonstrate its practical effectiveness.
Open AccessScattered Data Histopolation in Averaging Kernel Hilbert Spaces
Kernel-based methods offer a powerful and flexible mathematical framework for addressing histopolation problems. In histopolation, the available input data does not consist of pointwise function samples but of averages taken over intervals or higher-dimensional regions, and these mean values serve as a basis for reconstructing or approximating the target function. While classical interpolation requires continuity of the underlying function, histopolation can be performed in larger function spaces. In the framework of kernel methods, we will introduce and study the so-called averaging kernel Hilbert spaces (AKHS's) for this purpose. Within this setting, we develop systematic construction principles for averaging kernels and provide characterizations based on the Fourier-Plancherel transform. In addition, we analyze several representative histopolation scenarios in order to highlight properties of this approximation method, including conditions for unisolvence and possible error estimates. Finally, we present numerical experiments that shed some light on the convergence behavior of the presented approach and demonstrate its practical effectiveness.
- 3 July 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 104 (2) , 1-23
Polynomial Histopolation On Mock-Chebyshev Segments
- 3 July 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 104 (2) , 1-23
Polynomial Histopolation On Mock-Chebyshev Segments
- 28 June 2025
- Published by Springer Nature
- p. 252-263
Split-and-Merge Segmentation of Biomedical Images Using Graph Wedgelet Decompositions
- 28 June 2025
- Published by Springer Nature
- p. 252-263
Split-and-Merge Segmentation of Biomedical Images Using Graph Wedgelet Decompositions
- Open Access
Bivariate polynomial histopolation techniques on Padua, Fekete and Leja triangles
This paper explores the reconstruction of a real-valued function $f$ defined over a domain $Ω\subset \mathbb{R}^2$ using bivariate polynomials that satisfy triangular histopolation conditions. More precisely, we assume that only the averages of $f$ over a given triangulation $\mathcal{T}_N$ of $Ω$ are available and seek a bivariate polynomial that approximates $f$ using a histopolation approach, potentially flanked by an additional regression technique. This methodology relies on the selection of a subset of triangles $\mathcal{T}_M \subset \mathcal{T}_N$ for histopolation, ensuring both the solvability and the well-conditioning of the problem. The remaining triangles can potentially be used to enhance the accuracy of the polynomial approximation through a simultaneous regression. We will introduce histopolation and combined histopolation-regression methods using the Padua points, discrete Leja sequences, and approximate Fekete nodes. The proposed algorithms are implemented and evaluated through numerical experiments that demonstrate their effectiveness in function approximation.Open AccessBivariate polynomial histopolation techniques on Padua, Fekete and Leja triangles
This paper explores the reconstruction of a real-valued function $f$ defined over a domain $Ω\subset \mathbb{R}^2$ using bivariate polynomials that satisfy triangular histopolation conditions. More precisely, we assume that only the averages of $f$ over a given triangulation $\mathcal{T}_N$ of $Ω$ are available and seek a bivariate polynomial that approximates $f$ using a histopolation approach, potentially flanked by an additional regression technique. This methodology relies on the selection of a subset of triangles $\mathcal{T}_M \subset \mathcal{T}_N$ for histopolation, ensuring both the solvability and the well-conditioning of the problem. The remaining triangles can potentially be used to enhance the accuracy of the polynomial approximation through a simultaneous regression. We will introduce histopolation and combined histopolation-regression methods using the Padua points, discrete Leja sequences, and approximate Fekete nodes. The proposed algorithms are implemented and evaluated through numerical experiments that demonstrate their effectiveness in function approximation. - 18 December 2024
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (1) , 1-27
The Fekete problem in segmental polynomial interpolation
- 18 December 2024
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (1) , 1-27
The Fekete problem in segmental polynomial interpolation
- 25 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 62 (4) , 1759-1781
Polynomial Interpolation of Function Averages on Interval Segments
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise to new theoretical and practical aspects that distinguish this problem considerably from classical nodal interpolation. We will analyze fundamental mathematical properties of this problem as existence, uniqueness, and numerical conditioning of its solution. In a few selected scenarios, we will provide concrete conditions for unisolvence and explicit Lagrange-type basis systems for its representation. To study the numerical conditioning, we will provide respective concrete bounds for the Lebesgue constant.
- 25 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 62 (4) , 1759-1781
Polynomial Interpolation of Function Averages on Interval Segments
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise to new theoretical and practical aspects that distinguish this problem considerably from classical nodal interpolation. We will analyze fundamental mathematical properties of this problem as existence, uniqueness, and numerical conditioning of its solution. In a few selected scenarios, we will provide concrete conditions for unisolvence and explicit Lagrange-type basis systems for its representation. To study the numerical conditioning, we will provide respective concrete bounds for the Lebesgue constant.
- Open Access
Polynomial histopolation on mock-Chebyshev segments
In computational practice, we often encounter situations where only measurements at equally spaced points are available. Using standard polynomial interpolation in such cases can lead to highly inaccurate results due to numerical ill-conditioning of the problem. Several techniques have been developed to mitigate this issue, such as the mock-Chebyshev subset interpolation and the constrained mock-Chebyshev least-squares approximation. The high accuracy and the numerical stability achieved by these techniques motivate us to extend these methods to histopolation, a polynomial interpolation method based on segmental function averages. While classical polynomial interpolation relies on function evaluations at specific nodes, histopolation leverages averages of the function over subintervals. In this work, we introduce three types of mock-Chebyshev approaches for segmental interpolation and theoretically analyse the stability of their Lebesgue constants, which measure the numerical conditioning of the histopolation problem under small perturbations of the segments. We demonstrate that these segmental mock-Chebyshev approaches yield a quasi-optimal logarithmic growth of the Lebesgue constant in relevant scenarios. Additionally, we compare the performance of these new approximation techniques through various numerical experiments.
Open AccessPolynomial histopolation on mock-Chebyshev segments
In computational practice, we often encounter situations where only measurements at equally spaced points are available. Using standard polynomial interpolation in such cases can lead to highly inaccurate results due to numerical ill-conditioning of the problem. Several techniques have been developed to mitigate this issue, such as the mock-Chebyshev subset interpolation and the constrained mock-Chebyshev least-squares approximation. The high accuracy and the numerical stability achieved by these techniques motivate us to extend these methods to histopolation, a polynomial interpolation method based on segmental function averages. While classical polynomial interpolation relies on function evaluations at specific nodes, histopolation leverages averages of the function over subintervals. In this work, we introduce three types of mock-Chebyshev approaches for segmental interpolation and theoretically analyse the stability of their Lebesgue constants, which measure the numerical conditioning of the histopolation problem under small perturbations of the segments. We demonstrate that these segmental mock-Chebyshev approaches yield a quasi-optimal logarithmic growth of the Lebesgue constant in relevant scenarios. Additionally, we compare the performance of these new approximation techniques through various numerical experiments.
- 15 March 2024
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 64 (2) , 1-32
Highly localized RBF Lagrange functions for finite difference methods on spheres
- 15 March 2024
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 64 (2) , 1-32
Highly localized RBF Lagrange functions for finite difference methods on spheres