Share Email Print

Proceedings Paper

Spectral methods for threshold Boolean filtering
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

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.

Paper Details

Date Published: 21 April 1995
PDF: 10 pages
Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206725
Show Author Affiliations
Jaakko T. Astola, Tampere Univ. of Technology (Finland)
Karen O. Egiazarian, Tampere Univ. of Technology (Finland)
David Zaven Gevorkian, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 2501:
Visual Communications and Image Processing '95
Lance T. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top