Share Email Print

Proceedings Paper

Fixed-point analysis of stack filters
Author(s): Parimal J. Patel; Harold G. Longbotham; Norman Barsalou
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

We extend the current theory of stack filters by determining fixed points for the infmite length signals using positive Boolean functions. Fixed point analysis is basically determining root structure. We describe the fixed point structure for three and four variable positive Boolean functions and describe how one may generate larger positive Boolean functions and simultaneously generate their fixed point structure. We give two explicit formulations for the stack filter that correspond to any positive Boolean function. We then discuss explicit algorithms for generalizing positive Boolean functions that will "stack" on each other. We define a generalized stack filter as the filter that has varying positive Boolean function at various levels. We provide sufficient conditions so that positive Boolean functions in a generalized stack filter can be varied at levels and still uphold threshold decomposition and stacking properties. We also describe a rule which must be followed in the stacking of rank order filters if the stacking property is to be satisfied. Design of stack filters is also presented.

Paper Details

Date Published: 1 July 1990
PDF: 10 pages
Proc. SPIE 1247, Nonlinear Image Processing, (1 July 1990); doi: 10.1117/12.19609
Show Author Affiliations
Parimal J. Patel, Univ. of Texas/San Antonio (United States)
Harold G. Longbotham, Univ. of Texas/San Antonio (United States)
Norman Barsalou, Univ. of Texas/San Antonio (United States)

Published in SPIE Proceedings Vol. 1247:
Nonlinear Image Processing
Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top