By Topic

On fast running max-min filtering

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

2 Author(s)
D. Coltuc ; Res. Inst. for Electr. Eng., Bucharest, Romania ; I. Pitas

The problem of fast running max/min filters for arbitrary size windows is addressed. The size of the filter window is increased to the least power of two greater than the given size and, the input sequence is expanded. The running max/min computation uses a fast algorithm for power of two window sizes. The computational complexity (comparisons per sample) of the proposed algorithm is very close to log2 n, where n is the size of the given window. A flexible hardware implementation for n ranging between two consecutive powers of two is discussed

Published in:

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing  (Volume:44 ,  Issue: 8 )