Digital Filters Based On Threshold Decomposition And Boolean Functions

Jaakko Astola; Lasse Koskinen; Olli Yli-Harja; Yrjo Neuvo

doi:10.1117/12.970056

1 November 1989 Digital Filters Based On Threshold Decomposition And Boolean Functions

Jaakko Astola, Lasse Koskinen, Olli Yli-Harja, Yrjo Neuvo

Proceedings Volume 1199, Visual Communications and Image Processing IV; (1989) https://doi.org/10.1117/12.970056
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States

Abstract

In this paper we discuss certain limitations which are inherent in filters that are based on threshold decomposition and Boolean functions. We also define a generalization of stack filters by dropping the requirement of positivity in the defining Boolean function. We show that while some of the nice properties of stack filters are lost the extra design freedom makes it possible to construct filters which have certain attractive properties that are not attainable with stack filters.

Citation Download Citation

Jaakko Astola, Lasse Koskinen, Olli Yli-Harja, and Yrjo Neuvo "Digital Filters Based On Threshold Decomposition And Boolean Functions", Proc. SPIE 1199, Visual Communications and Image Processing IV, (1 November 1989); https://doi.org/10.1117/12.970056

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