Contents
1 Discrete 2-D Fourier Transform
1.2 Vector forms of representation
1.3 Partitioning of 2-D transforms
1.3.2 Covering with cyclic groups
1.4 Tensor representation of the 2-D DFT
1.4.0.1 Code: Splitting-signal calculation
1.4.1 Tensor algorithm of the 2-D DFT
1.4.2.1 Code: 2-D DFT by tensor transform
1.4.4 N is a power of an odd prime
1.4.5 Case N = L1L2 (L1 ≠ L2 ˃ 1)
1.5 Discrete Fourier transform and its geometry
2.1 2-D direction images on the lattice
Get Image Processing now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.