The time complexity of Fast Fourier Transform for an N x N image is:
a) O(N³)
b) O(N² log₂ N)
c) O(N³ log2 N)
d) None of the above
Choose the most correct option
a) An N point DFT, and N point inverse DFT both have period of N
b) Both DFT and IDFT are sepearable unitary transform
c) The recursive seperability of DFT makes it faster to compute, also known as FFT
d) All of above statements are correct
Which of the following is not a Unitary transformation?
a) Discrete Walsh Transform (DWT)
b) Discrete Fourier Transform (DFT)
c) KL Transform
d) None of the above
Which of the following the property(ies) is (are) used for centering and better visualization of two-dimension Discrete Fourier transform coefficients?
a) Translation property
b) Separability
c) Periodicity
d) Energy compactness
Which of the following transforms is preferred for its low cost hardware implementation?
a) Fast Walsh/Hadamard transform
b) DCT
c) FFT
d) KL Transform
Which of the following transforms is preferred for compressed storage of Images on computer with moderate compute power?
a) Fast Walsh/Hadamard transform
b) DCT
c) FFT
d) KL Transform
Which of the following transforms have exactly same basis images as that of walsh transform ( ignore the order of basis images)?
a) Hadamard Transform
b) KL transform
c) DCT
d) Ordered Hadamard Transform
Which of the following transforms have highest representative power and is preferred on servers with high compute power?
a) Fast Walsh/Hadamard transform
b) DCT
c) FFT
d) KL Transform
Which of the following recursive relation is used to obtain higher order Hadamared transform kernels?
a) H₂N HN HN HN HN
b) H₂N HN HN HN HN - =
c) H₂N HN HN - -HN HN =
d) None of the above mentioned.