21 May 1993 Comparator stack design for order statistic filtering of digital imagery
Author Affiliations +
Abstract
The proposed design is a circuit that determines the order statistics of an arbitrary length, N, string of numbers as the string is acquired. The computational time complexity for the design is optimally O(N). This is a valuable filtering method, e.g., the median filter, for suppressing and quite often eliminating impulse noise while preserving the edges of objects in an image. Two other closely related methods of order statistic filtering, stack filters, and morphological algebra, are determined to be very limited with regard to the number of template or window elements that can be used in the filtering process and not practical for two-dimensional imagery. The comparator stack circuit does not have this restriction. Also, the comparator stack method operates at or near the same cost function as a single convolution operation with the same template configuration, thus O(N).
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Patrick C. Coffield, Patrick C. Coffield, } "Comparator stack design for order statistic filtering of digital imagery", Proc. SPIE 1902, Nonlinear Image Processing IV, (21 May 1993); doi: 10.1117/12.144749; https://doi.org/10.1117/12.144749
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Decompositional algorithm for running stack filtering
Proceedings of SPIE (May 01 1994)
Recursive FatBear filter
Proceedings of SPIE (May 01 1994)
Fixed-point analysis of stack filters
Proceedings of SPIE (July 01 1990)
Multilayer Boolean and stack filter design
Proceedings of SPIE (May 01 1994)

Back to Top