The Beltrami flow is an effective tool for smoothing images in many computer vision tasks. However, a deep problem that is how to set the right embedding space is not solved in the Beltrami framework. In this paper, we attempt to find a suitable embedding space by a nonlinear map. First, the image space is mapped into a high-dimensional feature space whose dimension may be infinite. Then the Be...

In this paper we first modify a widely used discrete Laplace Beltrami operator proposed by Meyer et al over triangular surfaces, and then establish some convergence results for the modified discrete Laplace Beltrami operator over the triangulated spheres. A sequence of spherical triangulations which is optimal in certain sense and leads to smaller truncation error of the discrete Laplace Beltra...

The convergence property of the discrete Laplace–Beltrami operators is the foundation of convergence analysis of the numerical simulation process of some geometric partial differential equations which involve the operator. In this paper we propose several simple discretization schemes of Laplace–Beltrami operators over triangulated surfaces. Convergence results for these discrete Laplace–Beltra...

Surface parameterizations and registrations are important in computer graphics and imaging, where 1-1 correspondences between meshes are computed. In practice, surface maps are usually represented and stored as three-dimensional coordinates each vertex is mapped to, which often requires lots of memory. This causes inconvenience in data transmission and data storage. To tackle this problem, we p...

Discrete Laplace–Beltrami operators on polyhedral surfaces play an important role for various applications in geometry processing and related areas like physical simulation or computer graphics. While discretizations of the weak Laplace–Beltrami operator are well-studied, less is known about the strong form. We present a principle for constructing strongly consistent discrete Laplace–Beltrami o...

Surface parameterizations and registrations are important in computer graphics and imaging, where 1-1 correspondences between meshes are computed. In practice, surface maps are usually represented and stored as 3D coordinates each vertex is mapped to, which often requires lots of storage memory. This causes inconvenience in data transmission and data storage. To tackle this problem, we propose ...

In Schramm & Kayser (1995) we introduced the complex Beltrami Equation as an appropriate framework for the analysis of arclets in cluster lensing. Corresponding real formalisms have been developed by Kaiser and Schneider & Seitz (this volume, compare also the references in Schramm & Kayser 1995). Here, we show how the solutions of the Beltrami differential equation can be used to identify multi...

Beltrami states for compressible barotropic flows are deduced by minimizing the total kinetic energy while keeping the total helicity constant. A Hamiltonian basis for these Beltrami states is also sketched.

We provide estimates for the Hölder exponent of solutions to the Beltrami equation ∂f = μ∂f + ν∂f , where the Beltrami coefficients μ, ν satisfy ‖|μ|+ |ν|‖∞ < 1 and =(ν) = 0. Our estimates depend on the arguments of the Beltrami coefficients as well as on their moduli. Furthermore, we exhibit a class of mappings of the “angular stretching” type, on which our estimates are actually attained.