Full search equivalent fast block matching using orthonormal tree-structured haar transform

The goal of block matching is to find small parts (blocks) of an image that are similar to a given pattern (template). A lot of full search (FS) equivalent algorithms are based on transforms. However, the template size is limited to be a power-of-two. In this paper, we consider a fast block matching algorithm based on orthonormal tree-structured Haar transform (OTSHT) which makes it possible to use a template with arbitrary size. We evaluated the pruning performance, computational complexity, and design of tree. The pruning performance is compared to the algorithm based on orthonormal Haar transform (OHT).