Share Email Print
cover

Proceedings Paper

Spectral approach to selection probabilities of stack filters
Author(s): Karen O. Egiazarian; Pauli Kuosmanen; Jaakko T. Astola; Sos S. Agaian
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

Spectral approaches to the selection probabilities of stack filters are derived. The spectral algorithms are given for the computation of the rank and sample selection probability vectors. They have computational complexity O(2N), where N is the number of input samples within the window. The main advantage of the spectral algorithms to the nonspectral ones is that spectral algorithms are universal in the sense that the complexities of these algorithms are independent on the logical function used as the base for stack filtering. They are also straightforward to implement and fast spectral transforms exist.

Paper Details

Date Published: 28 March 1995
PDF: 12 pages
Proc. SPIE 2424, Nonlinear Image Processing VI, (28 March 1995); doi: 10.1117/12.205263
Show Author Affiliations
Karen O. Egiazarian, Tampere Univ. of Technology (Finland)
Pauli Kuosmanen, Tampere Univ. of Technology (Finland)
Jaakko T. Astola, Tampere Univ. of Technology (Finland)
Sos S. Agaian, Tufts. Univ. (United States)


Published in SPIE Proceedings Vol. 2424:
Nonlinear Image Processing VI
Edward R. Dougherty; Jaakko T. Astola; Harold G. Longbotham; Nasser M. Nasrabadi; Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top