Share Email Print
cover

Proceedings Paper

Decompositional algorithm for running stack filtering
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A new fast running filtering algorithm of decompositional type for realizing stack filters that are based on a subclass of positive Boolean functions, namely cyclic positive Boolean functions, is proposed. Peculiar to the presented algorithm is the use of Fibonacci p-codes, which make it possible to have a unified approach to running filtering, containing as special cases the complete threshold decomposition (when p is greater than the maximal value of input data) and the binary-tree threshold decomposition (when p equals 0). The choice of optimal value of p depends on the statistics of input data and reduces the complexity of running stack filtering.

Paper Details

Date Published: 1 May 1994
PDF: 10 pages
Proc. SPIE 2180, Nonlinear Image Processing V, (1 May 1994); doi: 10.1117/12.172575
Show Author Affiliations
Karen O. Egiazarian, Tampere Univ. of Technology (Finland)
Sos S. Agaian, Tufts Univ. (United States)
David Zaven Gevorkian, Institute for Problems of Informatics and Automation (Armenia)
Jaakko T. Astola, Tampere Univ. of Technology (Finland)


Published in SPIE Proceedings Vol. 2180:
Nonlinear Image Processing V
Edward R. Dougherty; Jaakko Astola; Harold G. Longbotham, Editor(s)

© SPIE. Terms of Use
Back to Top