Paper
23 June 1993 FatBear: a nonarithmetic pico filter
Harold G. Longbotham, Mike Johnson, Jack Harris, Redouan Rouzky
Author Affiliations +
Abstract
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, Mike Johnson, Jack Harris, and Redouan Rouzky "FatBear: a nonarithmetic pico filter", Proc. SPIE 2030, Image Algebra and Morphological Image Processing IV, (23 June 1993); https://doi.org/10.1117/12.146654
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital filtering

Interference (communication)

Filtering (signal processing)

Binary data

Electronic filtering

Linear filtering

Quantization

Back to Top