Tampere University of Technology

TUTCRIS Research Portal

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Details

Original languageEnglish
Title of host publicationISPA 2017 - 10th International Symposium on Image and Signal Processing and Analysis
PublisherIEEE COMPUTER SOCIETY PRESS
Pages177-182
Number of pages6
ISBN (Electronic)9781509040117
DOIs
Publication statusPublished - 18 Oct 2017
Publication typeA4 Article in a conference publication
EventInternational Symposium on Image and Signal Processing and Analysis -
Duration: 1 Jan 1900 → …

Publication series

Name
ISSN (Print)1845-5921

Conference

ConferenceInternational Symposium on Image and Signal Processing and Analysis
Period1/01/00 → …

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).