The sine transform

1. The NxN sine transform matrix Ψ = {Ψ(k, n)}, also called the discrete sine
transform DST, is defined as

2. The sine transform pair of one-dimensional sequences is defined as

3. The basis vectors of the 8x8 DST are shown below:

k=0

k=1

k=2

k=3

k=4

k=5

k=6

k=7
 Properties of the Sine Transform

(1) The sine transform is real, symmetric, and orthogonal, that is,

Thus, the forward and inverse sine transforms are identical.

(2) The sine transform is not the imaginary part of the unitary DFT. The sine transform
of a sequence is related to the DFT of its antisymmetric extension

(3) The sine transform is a fast transform. The sine transform (or its inverse) of a vector
of N elements can be calculated in O(N log2N) operations via a 2( N + 1 )-point FFT.

Typically this requires N + 1 = 2P, that is, the fast sine transform is usually defined for N
= 3, 7, 15, 31, 63, 255, . . . . These algorithms are somewhat faster than the FFT and the
fast cosine transform algorithms.

(4) The basis vectors of the sine transform are the eigenvectors of the symmetric
tridiagonal Toeplitz matrix

(5) The sine transform is close to the KL transform of first order stationary Markov
sequences, when the correlation parameter ρ lies in the interval (-0.5, 0.5). In general it
has very good to excellent energy compaction property for images.

(6) The sine transform leads to a fast KL transform algorithm for Markov sequences,
whose boundary values are given. This makes it useful in many image processing
problems.