“…In order to reduce the computational complexity and time cost, a lot of fast algorithms are proposed as an alternative to the full search algorithm, some of them using normalized correlation as similarity [9], [10], [11], [12], [13], [14], and some of them using the sum of absolute differences (SAD), the sum of squared differences (SSD) or L p distance as dissimilarity. Certainly, general pattern matching may use the Hamming distance [15], or even use the dissimilarity between pattern descriptors and candidate window descriptors [16], [17], [18], [19], [20].…”