A technique for pattern classification using the Fourier transform combined with the nearest neighbor classifier is proposed. The multidimensional fast Fourier transform (FFT) is applied to the patterns in the data base. Then the magnitudes of the Fourier coefficients are sorted in descending order and the first P coefficients with largest magnitudes are selected, where P is a design parameter. These coefficients are then used in further processing rather than the original patterns. When a noisy pattern is presented for classification, the pattern’s P Fourier coefficients with largest magnitude are extracted. The coefficients are arranged in a vector in the descending order of their magnitudes. The obtained vector is referred to as the signature vector of the corresponding pattern. Then the distance between the signature vector of the pattern to be classified and the signature vectors of the patterns in the data base are computed and the pattern to be classified is matched with a pattern in the data base whose signature vector is closest to the signature vector of the pattern being classified.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.