Related papers: Laplacian smoothing revisited
In this paper we study the statistical properties of Laplacian smoothing, a graph-based approach to nonparametric regression. Under standard regularity conditions, we establish upper bounds on the error of the Laplacian smoothing estimator…
We present a computational scheme that derives a global polynomial level set parametrisation for smooth closed surfaces from a regular surface-point set and prove its uniqueness. This enables us to approximate a broad class of smooth…
We investigate the logarithmic and power-type convexity of the length of the level curves for $a$-harmonic functions on smooth surfaces and related isoperimetric inequalities. In particular, our analysis covers the $p$-harmonic and the…
Machine learning frameworks based on correlations of interatomic positions begin with a discretized description of the density of other atoms in the neighbourhood of each atom in the system. Symmetry considerations support the use of…
There is growing body of learning problems for which it is natural to organize the parameters into matrix, so as to appropriately regularize the parameters under some matrix norm (in order to impose some more sophisticated prior knowledge).…
Macroscopic friction coefficients observed in experiments are the result of various types of complex multiscale interactions between sliding surfaces. Therefore, there are several ways to modify them depending on the physical phenomena…
Regularization is used in many different areas of optimization when solutions are sought which not only minimize a given function, but also possess a certain degree of regularity. Popular applications are image denoising, sparse regression…
Numerical experiments with smooth surface extension and image inpainting using harmonic and biharmonic functions are carried out. The boundary data used for constructing biharmonic functions are the values of the Laplacian and normal…
We introduce a commutator method with multipliers to prove averaging lemmas, the regularizing effect for the velocity average of solutions for kinetic equations. This method requires only elementary techniques in Fourier analysis and shows…
Geometric deep learning has sparked a rising interest in computer graphics to perform shape understanding tasks, such as shape classification and semantic segmentation. When the input is a polygonal surface, one has to suffer from the…
Many natural shapes have most of their characterizing features concentrated over a few regions in space. For example, humans and animals have distinctive head shapes, while inorganic objects like chairs and airplanes are made of…
This is an elementary introduction to a method for studying harmonic maps into symmetric spaces, and in particular for studying constant mean curvature (CMC) surfaces, that was developed by J. Dorfmeister, F. Pedit and H. Wu. There already…
We consider a "convolution mm-Laplacian" operator on metric-measure spaces and study its spectral properties. The definition is based on averaging over small metric balls. For reasonably nice metric-measure spaces we prove stability of…
We develop a method for optimization in shape spaces, i.e., sets of surfaces modulo re-parametrization. Unlike previously proposed gradient flows, we achieve superlinear convergence rates through a subtle approximation of the shape Hessian,…
The typical goal of surface remeshing consists in finding a mesh that is (1) geometrically faithful to the original geometry, (2) as coarse as possible to obtain a low-complexity representation and (3) free of bad elements that would hamper…
In this paper we consider finite element approaches to computing the mean curvature vector and normal at the vertices of piecewise linear triangulated surfaces. In particular, we adopt a stabilization technique which allows for first order…
We give a relationship that yields an effective geometric way of evaluating mean curvature of surfaces. The approach is reminiscent of the Gauss's contour based evaluation of intrinsic curvature. The presented formula may have a number of…
We investigate regularizations of distributional sections of vector bundles by means of nets of smooth sections that preserve the main regularity properties of the original distributions (singular support, wavefront set, Sobolev…
We construct a surface that is obtained from the octahedron by pushing out 4 of the faces so that the curvature is supported in a copy of the Sierpinski gasket in each of them, and is essentially the self similar measure on SG. We then…
This paper presents a simple yet effective method for feature-preserving surface smoothing. Through analyzing the differential property of surfaces, we show that the conventional discrete Laplacian operator with uniform weights is not…