Spectral methods for threshold Boolean filtering

Jaakko T. Astola; Karen O. Egiazarian; David Zaven Gevorkian

doi:10.1117/12.206725

21 April 1995 Spectral methods for threshold Boolean filtering

Jaakko T. Astola, Karen O. Egiazarian, David Zaven Gevorkian

Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206725
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan

Abstract

An efficient spectral algorithm for representing any Boolean function as a linear combination of positive Boolean functions (PBF) is proposed. A processor architecture realizing this algorithm with the varying levels of parallelism is suggested. The algorithm finds not only the truth table of PBF's, but also their minimal disjunctive normal form representations. This allows to incorporate previously proposed efficient stack filtering designs into the construction of architectures for threshold Boolean filters.

Citation Download Citation

Jaakko T. Astola, Karen O. Egiazarian, and David Zaven Gevorkian "Spectral methods for threshold Boolean filtering", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206725

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