Locally extended affine Lie algebras were introduced by Morita and Yoshii in [J. Algebra 301(1) (2006), 59-81] as a natural generalization of extended affine Lie algebras. After that, various generalizations of these Lie algebras have been investigated by others. It is known that a locally extended affine Lie algebra can be recovered from its centerless core, i.e., the ideal generated by weight...

We propose a novel image-recovery method using the covariance matrix of the red-green-blue (R-G-B) color histogram and tensor theories. The image-recovery method is called the color histogram normalization algorithm. It is known that the color histograms of an image taken under varied illuminations are related by a general affine transformation of the R-G-B coordinates when the illumination is ...

A new method is presented for identifying and comparing closed, bounded, free-form curves that are defined by even implicit polynomial (IP) equations in the Cartesian coordinates x and y. The method provides a new expression for an IP involving a product of conic factors with unique conic factor centers. The critical points for an IP curve also are defined. The conic factor centers and the crit...

Abstract: LOGO is a programming language incorporating turtle graphics, originally devised for teaching computing to young children in elementary and middle schools. Here we advocate the use of LOGO to help introduce some of the basic concepts of computer graphics and computer aided design to undergraduate and graduate students in colleges and universities. We shall show how to motivate affine ...

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible decomposition of a variety is typically understood in affine space, including also those components with zero coordinates. We present a polyhedral method to compute ...

computer graphics, transformations, texture mapping In a 3D graphics application, a common operation is the binding of a 2D texture onto a triangle in a 3D positional space. For light-dependent or view-dependent texture mapping, a need may arise in the graphics pipeline to transform the light or view direction vector into texture space. The affine transformation is unique within the plane of th...

As a public key cryptography, Elliptic Curve Cryptography (ECC) is well known to be the most secure algorithms that can be used to protect information during the transmission. ECC in its arithmetic computations suffers from modular inversion operation. Modular Inversion is a main arithmetic and very long-time operation that performed by the ECC crypto-processor. The use of projective coordinate...

Abstract We quantize the Schwarzschild spacetime with naked singularity using affine coherent states quantization method. The novelty of our approach is both temporal and spatial coordinates. Quantization smears gravitational indicated by Kretschmann invariant avoiding its localization in configuration space. This way we resolve problem considered at quantum level.

In 1912 Bieberbach proved that every compact flat Riemannian manifold M is finitely covered by a flat torus. More precisely, M has the form (F\G)/H where G is a group of translations of Euclidean space, F c G is a discrete subgroup, and H is a finite group of isometries of the space of right cosets F\G. For a proof see e.g. Wolf [18]. The condition that M has a flat Riemannian metric can be sep...

In this work, we present a novel and practical approach to address one of the longstanding problems in computer vision: 2D and 3D affine invariant feature matching. Our Grassmannian Graph (GrassGraph) framework employs a two stage procedure that is capable of robustly recovering correspondences between two unorganized, affinely related feature (point) sets. The first stage maps the feature sets...