By Topic

Fast computation of a class of running 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
$31 $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)
Coltuc, D. ; Res. Inst. for Electr. Eng., Bucharest, Romania ; Pitas, I.

This paper focuses on the computation of a class of running filters defined as the n-ary extension of an associative, commutative, and idempotent binary operation T on an ordered sequence of operands. The well-known max/min filters are the prominent representatives of the class. For any arbitrary window filter of size n, the existence of a fast algorithm of complexity O(log2 n) T operations is proven. A remarkable feature of the proof is its ability to generate a particular solution for every n. In addition to the theoretical results, practical implementation aspects regarding the flexibility of pipeline processors for fast computation of the one-dimensional (1-D) and two-dimensional (2-D) running filters are investigated

Published in:

Signal Processing, IEEE Transactions on  (Volume:46 ,  Issue: 3 )