Is there any relation between Walsh Hadamard Transform and Slant Transform? Or is there any common property or similarity?
$\begingroup$
$\endgroup$
2
-
1$\begingroup$ Hi! This is a bit broad. What have you been figuring out so far? We don't know what you understand and what you not understand. Since the definitions of these two are pretty different, we can't really tell at which level of understanding we'd need to start explaining things. So, please: Enhance your question by editing it and giving way, way more background! Why you're asking this? What did a comparison of the definitions yield? What is it that you need help with, specifically? $\endgroup$– Marcus MüllerJun 17, 2019 at 4:57
-
1$\begingroup$ Any additional feedback required? $\endgroup$– Laurent DuvalAug 9, 2019 at 22:22
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
On a 2-sample vector, or $2\times2$ pixel images, Haar, Walsh-Hadamard, or Slant are exactly the same. They are all separable, orthogonal transformations with fast $N\log N$ algorithms. According to Slant Transform Image Coding, 1974, it is superior in appearance to the above, only inferior to Karhunen-Loève, which has no fast enough algorithms.
answered Jun 25, 2019 at 21:44