Fast Overlapping Block Processing Algorithm for Feature Extraction

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F22%3A00556266" target="_blank" >RIV/67985556:_____/22:00556266 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61384399:31160/22:00058822

Výsledek na webu

<a href="https://www.mdpi.com/2073-8994/14/4/715" target="_blank" >https://www.mdpi.com/2073-8994/14/4/715</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/sym14040715" target="_blank" >10.3390/sym14040715</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Fast Overlapping Block Processing Algorithm for Feature Extraction

Popis výsledku v původním jazyce

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally that the speed up of the proposed method compared with traditional approaches approximately reaches up to 20 times depending on the block parameters.

Název v anglickém jazyce

Fast Overlapping Block Processing Algorithm for Feature Extraction

Popis výsledku anglicky

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally that the speed up of the proposed method compared with traditional approaches approximately reaches up to 20 times depending on the block parameters.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA21-03921S" target="_blank" >GA21-03921S: Inverzní problémy ve zpracování obrazu</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Symmetry-Basel

ISSN

2073-8994

e-ISSN

2073-8994

Svazek periodika

14

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

13

Strana od-do

715

Kód UT WoS článku

000787427200001

EID výsledku v databázi Scopus

2-s2.0-85128291521