Fast Overlapping Block Processing Algorithm for Feature Extraction

Symmetry

Jan Flusser¹  Sadiq M. Sait²  Basheera M. Mahmmod³  Sadiq H. Abdulhussain³  Khaled A. AL-Utaibi⁴ 

[1] Czech Academy of Sciences, Institute of Information Theory and Automation, Pod Vodárenskou vìží 4, 182 08 Prague, Czech Republic;Department of Computer Engineering, Center for Communications and IT Research, Research Institute, King Fahd University of Petroleum & Minerals, Dhahran 31261, Saudi Arabia;Department of Computer Engineering, University of Baghdad, Al-Jadriya, Baghdad 10071, Iraq;Department of Computer Engineering, University of Ha’il, Ha’il 55476, Saudi Arabia;

关键词: overlapping block processing;    feature extraction;    orthogonal polynomials;    orthogonal moments;   

DOI  :  10.3390/sym14040715

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown