Related papers: Principal angles and approximation for quaternioni…
We explain the orthogonal planes split (OPS) of quaternions based on the arbitrary choice of one or two linearly independent pure unit quaternions $f,g$. Next we systematically generalize the quaternionic Fourier transform (QFT) applied to…
Quaternion optimization has attracted significant interest due to its broad applications, including color face recognition, video compression, and signal processing. Despite the growing literature on quadratic and matrix quaternion…
This paper presents an experimental study on the application of quaternions in several machine learning algorithms. Quaternion is a mathematical representation of rotation in three-dimensional space, which can be used to represent complex…
Multi-view Geometry is reviewed from an Algebraic Geometry perspective and multi-focal tensors are constructed as equivariant projections of the Grassmannian. A connection to the principal minor assignment problem is made by considering…
We consider the geometry of four spatial displacements, arranged in cyclic order, such that the relative motion between neighbouring displacements is a pure rotation. We compute the locus of points whose homologous images lie on a circle,…
W projection is a commonly-used approach to allow interferometric imaging to be accelerated by Fast Fourier Transforms (FFTs), but it can require a huge amount of storage for convolution kernels. The kernels are not separable, but we show…
We address the problem of projecting a point onto a quadratic hypersurface, more specifically a central quadric. We show how this problem reduces to finding a given root of a scalar-valued nonlinear function. We completely characterize one…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
We show that every quadrangulation of the sphere can be transformed into a $4$-cycle by deletions of degree-$2$ vertices and by $t$-contractions at degree-$3$ vertices. A $t$-contraction simultaneously contracts all incident edges at a…
In this work, we present an adaptation of the classical stereographic projection, originally formulated for the sphere, now considering the context of the ellipsoid and the elliptic paraboloid. We begin by constructing the stereographic…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
This work rests upon the certainty that only fields of real and complex numbers, quaternions and octonions have algebras of all four arithmetical operations. Also quaternions are good to represent 3-dimensional Euclid space and…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
Given two disjoint convex polyhedra, we look for a best approximation pair relative to them, i.e., a pair of points, one in each polyhedron, attaining the minimum distance between the sets. Cheney and Goldstein showed that alternating…
Dimensionality is a major concern in analyzing large data sets. Some well known dimension reduction methods are for example principal component analysis (PCA), invariant coordinate selection (ICS), sliced inverse regression (SIR), sliced…
In this paper, we introduce and study frame of operators in quaternionic Hilbert spaces as a generalization of g frames which in turn generalized various notions like Pseduo frames, bounded quasi-projectors and frame of subspaces (fusion…
Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…
Closed form solutions for the computation of the solid angle from polygonal cross-sections are well known, however similar formulae for computation of projected solid angle are not generally available. Formulae for computing the projected…
This paper addresses the numerical computation of critical angles between two convex cones in finite-dimensional Euclidean spaces. We present a novel approach to computing these critical angles by reducing the problem to finding stationary…
In this paper, we studied the equilibrium problem where the bi-function may be quasiconvex with respect to the second variable and the feasible set is the intersection of a finite number of convex sets. We propose a projection-algorithm,…