Share Email Print
cover

Proceedings Paper

Reshuffling: a fast algorithm for filtering with arbitrary kernels
Author(s): Fatih Porikli
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A novel method to accelerate the application of linear filters that have multiple identical coefficients on arbitrary kernels is presented. Such filters, including Gabor filters, gray level morphological operators, volume smoothing functions, etc., are widely used in many computer vision tasks. By taking advantage of the overlapping area between the kernels of the neighboring points, the reshuffling technique prevents from the redundant multiplications when the filter response is computed. It finds a set of unique coefficients, constructs a set of relative links for each coefficient, and then sweeps through the input data by accumulating the responses at each point while applying the coefficients using their relative links. Dual solutions, single input access and single output access, that achieve 40% performance improvement are provided. In addition to computational advantage, this method keeps a minimal memory imprint, which makes it an ideal method for embedded platforms. The effects of quantization, kernel size, and symmetry on the computational savings are discussed. Results prove that the reshuffling is superior to the conventional approach.

Paper Details

Date Published: 4 March 2008
PDF: 10 pages
Proc. SPIE 6811, Real-Time Image Processing 2008, 68110M (4 March 2008); doi: 10.1117/12.772114
Show Author Affiliations
Fatih Porikli, Mitsubishi Electric Research Labs. (United States)


Published in SPIE Proceedings Vol. 6811:
Real-Time Image Processing 2008
Nasser Kehtarnavaz; Matthias F. Carlsohn, Editor(s)

© SPIE. Terms of Use
Back to Top