
366 A Computational Introduction to Digital Image Processing, Second Edition
This means that when we exclude elements from the transform, they must be excluded in
pairs. In other words, given a transform with N elements, all but 2k + 1 elements can be
excluded as shown in Figure 12.10.
DC
k elements
N − 2k − 1 zeros
k elements
FIGURE 12.10: Excluding elements from the DFT
In order to approximate a shape, given 2k + 1 non-zero elements of a transform, there
are several possibilities:
1. Apply the inverse transform to the complete N length vector (including the zeros),
and plot the result.
2. Simply invert the smaller vector of 2k + 1 elements, and plot