An improvement in block matching algorithms using a dissimilarity measure in frequency domain transform

Abstract

In this work, the image block matching based on dissimilarity measure is investigated. Moreover, an unsupervised approach is implemented to yield that the algorithms have low complexity (in numbers of operations) compared to the full search algorithm. The state-of-the-art experiments only use discrete cosine transform as a domain transform. In addition, some images were tested to evaluate the algorithms. However, these images were not evaluated according to specific characteristics. So, in this paper, an improved version is presented to tackle the problem of dissimilarity measure in block matching with a noisy environment, using another’s domain transforms or low-pass filters to obtain a better result in block matching implementing a quantitive measure with an average accuracy margin of ± 0.05 is obtained. The theoretical analysis indicates that the complexity of these algorithms is still accurate, so implementing Hadamard spectral coefficients and Fourier filters can easily be adjusted to obtain a better accuracy of the matched block group.