23 June 1993 FatBear: a nonarithmetic pico filter
Author Affiliations +
This paper is but a first step toward a fast, robust, nonarithmetic filtering theory. The following will assume the sampled sequence is from a finite TOS (totally ordered set) S so that any subset (window) of sequence values may be ordered. In addition we will assume the existence of a distance function (metric) on S. This distance function may be as simple as counting but all results presented hold for any TOS with any distance function. In addition a median type operator will be defined that always has as output an element in S, unlike the usual median operator. Implementations will be discussed. It will be shown that implementation involves only a two layer NAND/NOR for ordering and range estimations, and the assumption of counting. Operation counts will be discussed.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Harold G. Longbotham, Harold G. Longbotham, Mike Johnson, Mike Johnson, Jack Harris, Jack Harris, Redouan Rouzky, Redouan Rouzky, } "FatBear: a nonarithmetic pico filter", Proc. SPIE 2030, Image Algebra and Morphological Image Processing IV, (23 June 1993); doi: 10.1117/12.146654; https://doi.org/10.1117/12.146654


Stanford neural network research
Proceedings of SPIE (August 18 1993)
Adaptive LMS FFT-ordered L-filters
Proceedings of SPIE (April 03 1997)
Signal Processing Technology Overview
Proceedings of SPIE (July 29 1982)

Back to Top