By Topic

Improving Gil-Werman algorithm for running min and max filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gevorkian, D.Z. ; Signal Process. Lab., Tampere Univ. of Technol., Finland ; Astola, J.T. ; Atourian, S.M.

The current best bound on the number of comparison operations needed to compute the running maximum or minimum over a p-element sliding data window is approximately three comparisons per output sample. This bound is probabilistic for some algorithms and is derived for their complexities on the average for independent, identically distributed (i.i.d.) input signals. The worst-case complexities of these algorithms are O(p). The worst-case complexity Cr=3 -4/p comparisons per output sample for 1D signals is achieved in the Gil-Werman algorithm (1993). In this correspondence we propose a modification of the Gil-Werman algorithm with the same worst-case complexity but with a lower average complexity. A theoretical analysis shows that using the proposed modification the complexities of sliding max or min 1D and 2D filters over i.i.d. signals are reduced to C1 =2.5-3.5/p+1/p2 and C2=5-7/p+2/p2 comparisons per output sample on the average, respectively. Simulations confirm the theoretical results. Moreover, experiments show that even for highly correlated data, namely, for real images the behavior of the algorithm remains the same as for i.i.d. signals

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:19 ,  Issue: 5 )