@inproceedings{d0be28f9c84c45aaa54493255743861a,
title = "Full search equivalent fast block matching using orthonormal tree-structured haar transform",
abstract = "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).",
author = "Izumi Ito and Karen Egiazarian",
note = "jufoid=57665; International Symposium on Image and Signal Processing and Analysis ; Conference date: 01-01-1900",
year = "2017",
month = oct,
day = "18",
doi = "10.1109/ISPA.2017.8073591",
language = "English",
publisher = "IEEE COMPUTER SOCIETY PRESS",
pages = "177--182",
booktitle = "ISPA 2017 - 10th International Symposium on Image and Signal Processing and Analysis",
}