Spectral approach to selection probabilities of stack filters

Karen O. Egiazarian; Pauli Kuosmanen; Jaakko T. Astola; Sos S. Agaian

doi:10.1117/12.205263

28 March 1995 Spectral approach to selection probabilities of stack filters

Karen O. Egiazarian, Pauli Kuosmanen, Jaakko T. Astola, Sos S. Agaian

Proceedings Volume 2424, Nonlinear Image Processing VI; (1995) https://doi.org/10.1117/12.205263
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States

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(2^N), 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.

Citation Download Citation

Karen O. Egiazarian, Pauli Kuosmanen, Jaakko T. Astola, and Sos S. Agaian "Spectral approach to selection probabilities of stack filters", Proc. SPIE 2424, Nonlinear Image Processing VI, (28 March 1995); https://doi.org/10.1117/12.205263

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available