Lines Matching full:hamming
63 // Evaluates the Hamming filter of the given filter size window for the given
68 // cardinal multiplied by a recentered Hamming function. The traditional
69 // Hamming formula for a window of size N and n ranging in [0, N-1] is:
70 // hamming(n) = 0.54 - 0.46 * cos(2 * pi * n / (N-1)))
74 // hamming(x) = (0.54 -
87 (0.54f + 0.46f * cos(xpi / filter_size))); // hamming(x)
114 // The Hamming filter takes as much space in the source image in
320 // will be acceptable, and we use the fastest one, Hamming-1.
324 // resampling. In visual tests we see that Hamming-1 is not as good as
326 // about 30% faster than Lanczos-3. The use of Hamming-1 has been deemed
