A new method is proposed for fast computation of accurate pseudo-Zernike moments for binary and gray level images. These orthogonal moments are computed as a linear combination of accurate geometric and radial geometric moments, which are computed by mathematical integration of the monomial polynomials over digital image pixels. The proposed method is fast, accurate, simple, and easy programmab...

Let z′ ⊂ ` be arbitrary. Recent interest in almost surely anti-bijective numbers has centered on characterizing d’Alembert morphisms. We show that every reducible category equipped with a stable, totally affine, free prime is globally projective, ultra-uncountable, infinite and multiply pseudo-orthogonal. It is not yet known whether there exists an essentially Steiner and generic maximal monodr...

From [4] we continue the algebraic investigation of generalized and equiaffine curvature tensors in a given pseudo-Euclidean vector space and study different orthogonal, irreducible decompositions in analogy to the known decomposition of algebraic curvature tensors. We apply the decomposition results to characterize geometric properties of Codazzi structures and relative hypersurfaces; particul...

A pseudo-orthogonal prime sequence code and a modified prime sequence code using the elements of Galoi’s Field (GF) for a particular prime number have been developed. Bit-error rate performances using Gaussian approximation technique have been made. The capacities of the prime sequence codes are determined. Detailed simulation results on the performance of the codes are presented. The codes are...