Javascript must be enabled to continue!
Complex Transfinite Barycentric Mappings with Similarity Kernels
View through CrossRef
AbstractTransfinite barycentric kernels are the continuous version of traditional barycentric coordinates and are used to define interpolants of values given on a smooth planar contour. When the data is two‐dimensional, i.e. the boundary of a planar map, these kernels may be conveniently expressed using complex number algebra, simplifying much of the notation and results. In this paper we develop some of the basic complex‐valued algebra needed to describe these planar maps, and use it to define similarity kernels, a natural alternative to the usual barycentric kernels.We develop the theory behind similarity kernels, explore their properties, and show that the transfinite versions of the popular three‐point barycentric coordinates (Laplace, mean value and Wachspress) have surprisingly simple similarity kernels.We furthermore show how similarity kernels may be used to invert injective transfinite barycentric mappings using an iterative algorithm which converges quite rapidly. This is useful for rendering images deformed by planar barycentric mappings.
Title: Complex Transfinite Barycentric Mappings with Similarity Kernels
Description:
AbstractTransfinite barycentric kernels are the continuous version of traditional barycentric coordinates and are used to define interpolants of values given on a smooth planar contour.
When the data is two‐dimensional, i.
e.
the boundary of a planar map, these kernels may be conveniently expressed using complex number algebra, simplifying much of the notation and results.
In this paper we develop some of the basic complex‐valued algebra needed to describe these planar maps, and use it to define similarity kernels, a natural alternative to the usual barycentric kernels.
We develop the theory behind similarity kernels, explore their properties, and show that the transfinite versions of the popular three‐point barycentric coordinates (Laplace, mean value and Wachspress) have surprisingly simple similarity kernels.
We furthermore show how similarity kernels may be used to invert injective transfinite barycentric mappings using an iterative algorithm which converges quite rapidly.
This is useful for rendering images deformed by planar barycentric mappings.
Related Results
Spectral-Similarity-Based Kernel of SVM for Hyperspectral Image Classification
Spectral-Similarity-Based Kernel of SVM for Hyperspectral Image Classification
Spectral similarity measures can be regarded as potential metrics for kernel functions, and can be used to generate spectral-similarity-based kernels. However, spectral-similarity-...
Transfinite Fixed-Point Games and the Resolution of Open Problems in Alpay Algebra
Transfinite Fixed-Point Games and the Resolution of Open Problems in Alpay Algebra
In "Transfinite Fixed-Point Games and the Resolution of Open Problems in Alpay Algebra," we introduce a groundbreaking framework merging transfinite fixed-point theory, categorical...
Prediction and curation of missing biomedical identifier mappings with Biomappings
Prediction and curation of missing biomedical identifier mappings with Biomappings
AbstractMotivationBiomedical identifier resources (such as ontologies, taxonomies, and controlled vocabularies) commonly overlap in scope and contain equivalent entries under diffe...
Prediction and Curation of Missing Biomedical Identifier Mappings with Biomappings
Prediction and Curation of Missing Biomedical Identifier Mappings with Biomappings
AbstractMotivationBiomedical identifier resources (ontologies, taxonomies, controlled vocabularies) commonly overlap in scope and contain equivalent entries under different identif...
Transfinite Fixed-Point Resolution of Open Problems in Alpay Algebra
Transfinite Fixed-Point Resolution of Open Problems in Alpay Algebra
We introduce a transfinite fixed-point operator, denoted $\phi^\infty$, within the framework of Alpay Algebra---a categorical foundation for mathematical structures. This operator,...
Efficient object location determination and error analysis based on barycentric coordinates
Efficient object location determination and error analysis based on barycentric coordinates
AbstractIn this paper, we propose an efficient computational method for converting local coordinates to world coordinates using specially structured coordinate data. The problem in...
Similarity Search with Data Missing
Similarity Search with Data Missing
Similarity search is a fundamental research problem with broad applications in various research fields, including data mining, information retrieval, and machine learning. The core...
Emergent AI Identity via Transfinite Fixed-Point Convergence in Alpay Algebra
Emergent AI Identity via Transfinite Fixed-Point Convergence in Alpay Algebra
We present a theoretical framework characterizing AI identity as a transfinite fixed point emerging from self-referential algebraic processes. Building on Alpay Algebra's recursive...

