Content deleted Content added
m Dating maintenance tags: {{Cn}} |
m clean up punctuation and spacing issues, primarily spacing around commas, replaced: ,K → , K (6), ,W → , W, ,d → , d (3), ,f → , f, ,i → , i (2), ,n → , n (47), ,s → , s (5), ,t → , t (4), ,w → , w (4), ,y → , y (5), ,z → , z ( |
||
Line 3:
== Multidimensional Fourier transform ==
One of the more popular multidimensional transforms is the [[Fourier transform]], which converts a signal from a time/space ___domain representation to a frequency ___domain representation.<ref name="Smith">Smith, W. Handbook of Real-Time Fast Fourier Transforms:Algorithms to Product Testing, Wiley_IEEE Press, edition 1, pages 73–80, 1995</ref> The discrete-___domain multidimensional Fourier transform (FT) can be computed as follows:
:<math> F(w_1,w_2,\dots,w_m) = \sum_{n_1=-\infty}^\infty \sum_{n_2=-\infty}^\infty \cdots \sum_{n_m=-\infty}^\infty f(n_1,n_2,\dots,n_m) e^{-i w_1 n_1 -i w_2 n_2 \cdots -i w_m n_m}</math>
Line 204:
One very important factor is that we must apply a non-destructive method to obtain those rare valuables information (from the HVS viewing point, is focused in whole colorimetric and spatial information) about works of art and zero-damage on them.
We can understand the arts by looking at a color change or by measuring the surface uniformity change. Since the whole image will be very huge, so we use a double raised cosine window to truncate the image:<ref name="Angelini et al">Angelini, E., Grassin, S.
:<math> w(x,y)=\frac{1}{4} \left(1 + \cos {\frac {x \pi} N }\right)\left(1 + \cos {\frac{y \pi} N }\right) </math>
| |||