Parameterisation of slant-Haar transforms
A parameterisation of the slant-Haar transform is presented, which includes an existing version of the slant-Haar transform. An efficient algorithm for the slant-Haar transform is developed and its computational complexity is estimated. The parametric slant-Haar transforms are compared to the Karhunen–Loeve transform. The parametric slant-Haar is shown to perform better than the commonly used slant-Haar and slant-Hadamard transforms for the first-order Markov model and also performs better than the discrete cosine transform for images approximated by the generalised image correlation model.