Related papers: The discrete cosine transform on triangles
The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
Analytic expressions for the Fourier transforms of the Chebyshev and Legendre polynomials are derived, and the latter is used to find a new representation for the half-order Bessel functions. The numerical implementation of the so-called…
Following the previous authors works (joint with I.A.Dynnikov) we develop a theory of the discrete analogs of the differential-geometrical (DG) connections in the triangulated manifolds. We study a nonstandard discretization based on the…
This paper examines finite field trigonometry as a tool to construct trigonometric digital transforms. In particular, by using properties of the k-cosine function over GF(p), the Finite Field Discrete Cosine Transform (FFDCT) is introduced.…
Differential calculus on discrete spaces is studied in the manner of non-commutative geometry by representing the differential calculus by an operator algebra on a suitable Krein space. The discrete analogue of a (pseudo-)Riemannian metric…
Crum's theorem and its modification a la Krein-Adler are formulated for the discrete quantum mechanics with real shifts, whose eigenfunctions consist of orthogonal polynomials of a discrete variable. The modification produces the associated…
The discrete cosine transform (DCT) is a central tool for image and video coding because it can be related to the Karhunen-Lo\`eve transform (KLT), which is the optimal transform in terms of retained transform coefficients and data…
In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
Darboux transformations for polynomial perturbations of a real multivariate measure are found. The 1D Christoffel formula is extended to the multidimensional realm: multivariate orthogonal polynomials are expressed in terms of last…
This paper presents a new mathematical signal transform that is especially suitable for decoding information related to non-rigid signal displacements. We provide a measure theoretic framework to extend the existing Cumulative Distribution…
The discrete cosine transform (DCT) is a relevant tool in signal processing applications, mainly known for its good decorrelation properties. Current image and video coding standards -- such as JPEG and HEVC -- adopt the DCT as a…
How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…
We introduce the notion of a bivariate random discrete copula on an equidistant mesh and explore its stochastic properties. A random discrete copula is a discrete random field, hence, its value at a given point on the mesh is a random…
We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and…
Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform, called steerable DFT…
Discrete tomography is a well-established method to investigate finite point sets, in particular finite subsets of periodic systems. Here, we start to develop an efficient approach for the treatment of finite subsets of mathematical…
An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced. The proposed transformation matrix contains only zeros and ones; multiplications and bit-shift operations are absent. Close spectral behavior…
We propose an algorithm for the orthogonal fast discrete spherical Bessel transform on an uniform grid. Our approach is based upon the spherical Bessel transform factorization into the two subsequent orthogonal transforms, namely the fast…