TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

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

Tutkimustuotosvertaisarvioitu

Yksityiskohdat

AlkuperäiskieliEnglanti
OtsikkoISPA 2017 - 10th International Symposium on Image and Signal Processing and Analysis
KustantajaIEEE COMPUTER SOCIETY PRESS
Sivut177-182
Sivumäärä6
ISBN (elektroninen)9781509040117
DOI - pysyväislinkit
TilaJulkaistu - 18 lokakuuta 2017
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaInternational Symposium on Image and Signal Processing and Analysis -
Kesto: 1 tammikuuta 1900 → …

Julkaisusarja

Nimi
ISSN (painettu)1845-5921

Conference

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

Tiivistelmä

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